./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/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 7974185e330e91a4e9731c3e8d6ea997b9a774a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:31:00,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:31:00,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:31:00,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:31:00,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:31:00,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:31:00,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:31:00,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:31:00,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:31:00,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:31:00,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:31:00,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:31:00,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:31:00,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:31:00,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:31:00,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:31:00,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:31:00,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:31:00,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:31:00,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:31:00,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:31:00,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:31:00,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:31:00,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:31:00,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:31:00,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:31:00,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:31:00,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:31:00,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:31:00,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:31:00,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:31:00,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:31:00,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:31:00,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:31:00,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:31:00,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:31:00,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:31:00,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:31:00,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:31:00,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:31:00,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:31:00,104 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:31:00,114 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:31:00,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:31:00,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:31:00,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:31:00,115 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:31:00,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:31:00,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:31:00,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:31:00,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:31:00,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:31:00,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:31:00,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:31:00,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:31:00,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:31:00,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:31:00,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:31:00,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:31:00,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:31:00,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:31:00,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:31:00,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:31:00,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:31:00,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:31:00,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:31:00,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:31:00,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:31:00,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:31:00,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:31:00,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:31:00,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/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 -> 7974185e330e91a4e9731c3e8d6ea997b9a774a6 [2019-12-07 13:31:00,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:31:00,230 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:31:00,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:31:00,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:31:00,235 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:31:00,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2019-12-07 13:31:00,283 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/data/a4c799b99/a927cd9c9d3043ea816c831843b79a4e/FLAG1d7b0aa5d [2019-12-07 13:31:00,732 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:31:00,732 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2019-12-07 13:31:00,741 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/data/a4c799b99/a927cd9c9d3043ea816c831843b79a4e/FLAG1d7b0aa5d [2019-12-07 13:31:00,753 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/data/a4c799b99/a927cd9c9d3043ea816c831843b79a4e [2019-12-07 13:31:00,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:31:00,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:31:00,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:31:00,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:31:00,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:31:00,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:31:00" (1/1) ... [2019-12-07 13:31:00,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3a36ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:00, skipping insertion in model container [2019-12-07 13:31:00,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:31:00" (1/1) ... [2019-12-07 13:31:00,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:31:00,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:31:01,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:31:01,016 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:31:01,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:31:01,076 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:31:01,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01 WrapperNode [2019-12-07 13:31:01,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:31:01,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:31:01,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:31:01,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:31:01,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:31:01,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:31:01,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:31:01,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:31:01,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... [2019-12-07 13:31:01,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:31:01,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:31:01,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:31:01,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:31:01,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/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 [2019-12-07 13:31:01,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:31:01,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:31:01,703 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:31:01,703 INFO L287 CfgBuilder]: Removed 39 assume(true) statements. [2019-12-07 13:31:01,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:31:01 BoogieIcfgContainer [2019-12-07 13:31:01,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:31:01,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:31:01,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:31:01,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:31:01,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:31:00" (1/3) ... [2019-12-07 13:31:01,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2c8480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:31:01, skipping insertion in model container [2019-12-07 13:31:01,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:31:01" (2/3) ... [2019-12-07 13:31:01,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2c8480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:31:01, skipping insertion in model container [2019-12-07 13:31:01,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:31:01" (3/3) ... [2019-12-07 13:31:01,710 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2019-12-07 13:31:01,716 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:31:01,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-12-07 13:31:01,728 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:31:01,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:31:01,749 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:31:01,749 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:31:01,749 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:31:01,749 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:31:01,749 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:31:01,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:31:01,749 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:31:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2019-12-07 13:31:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:31:01,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:01,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:01,776 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2019-12-07 13:31:01,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:01,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561325143] [2019-12-07 13:31:01,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:01,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561325143] [2019-12-07 13:31:01,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:01,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:01,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383627416] [2019-12-07 13:31:01,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:01,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:01,917 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 3 states. [2019-12-07 13:31:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:02,168 INFO L93 Difference]: Finished difference Result 725 states and 1316 transitions. [2019-12-07 13:31:02,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:02,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 13:31:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:02,181 INFO L225 Difference]: With dead ends: 725 [2019-12-07 13:31:02,181 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 13:31:02,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 13:31:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 434. [2019-12-07 13:31:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-07 13:31:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 681 transitions. [2019-12-07 13:31:02,235 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 681 transitions. Word has length 28 [2019-12-07 13:31:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:02,236 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 681 transitions. [2019-12-07 13:31:02,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 681 transitions. [2019-12-07 13:31:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:31:02,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:02,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:02,239 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1366485519, now seen corresponding path program 1 times [2019-12-07 13:31:02,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:02,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89082645] [2019-12-07 13:31:02,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:02,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89082645] [2019-12-07 13:31:02,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:02,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:02,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440132370] [2019-12-07 13:31:02,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:02,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,288 INFO L87 Difference]: Start difference. First operand 434 states and 681 transitions. Second operand 3 states. [2019-12-07 13:31:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:02,388 INFO L93 Difference]: Finished difference Result 1135 states and 1805 transitions. [2019-12-07 13:31:02,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:02,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 13:31:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:02,393 INFO L225 Difference]: With dead ends: 1135 [2019-12-07 13:31:02,393 INFO L226 Difference]: Without dead ends: 715 [2019-12-07 13:31:02,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-07 13:31:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 699. [2019-12-07 13:31:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-12-07 13:31:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1128 transitions. [2019-12-07 13:31:02,431 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1128 transitions. Word has length 37 [2019-12-07 13:31:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:02,432 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1128 transitions. [2019-12-07 13:31:02,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1128 transitions. [2019-12-07 13:31:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 13:31:02,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:02,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:02,435 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:02,435 INFO L82 PathProgramCache]: Analyzing trace with hash -226101542, now seen corresponding path program 1 times [2019-12-07 13:31:02,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:02,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839426795] [2019-12-07 13:31:02,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:02,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839426795] [2019-12-07 13:31:02,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:02,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:02,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44073791] [2019-12-07 13:31:02,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:02,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:02,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:02,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,477 INFO L87 Difference]: Start difference. First operand 699 states and 1128 transitions. Second operand 3 states. [2019-12-07 13:31:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:02,522 INFO L93 Difference]: Finished difference Result 1765 states and 2849 transitions. [2019-12-07 13:31:02,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:02,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 13:31:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:02,528 INFO L225 Difference]: With dead ends: 1765 [2019-12-07 13:31:02,528 INFO L226 Difference]: Without dead ends: 1091 [2019-12-07 13:31:02,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-12-07 13:31:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1079. [2019-12-07 13:31:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-12-07 13:31:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1738 transitions. [2019-12-07 13:31:02,563 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1738 transitions. Word has length 38 [2019-12-07 13:31:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:02,563 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1738 transitions. [2019-12-07 13:31:02,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1738 transitions. [2019-12-07 13:31:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 13:31:02,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:02,565 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:02,565 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash -775080850, now seen corresponding path program 1 times [2019-12-07 13:31:02,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:02,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433325975] [2019-12-07 13:31:02,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:02,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433325975] [2019-12-07 13:31:02,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:02,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:02,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135345659] [2019-12-07 13:31:02,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:02,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:02,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,610 INFO L87 Difference]: Start difference. First operand 1079 states and 1738 transitions. Second operand 3 states. [2019-12-07 13:31:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:02,667 INFO L93 Difference]: Finished difference Result 2885 states and 4646 transitions. [2019-12-07 13:31:02,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:02,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 13:31:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:02,675 INFO L225 Difference]: With dead ends: 2885 [2019-12-07 13:31:02,675 INFO L226 Difference]: Without dead ends: 1831 [2019-12-07 13:31:02,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-12-07 13:31:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1685. [2019-12-07 13:31:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-12-07 13:31:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2676 transitions. [2019-12-07 13:31:02,718 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2676 transitions. Word has length 46 [2019-12-07 13:31:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:02,718 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 2676 transitions. [2019-12-07 13:31:02,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2676 transitions. [2019-12-07 13:31:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:31:02,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:02,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:02,719 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:02,720 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-12-07 13:31:02,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:02,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171258275] [2019-12-07 13:31:02,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:02,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171258275] [2019-12-07 13:31:02,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:02,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:02,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932586435] [2019-12-07 13:31:02,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:02,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:02,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,758 INFO L87 Difference]: Start difference. First operand 1685 states and 2676 transitions. Second operand 3 states. [2019-12-07 13:31:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:02,903 INFO L93 Difference]: Finished difference Result 4701 states and 7444 transitions. [2019-12-07 13:31:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:02,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 13:31:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:02,915 INFO L225 Difference]: With dead ends: 4701 [2019-12-07 13:31:02,915 INFO L226 Difference]: Without dead ends: 3035 [2019-12-07 13:31:02,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-12-07 13:31:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2969. [2019-12-07 13:31:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2969 states. [2019-12-07 13:31:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 4639 transitions. [2019-12-07 13:31:02,993 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 4639 transitions. Word has length 52 [2019-12-07 13:31:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:02,993 INFO L462 AbstractCegarLoop]: Abstraction has 2969 states and 4639 transitions. [2019-12-07 13:31:02,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 4639 transitions. [2019-12-07 13:31:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:31:02,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:02,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:02,995 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-12-07 13:31:02,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:02,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091683386] [2019-12-07 13:31:02,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:03,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091683386] [2019-12-07 13:31:03,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:03,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:03,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333140141] [2019-12-07 13:31:03,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:03,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:03,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:03,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:03,021 INFO L87 Difference]: Start difference. First operand 2969 states and 4639 transitions. Second operand 3 states. [2019-12-07 13:31:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:03,143 INFO L93 Difference]: Finished difference Result 6983 states and 10862 transitions. [2019-12-07 13:31:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:03,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 13:31:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:03,159 INFO L225 Difference]: With dead ends: 6983 [2019-12-07 13:31:03,159 INFO L226 Difference]: Without dead ends: 4037 [2019-12-07 13:31:03,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2019-12-07 13:31:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 3853. [2019-12-07 13:31:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2019-12-07 13:31:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5937 transitions. [2019-12-07 13:31:03,268 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5937 transitions. Word has length 52 [2019-12-07 13:31:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:03,268 INFO L462 AbstractCegarLoop]: Abstraction has 3853 states and 5937 transitions. [2019-12-07 13:31:03,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5937 transitions. [2019-12-07 13:31:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:31:03,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:03,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:03,270 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1739823060, now seen corresponding path program 1 times [2019-12-07 13:31:03,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:03,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741338375] [2019-12-07 13:31:03,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:03,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741338375] [2019-12-07 13:31:03,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:03,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:03,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22038982] [2019-12-07 13:31:03,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:03,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:03,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:03,299 INFO L87 Difference]: Start difference. First operand 3853 states and 5937 transitions. Second operand 3 states. [2019-12-07 13:31:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:03,656 INFO L93 Difference]: Finished difference Result 9269 states and 14370 transitions. [2019-12-07 13:31:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:03,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 13:31:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:03,678 INFO L225 Difference]: With dead ends: 9269 [2019-12-07 13:31:03,678 INFO L226 Difference]: Without dead ends: 5439 [2019-12-07 13:31:03,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2019-12-07 13:31:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5349. [2019-12-07 13:31:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5349 states. [2019-12-07 13:31:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 8153 transitions. [2019-12-07 13:31:03,830 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 8153 transitions. Word has length 57 [2019-12-07 13:31:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:03,831 INFO L462 AbstractCegarLoop]: Abstraction has 5349 states and 8153 transitions. [2019-12-07 13:31:03,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 8153 transitions. [2019-12-07 13:31:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 13:31:03,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:03,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:03,832 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -635425216, now seen corresponding path program 1 times [2019-12-07 13:31:03,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:03,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172599684] [2019-12-07 13:31:03,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:03,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172599684] [2019-12-07 13:31:03,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:03,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:03,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710567861] [2019-12-07 13:31:03,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:03,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:03,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:03,860 INFO L87 Difference]: Start difference. First operand 5349 states and 8153 transitions. Second operand 3 states. [2019-12-07 13:31:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:04,009 INFO L93 Difference]: Finished difference Result 10675 states and 16276 transitions. [2019-12-07 13:31:04,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:04,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 13:31:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:04,030 INFO L225 Difference]: With dead ends: 10675 [2019-12-07 13:31:04,030 INFO L226 Difference]: Without dead ends: 5349 [2019-12-07 13:31:04,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2019-12-07 13:31:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 5349. [2019-12-07 13:31:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5349 states. [2019-12-07 13:31:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 8017 transitions. [2019-12-07 13:31:04,227 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 8017 transitions. Word has length 59 [2019-12-07 13:31:04,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:04,227 INFO L462 AbstractCegarLoop]: Abstraction has 5349 states and 8017 transitions. [2019-12-07 13:31:04,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 8017 transitions. [2019-12-07 13:31:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 13:31:04,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:04,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:04,229 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash 556254941, now seen corresponding path program 1 times [2019-12-07 13:31:04,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:04,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366386587] [2019-12-07 13:31:04,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:04,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366386587] [2019-12-07 13:31:04,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:04,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:04,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683938779] [2019-12-07 13:31:04,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:04,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:04,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:04,253 INFO L87 Difference]: Start difference. First operand 5349 states and 8017 transitions. Second operand 3 states. [2019-12-07 13:31:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:04,537 INFO L93 Difference]: Finished difference Result 12059 states and 18112 transitions. [2019-12-07 13:31:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:04,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 13:31:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:04,561 INFO L225 Difference]: With dead ends: 12059 [2019-12-07 13:31:04,562 INFO L226 Difference]: Without dead ends: 6733 [2019-12-07 13:31:04,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2019-12-07 13:31:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 5991. [2019-12-07 13:31:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5991 states. [2019-12-07 13:31:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 8803 transitions. [2019-12-07 13:31:04,706 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 8803 transitions. Word has length 60 [2019-12-07 13:31:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:04,706 INFO L462 AbstractCegarLoop]: Abstraction has 5991 states and 8803 transitions. [2019-12-07 13:31:04,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 8803 transitions. [2019-12-07 13:31:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 13:31:04,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:04,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:04,708 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1524089549, now seen corresponding path program 1 times [2019-12-07 13:31:04,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:04,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541296106] [2019-12-07 13:31:04,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:04,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541296106] [2019-12-07 13:31:04,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:04,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:31:04,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753115411] [2019-12-07 13:31:04,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:31:04,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:31:04,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:31:04,750 INFO L87 Difference]: Start difference. First operand 5991 states and 8803 transitions. Second operand 5 states. [2019-12-07 13:31:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:05,251 INFO L93 Difference]: Finished difference Result 31245 states and 45936 transitions. [2019-12-07 13:31:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:31:05,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 13:31:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:05,284 INFO L225 Difference]: With dead ends: 31245 [2019-12-07 13:31:05,284 INFO L226 Difference]: Without dead ends: 25277 [2019-12-07 13:31:05,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:31:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25277 states. [2019-12-07 13:31:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25277 to 8339. [2019-12-07 13:31:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8339 states. [2019-12-07 13:31:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 12256 transitions. [2019-12-07 13:31:05,621 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 12256 transitions. Word has length 62 [2019-12-07 13:31:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:05,621 INFO L462 AbstractCegarLoop]: Abstraction has 8339 states and 12256 transitions. [2019-12-07 13:31:05,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:31:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 12256 transitions. [2019-12-07 13:31:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 13:31:05,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:05,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:05,623 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash 21161543, now seen corresponding path program 1 times [2019-12-07 13:31:05,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:05,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993781316] [2019-12-07 13:31:05,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:05,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993781316] [2019-12-07 13:31:05,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:05,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:31:05,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828658920] [2019-12-07 13:31:05,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:31:05,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:05,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:31:05,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:31:05,699 INFO L87 Difference]: Start difference. First operand 8339 states and 12256 transitions. Second operand 7 states. [2019-12-07 13:31:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:06,962 INFO L93 Difference]: Finished difference Result 41373 states and 60773 transitions. [2019-12-07 13:31:06,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 13:31:06,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-07 13:31:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:06,993 INFO L225 Difference]: With dead ends: 41373 [2019-12-07 13:31:06,993 INFO L226 Difference]: Without dead ends: 33057 [2019-12-07 13:31:07,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:31:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33057 states. [2019-12-07 13:31:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33057 to 5545. [2019-12-07 13:31:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5545 states. [2019-12-07 13:31:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 8041 transitions. [2019-12-07 13:31:07,358 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 8041 transitions. Word has length 63 [2019-12-07 13:31:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:07,358 INFO L462 AbstractCegarLoop]: Abstraction has 5545 states and 8041 transitions. [2019-12-07 13:31:07,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:31:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 8041 transitions. [2019-12-07 13:31:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 13:31:07,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:07,360 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:31:07,360 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:07,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash 633008800, now seen corresponding path program 1 times [2019-12-07 13:31:07,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:07,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652585610] [2019-12-07 13:31:07,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:07,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652585610] [2019-12-07 13:31:07,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:07,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:07,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218014234] [2019-12-07 13:31:07,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:07,386 INFO L87 Difference]: Start difference. First operand 5545 states and 8041 transitions. Second operand 3 states. [2019-12-07 13:31:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:07,647 INFO L93 Difference]: Finished difference Result 11690 states and 16907 transitions. [2019-12-07 13:31:07,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:07,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-12-07 13:31:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:07,653 INFO L225 Difference]: With dead ends: 11690 [2019-12-07 13:31:07,653 INFO L226 Difference]: Without dead ends: 6166 [2019-12-07 13:31:07,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2019-12-07 13:31:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 6074. [2019-12-07 13:31:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6074 states. [2019-12-07 13:31:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 8769 transitions. [2019-12-07 13:31:07,858 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 8769 transitions. Word has length 77 [2019-12-07 13:31:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:07,858 INFO L462 AbstractCegarLoop]: Abstraction has 6074 states and 8769 transitions. [2019-12-07 13:31:07,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 8769 transitions. [2019-12-07 13:31:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:31:07,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:07,860 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-12-07 13:31:07,860 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash -120422989, now seen corresponding path program 1 times [2019-12-07 13:31:07,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:07,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566343236] [2019-12-07 13:31:07,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:07,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566343236] [2019-12-07 13:31:07,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:07,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:07,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136456259] [2019-12-07 13:31:07,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:07,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:07,883 INFO L87 Difference]: Start difference. First operand 6074 states and 8769 transitions. Second operand 3 states. [2019-12-07 13:31:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:08,257 INFO L93 Difference]: Finished difference Result 15622 states and 22438 transitions. [2019-12-07 13:31:08,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:08,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-12-07 13:31:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:08,265 INFO L225 Difference]: With dead ends: 15622 [2019-12-07 13:31:08,265 INFO L226 Difference]: Without dead ends: 9437 [2019-12-07 13:31:08,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9437 states. [2019-12-07 13:31:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9437 to 9409. [2019-12-07 13:31:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2019-12-07 13:31:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 13387 transitions. [2019-12-07 13:31:08,592 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 13387 transitions. Word has length 88 [2019-12-07 13:31:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:08,593 INFO L462 AbstractCegarLoop]: Abstraction has 9409 states and 13387 transitions. [2019-12-07 13:31:08,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 13387 transitions. [2019-12-07 13:31:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 13:31:08,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:08,594 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:08,595 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1916611, now seen corresponding path program 1 times [2019-12-07 13:31:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:08,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700756376] [2019-12-07 13:31:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:31:08,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700756376] [2019-12-07 13:31:08,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:08,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:08,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953204924] [2019-12-07 13:31:08,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:08,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:08,618 INFO L87 Difference]: Start difference. First operand 9409 states and 13387 transitions. Second operand 3 states. [2019-12-07 13:31:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:08,951 INFO L93 Difference]: Finished difference Result 17294 states and 24524 transitions. [2019-12-07 13:31:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:08,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 13:31:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:08,956 INFO L225 Difference]: With dead ends: 17294 [2019-12-07 13:31:08,957 INFO L226 Difference]: Without dead ends: 6922 [2019-12-07 13:31:08,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6922 states. [2019-12-07 13:31:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6922 to 6509. [2019-12-07 13:31:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2019-12-07 13:31:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 8833 transitions. [2019-12-07 13:31:09,242 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 8833 transitions. Word has length 95 [2019-12-07 13:31:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:09,242 INFO L462 AbstractCegarLoop]: Abstraction has 6509 states and 8833 transitions. [2019-12-07 13:31:09,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 8833 transitions. [2019-12-07 13:31:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:31:09,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:09,244 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:31:09,244 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash -382912401, now seen corresponding path program 1 times [2019-12-07 13:31:09,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:09,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657992711] [2019-12-07 13:31:09,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:31:09,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657992711] [2019-12-07 13:31:09,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:09,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:09,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696326965] [2019-12-07 13:31:09,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:09,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:09,276 INFO L87 Difference]: Start difference. First operand 6509 states and 8833 transitions. Second operand 3 states. [2019-12-07 13:31:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:09,498 INFO L93 Difference]: Finished difference Result 10522 states and 14348 transitions. [2019-12-07 13:31:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:09,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 13:31:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:09,501 INFO L225 Difference]: With dead ends: 10522 [2019-12-07 13:31:09,501 INFO L226 Difference]: Without dead ends: 4127 [2019-12-07 13:31:09,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2019-12-07 13:31:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4109. [2019-12-07 13:31:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-12-07 13:31:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 5458 transitions. [2019-12-07 13:31:09,650 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 5458 transitions. Word has length 98 [2019-12-07 13:31:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:09,651 INFO L462 AbstractCegarLoop]: Abstraction has 4109 states and 5458 transitions. [2019-12-07 13:31:09,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 5458 transitions. [2019-12-07 13:31:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:31:09,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:09,652 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:31:09,652 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash -390807016, now seen corresponding path program 1 times [2019-12-07 13:31:09,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:09,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176171268] [2019-12-07 13:31:09,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:31:09,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176171268] [2019-12-07 13:31:09,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:09,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:09,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246303915] [2019-12-07 13:31:09,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:09,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:09,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:09,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:09,677 INFO L87 Difference]: Start difference. First operand 4109 states and 5458 transitions. Second operand 3 states. [2019-12-07 13:31:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:09,820 INFO L93 Difference]: Finished difference Result 7280 states and 9704 transitions. [2019-12-07 13:31:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:09,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 13:31:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:09,823 INFO L225 Difference]: With dead ends: 7280 [2019-12-07 13:31:09,823 INFO L226 Difference]: Without dead ends: 3246 [2019-12-07 13:31:09,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2019-12-07 13:31:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 2944. [2019-12-07 13:31:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-07 13:31:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3823 transitions. [2019-12-07 13:31:09,941 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3823 transitions. Word has length 98 [2019-12-07 13:31:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:09,941 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 3823 transitions. [2019-12-07 13:31:09,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3823 transitions. [2019-12-07 13:31:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 13:31:09,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:09,942 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:31:09,942 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash 771669376, now seen corresponding path program 1 times [2019-12-07 13:31:09,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:09,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921786734] [2019-12-07 13:31:09,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:31:09,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921786734] [2019-12-07 13:31:09,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:09,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:09,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146929759] [2019-12-07 13:31:09,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:09,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:09,973 INFO L87 Difference]: Start difference. First operand 2944 states and 3823 transitions. Second operand 3 states. [2019-12-07 13:31:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:10,111 INFO L93 Difference]: Finished difference Result 3266 states and 4207 transitions. [2019-12-07 13:31:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:10,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 13:31:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:10,114 INFO L225 Difference]: With dead ends: 3266 [2019-12-07 13:31:10,114 INFO L226 Difference]: Without dead ends: 3262 [2019-12-07 13:31:10,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-12-07 13:31:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3237. [2019-12-07 13:31:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3237 states. [2019-12-07 13:31:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 4160 transitions. [2019-12-07 13:31:10,247 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 4160 transitions. Word has length 99 [2019-12-07 13:31:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:10,247 INFO L462 AbstractCegarLoop]: Abstraction has 3237 states and 4160 transitions. [2019-12-07 13:31:10,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 4160 transitions. [2019-12-07 13:31:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 13:31:10,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:10,249 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:10,249 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:10,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1243765039, now seen corresponding path program 1 times [2019-12-07 13:31:10,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:10,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667433124] [2019-12-07 13:31:10,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 13:31:10,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667433124] [2019-12-07 13:31:10,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:10,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:31:10,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900656374] [2019-12-07 13:31:10,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:31:10,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:10,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:31:10,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:31:10,314 INFO L87 Difference]: Start difference. First operand 3237 states and 4160 transitions. Second operand 5 states. [2019-12-07 13:31:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:10,876 INFO L93 Difference]: Finished difference Result 12052 states and 15568 transitions. [2019-12-07 13:31:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:31:10,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-12-07 13:31:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:10,883 INFO L225 Difference]: With dead ends: 12052 [2019-12-07 13:31:10,883 INFO L226 Difference]: Without dead ends: 9007 [2019-12-07 13:31:10,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:31:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9007 states. [2019-12-07 13:31:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9007 to 3239. [2019-12-07 13:31:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3239 states. [2019-12-07 13:31:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 3239 states and 4154 transitions. [2019-12-07 13:31:11,048 INFO L78 Accepts]: Start accepts. Automaton has 3239 states and 4154 transitions. Word has length 157 [2019-12-07 13:31:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:11,048 INFO L462 AbstractCegarLoop]: Abstraction has 3239 states and 4154 transitions. [2019-12-07 13:31:11,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:31:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3239 states and 4154 transitions. [2019-12-07 13:31:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 13:31:11,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:11,050 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:31:11,050 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 114274644, now seen corresponding path program 1 times [2019-12-07 13:31:11,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:11,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151644583] [2019-12-07 13:31:11,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:31:11,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151644583] [2019-12-07 13:31:11,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037425706] [2019-12-07 13:31:11,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:11,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 13:31:11,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:31:11,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:31:11,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-12-07 13:31:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581265537] [2019-12-07 13:31:11,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:31:11,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:31:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:31:11,322 INFO L87 Difference]: Start difference. First operand 3239 states and 4154 transitions. Second operand 12 states. [2019-12-07 13:31:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:13,145 INFO L93 Difference]: Finished difference Result 17939 states and 23233 transitions. [2019-12-07 13:31:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 13:31:13,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-12-07 13:31:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:13,186 INFO L225 Difference]: With dead ends: 17939 [2019-12-07 13:31:13,186 INFO L226 Difference]: Without dead ends: 14914 [2019-12-07 13:31:13,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=511, Invalid=1841, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 13:31:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14914 states. [2019-12-07 13:31:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14914 to 4690. [2019-12-07 13:31:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4690 states. [2019-12-07 13:31:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 6093 transitions. [2019-12-07 13:31:13,529 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 6093 transitions. Word has length 159 [2019-12-07 13:31:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:13,530 INFO L462 AbstractCegarLoop]: Abstraction has 4690 states and 6093 transitions. [2019-12-07 13:31:13,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:31:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 6093 transitions. [2019-12-07 13:31:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-12-07 13:31:13,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:13,533 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 13:31:13,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:13,734 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1467549623, now seen corresponding path program 1 times [2019-12-07 13:31:13,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:13,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513949022] [2019-12-07 13:31:13,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 13:31:13,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513949022] [2019-12-07 13:31:13,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:13,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:13,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884960101] [2019-12-07 13:31:13,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:13,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:13,861 INFO L87 Difference]: Start difference. First operand 4690 states and 6093 transitions. Second operand 3 states. [2019-12-07 13:31:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:14,345 INFO L93 Difference]: Finished difference Result 10507 states and 13716 transitions. [2019-12-07 13:31:14,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:14,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-12-07 13:31:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:14,351 INFO L225 Difference]: With dead ends: 10507 [2019-12-07 13:31:14,351 INFO L226 Difference]: Without dead ends: 6031 [2019-12-07 13:31:14,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2019-12-07 13:31:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 5842. [2019-12-07 13:31:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5842 states. [2019-12-07 13:31:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 7418 transitions. [2019-12-07 13:31:14,724 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 7418 transitions. Word has length 257 [2019-12-07 13:31:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:14,725 INFO L462 AbstractCegarLoop]: Abstraction has 5842 states and 7418 transitions. [2019-12-07 13:31:14,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 7418 transitions. [2019-12-07 13:31:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-12-07 13:31:14,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:14,727 INFO L410 BasicCegarLoop]: trace histogram [5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 13:31:14,727 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash 35825393, now seen corresponding path program 1 times [2019-12-07 13:31:14,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:14,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449072674] [2019-12-07 13:31:14,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 13:31:14,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449072674] [2019-12-07 13:31:14,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:14,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:31:14,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420499925] [2019-12-07 13:31:14,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:31:14,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:14,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:31:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:14,790 INFO L87 Difference]: Start difference. First operand 5842 states and 7418 transitions. Second operand 3 states. [2019-12-07 13:31:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:14,948 INFO L93 Difference]: Finished difference Result 6759 states and 8453 transitions. [2019-12-07 13:31:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:31:14,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-12-07 13:31:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:14,951 INFO L225 Difference]: With dead ends: 6759 [2019-12-07 13:31:14,951 INFO L226 Difference]: Without dead ends: 1020 [2019-12-07 13:31:14,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:31:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-07 13:31:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 823. [2019-12-07 13:31:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 13:31:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 898 transitions. [2019-12-07 13:31:15,007 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 898 transitions. Word has length 258 [2019-12-07 13:31:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:15,008 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 898 transitions. [2019-12-07 13:31:15,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:31:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 898 transitions. [2019-12-07 13:31:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-12-07 13:31:15,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:15,009 INFO L410 BasicCegarLoop]: trace histogram [5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 13:31:15,009 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1838022629, now seen corresponding path program 1 times [2019-12-07 13:31:15,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:15,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078776403] [2019-12-07 13:31:15,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 13:31:15,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078776403] [2019-12-07 13:31:15,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:15,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:31:15,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370152738] [2019-12-07 13:31:15,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:31:15,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:31:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:31:15,092 INFO L87 Difference]: Start difference. First operand 823 states and 898 transitions. Second operand 7 states. [2019-12-07 13:31:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:15,329 INFO L93 Difference]: Finished difference Result 2081 states and 2293 transitions. [2019-12-07 13:31:15,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:31:15,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2019-12-07 13:31:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:15,331 INFO L225 Difference]: With dead ends: 2081 [2019-12-07 13:31:15,331 INFO L226 Difference]: Without dead ends: 1867 [2019-12-07 13:31:15,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:31:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2019-12-07 13:31:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 906. [2019-12-07 13:31:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-12-07 13:31:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 992 transitions. [2019-12-07 13:31:15,396 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 992 transitions. Word has length 259 [2019-12-07 13:31:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:15,397 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 992 transitions. [2019-12-07 13:31:15,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:31:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 992 transitions. [2019-12-07 13:31:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-12-07 13:31:15,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:15,398 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 13:31:15,398 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1163152431, now seen corresponding path program 1 times [2019-12-07 13:31:15,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:15,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762205794] [2019-12-07 13:31:15,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 13:31:15,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762205794] [2019-12-07 13:31:15,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:31:15,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:31:15,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015655168] [2019-12-07 13:31:15,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:31:15,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:31:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:31:15,473 INFO L87 Difference]: Start difference. First operand 906 states and 992 transitions. Second operand 5 states. [2019-12-07 13:31:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:15,585 INFO L93 Difference]: Finished difference Result 1320 states and 1453 transitions. [2019-12-07 13:31:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:31:15,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2019-12-07 13:31:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:15,587 INFO L225 Difference]: With dead ends: 1320 [2019-12-07 13:31:15,587 INFO L226 Difference]: Without dead ends: 1106 [2019-12-07 13:31:15,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:31:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-12-07 13:31:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 896. [2019-12-07 13:31:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-07 13:31:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 973 transitions. [2019-12-07 13:31:15,645 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 973 transitions. Word has length 260 [2019-12-07 13:31:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:15,645 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 973 transitions. [2019-12-07 13:31:15,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:31:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 973 transitions. [2019-12-07 13:31:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-12-07 13:31:15,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:15,647 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-12-07 13:31:15,647 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1173960251, now seen corresponding path program 1 times [2019-12-07 13:31:15,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:15,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448950958] [2019-12-07 13:31:15,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 15 proven. 160 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 13:31:16,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448950958] [2019-12-07 13:31:16,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183564602] [2019-12-07 13:31:16,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:16,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 13:31:16,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-12-07 13:31:16,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:31:16,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-12-07 13:31:16,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76996946] [2019-12-07 13:31:16,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 13:31:16,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 13:31:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:31:16,498 INFO L87 Difference]: Start difference. First operand 896 states and 973 transitions. Second operand 29 states. [2019-12-07 13:31:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:17,252 INFO L93 Difference]: Finished difference Result 1472 states and 1599 transitions. [2019-12-07 13:31:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 13:31:17,252 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 318 [2019-12-07 13:31:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:17,253 INFO L225 Difference]: With dead ends: 1472 [2019-12-07 13:31:17,253 INFO L226 Difference]: Without dead ends: 1470 [2019-12-07 13:31:17,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 315 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 13:31:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-12-07 13:31:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 994. [2019-12-07 13:31:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-12-07 13:31:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1075 transitions. [2019-12-07 13:31:17,329 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1075 transitions. Word has length 318 [2019-12-07 13:31:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:17,329 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1075 transitions. [2019-12-07 13:31:17,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 13:31:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1075 transitions. [2019-12-07 13:31:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-12-07 13:31:17,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:17,331 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 13:31:17,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:17,532 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1814260282, now seen corresponding path program 1 times [2019-12-07 13:31:17,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:17,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20488895] [2019-12-07 13:31:17,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 122 proven. 79 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 13:31:17,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20488895] [2019-12-07 13:31:17,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506224082] [2019-12-07 13:31:17,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:17,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 13:31:17,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 13:31:17,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:31:17,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 15 [2019-12-07 13:31:17,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945732149] [2019-12-07 13:31:17,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:31:17,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:17,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:31:17,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:31:17,991 INFO L87 Difference]: Start difference. First operand 994 states and 1075 transitions. Second operand 15 states. [2019-12-07 13:31:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:18,707 INFO L93 Difference]: Finished difference Result 1725 states and 1889 transitions. [2019-12-07 13:31:18,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 13:31:18,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 364 [2019-12-07 13:31:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:18,708 INFO L225 Difference]: With dead ends: 1725 [2019-12-07 13:31:18,708 INFO L226 Difference]: Without dead ends: 1521 [2019-12-07 13:31:18,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=434, Invalid=2116, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 13:31:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-12-07 13:31:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 992. [2019-12-07 13:31:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-12-07 13:31:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1070 transitions. [2019-12-07 13:31:18,789 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1070 transitions. Word has length 364 [2019-12-07 13:31:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:18,790 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1070 transitions. [2019-12-07 13:31:18,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:31:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1070 transitions. [2019-12-07 13:31:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-12-07 13:31:18,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:31:18,792 INFO L410 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 13:31:18,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:18,993 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:31:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:31:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash -73771068, now seen corresponding path program 1 times [2019-12-07 13:31:18,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:31:18,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768779736] [2019-12-07 13:31:18,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:31:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 26 proven. 395 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 13:31:19,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768779736] [2019-12-07 13:31:19,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225095187] [2019-12-07 13:31:19,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:31:19,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 13:31:19,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:31:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 13:31:20,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:31:20,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 40 [2019-12-07 13:31:20,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229544354] [2019-12-07 13:31:20,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 13:31:20,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:31:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 13:31:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 13:31:20,123 INFO L87 Difference]: Start difference. First operand 992 states and 1070 transitions. Second operand 40 states. [2019-12-07 13:31:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:31:22,975 INFO L93 Difference]: Finished difference Result 1689 states and 1833 transitions. [2019-12-07 13:31:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-07 13:31:22,975 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 424 [2019-12-07 13:31:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:31:22,976 INFO L225 Difference]: With dead ends: 1689 [2019-12-07 13:31:22,976 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:31:22,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 432 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1130, Invalid=7800, Unknown=0, NotChecked=0, Total=8930 [2019-12-07 13:31:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:31:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:31:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:31:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:31:22,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 424 [2019-12-07 13:31:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:31:22,980 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:31:22,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 13:31:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:31:22,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:31:23,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:31:23,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:31:23,572 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-12-07 13:31:23,817 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 298 [2019-12-07 13:31:24,249 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 289 [2019-12-07 13:31:24,374 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 163 [2019-12-07 13:31:24,828 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-12-07 13:31:25,097 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 206 [2019-12-07 13:31:25,228 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 222 [2019-12-07 13:31:26,203 WARN L192 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-12-07 13:31:27,224 WARN L192 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-12-07 13:31:27,498 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-12-07 13:31:27,673 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 225 [2019-12-07 13:31:27,884 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 276 [2019-12-07 13:31:28,149 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-12-07 13:31:28,346 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 229 [2019-12-07 13:31:29,279 WARN L192 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 497 DAG size of output: 414 [2019-12-07 13:31:29,402 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 204 [2019-12-07 13:31:29,584 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 204 [2019-12-07 13:31:30,717 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-12-07 13:31:31,811 WARN L192 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 737 DAG size of output: 481 [2019-12-07 13:31:31,926 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 147 [2019-12-07 13:31:32,254 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-12-07 13:31:32,522 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-12-07 13:31:32,894 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 206 [2019-12-07 13:31:32,996 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 191 [2019-12-07 13:31:35,990 WARN L192 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 1345 DAG size of output: 822 [2019-12-07 13:31:37,772 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 973 DAG size of output: 582 [2019-12-07 13:31:38,754 WARN L192 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 737 DAG size of output: 481 [2019-12-07 13:31:39,017 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 206 [2019-12-07 13:31:39,293 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 232 [2019-12-07 13:31:39,429 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 252 [2019-12-07 13:31:40,600 WARN L192 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 733 DAG size of output: 478 [2019-12-07 13:31:41,056 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 309 [2019-12-07 13:31:41,485 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-12-07 13:31:41,901 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-12-07 13:31:42,371 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 420 DAG size of output: 326 [2019-12-07 13:31:42,809 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 143 [2019-12-07 13:31:42,993 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 242 [2019-12-07 13:31:43,154 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 231 [2019-12-07 13:31:43,609 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-12-07 13:31:43,829 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 240 [2019-12-07 13:31:44,220 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 304 [2019-12-07 13:31:44,466 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 310 [2019-12-07 13:31:46,838 WARN L192 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 1216 DAG size of output: 731 [2019-12-07 13:31:47,132 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-12-07 13:31:48,574 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-12-07 13:31:49,861 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 281 DAG size of output: 81 [2019-12-07 13:31:50,998 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 277 DAG size of output: 99 [2019-12-07 13:31:51,442 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 96 [2019-12-07 13:31:52,574 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-12-07 13:31:52,997 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 91 [2019-12-07 13:31:53,552 WARN L192 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 100 [2019-12-07 13:31:54,493 WARN L192 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2019-12-07 13:31:59,945 WARN L192 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 465 DAG size of output: 157 [2019-12-07 13:32:00,491 WARN L192 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2019-12-07 13:32:03,445 WARN L192 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 465 DAG size of output: 157 [2019-12-07 13:32:03,722 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-12-07 13:32:06,184 WARN L192 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-12-07 13:32:06,638 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-12-07 13:32:07,974 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 204 DAG size of output: 82 [2019-12-07 13:32:09,258 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 265 DAG size of output: 82 [2019-12-07 13:32:09,556 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-12-07 13:32:10,923 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-12-07 13:32:11,427 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 99 [2019-12-07 13:32:11,578 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 59 [2019-12-07 13:32:15,405 WARN L192 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 396 DAG size of output: 120 [2019-12-07 13:32:15,661 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 13:32:16,929 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 202 DAG size of output: 94 [2019-12-07 13:32:17,888 WARN L192 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 84 [2019-12-07 13:32:18,139 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 13:32:19,181 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 202 DAG size of output: 94 [2019-12-07 13:32:19,412 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-12-07 13:32:20,126 WARN L192 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 81 [2019-12-07 13:32:23,793 WARN L192 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 465 DAG size of output: 157 [2019-12-07 13:32:24,308 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-12-07 13:32:25,659 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 173 DAG size of output: 95 [2019-12-07 13:32:30,841 WARN L192 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 468 DAG size of output: 157 [2019-12-07 13:32:31,231 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 82 [2019-12-07 13:32:31,654 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-12-07 13:32:32,462 WARN L192 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 87 [2019-12-07 13:32:34,900 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-12-07 13:32:35,179 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-12-07 13:32:37,155 WARN L192 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-12-07 13:32:37,441 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-12-07 13:32:38,039 WARN L192 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 95 [2019-12-07 13:32:38,220 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-12-07 13:32:38,571 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 25 [2019-12-07 13:32:38,684 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 13:32:39,833 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 204 DAG size of output: 94 [2019-12-07 13:32:40,811 WARN L192 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 92 [2019-12-07 13:32:46,379 WARN L192 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 794 DAG size of output: 157 [2019-12-07 13:32:46,493 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 13:32:46,870 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 69 [2019-12-07 13:32:50,871 WARN L192 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 563 DAG size of output: 160 [2019-12-07 13:32:56,293 WARN L192 SmtUtils]: Spent 5.42 s on a formula simplification. DAG size of input: 468 DAG size of output: 157 [2019-12-07 13:32:56,819 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-12-07 13:32:57,199 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2019-12-07 13:32:57,439 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-12-07 13:32:58,765 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 202 DAG size of output: 74 [2019-12-07 13:32:59,327 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 66 [2019-12-07 13:32:59,562 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-12-07 13:33:00,730 WARN L192 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 224 DAG size of output: 102 [2019-12-07 13:33:01,384 WARN L192 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 103 [2019-12-07 13:33:01,579 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-12-07 13:33:01,761 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 13:33:01,900 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 13:33:03,011 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 173 DAG size of output: 95 [2019-12-07 13:33:03,168 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2019-12-07 13:33:07,784 WARN L192 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 465 DAG size of output: 157 [2019-12-07 13:33:10,829 WARN L192 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 300 DAG size of output: 105 [2019-12-07 13:33:11,046 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-12-07 13:33:12,309 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-12-07 13:33:12,535 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-12-07 13:33:13,732 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-12-07 13:33:16,025 WARN L192 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 310 DAG size of output: 108 [2019-12-07 13:33:16,146 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-12-07 13:33:16,329 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-12-07 13:33:16,606 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-12-07 13:33:16,786 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 61 [2019-12-07 13:33:16,986 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-12-07 13:33:17,293 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2019-12-07 13:33:17,979 WARN L192 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 85 [2019-12-07 13:33:19,235 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 209 DAG size of output: 85 [2019-12-07 13:33:19,726 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 82 [2019-12-07 13:33:20,865 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-12-07 13:33:22,170 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 237 DAG size of output: 94 [2019-12-07 13:33:23,873 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 296 DAG size of output: 109 [2019-12-07 13:33:25,911 WARN L192 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 292 DAG size of output: 97 [2019-12-07 13:33:30,962 WARN L192 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 703 DAG size of output: 159 [2019-12-07 13:33:30,965 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,966 INFO L242 CegarLoopResult]: At program point L432(lines 425 451) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse4 (not .cse8) (<= 2 ~s_run_pc~0) .cse7 .cse9 .cse1) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,966 INFO L246 CegarLoopResult]: For program point L1291(lines 1291 1295) no Hoare annotation was computed. [2019-12-07 13:33:30,966 INFO L246 CegarLoopResult]: For program point L234(lines 234 238) no Hoare annotation was computed. [2019-12-07 13:33:30,966 INFO L246 CegarLoopResult]: For program point L961(lines 961 965) no Hoare annotation was computed. [2019-12-07 13:33:30,966 INFO L242 CegarLoopResult]: At program point L169(lines 139 170) the Hoare annotation is: (let ((.cse2 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (= ~a_t~0 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse15 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse8 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse6 (<= 2 ~s_run_pc~0)) (.cse9 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse13 (= 0 ~c_req_type~0)) (.cse14 (= 0 ~c_req_a~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse12 (<= ~m_run_pc~0 0)) (.cse23 (= 0 ~s_run_pc~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse0 (let ((.cse24 (<= 0 ~a_t~0)) (.cse25 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse26 (= ~s_memory0~0 50)) (.cse27 (= ~m_run_pc~0 3)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse31 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1))) (or (and .cse24 .cse25 .cse26 .cse27 .cse2 .cse7 .cse28 .cse29 .cse15 .cse16 .cse30 .cse4 .cse31 .cse17 .cse18 .cse19 .cse5 .cse8) (and .cse24 .cse25 .cse26 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse27 .cse7 .cse28 .cse29 .cse15 .cse16 .cse30 .cse4 .cse31 .cse17 .cse19 .cse5 .cse8)))) (.cse1 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (not .cse5) .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 .cse7 .cse14 .cse15 .cse16 .cse4 .cse17 .cse18 .cse19 .cse20 .cse8 .cse21 .cse22) (and .cse9 .cse11 .cse12 .cse13 .cse23 .cse7 .cse14 (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse8 .cse21) (and .cse10 .cse15 .cse11 .cse12 .cse4 .cse23 .cse19 .cse8 .cse7 .cse22 .cse21) (and .cse0 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse1 .cse3)))) [2019-12-07 13:33:30,966 INFO L246 CegarLoopResult]: For program point L103(lines 103 123) no Hoare annotation was computed. [2019-12-07 13:33:30,966 INFO L246 CegarLoopResult]: For program point L1028(lines 1028 1081) no Hoare annotation was computed. [2019-12-07 13:33:30,967 INFO L242 CegarLoopResult]: At program point L566(lines 559 612) the Hoare annotation is: (let ((.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= 0 ~c_req_type~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse17 (= ~a_t~0 0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (let ((.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= ~c_req_a~0 1)) (.cse23 (= ~m_run_pc~0 6)) (.cse24 (<= 1 ~c_req_a~0)) (.cse25 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse26 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse9 .cse18 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse3 .cse21 .cse22 .cse23 .cse24 (< 0 ULTIMATE.start_s_memory_read_~i) .cse25 .cse0 .cse15 .cse16 .cse4 .cse26) (and .cse9 .cse18 .cse19 .cse10 .cse11 .cse12 .cse20 .cse3 .cse21 .cse22 .cse23 .cse24 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse25 .cse0 .cse17 .cse15 .cse16 .cse4 .cse26)))) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (not .cse16)) (.cse2 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) (and .cse5 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse9 .cse10 .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse7 .cse13 .cse14 (= ~m_run_pc~0 3) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse16 .cse4) (and .cse5 .cse6 .cse7 .cse17 .cse8) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-12-07 13:33:30,967 INFO L246 CegarLoopResult]: For program point L434(lines 434 438) no Hoare annotation was computed. [2019-12-07 13:33:30,967 INFO L242 CegarLoopResult]: At program point L104(lines 96 838) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (not (= 2 ~s_run_pc~0)) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) [2019-12-07 13:33:30,967 INFO L246 CegarLoopResult]: For program point L1029(lines 1029 1033) no Hoare annotation was computed. [2019-12-07 13:33:30,967 INFO L242 CegarLoopResult]: At program point L633-2(lines 633 661) the Hoare annotation is: (let ((.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 0 ~a_t~0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse23 (<= 1 ~c_m_lock~0)) (.cse17 (= 2 ~s_run_pc~0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse18 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse21 (= ~m_run_pc~0 6))) (let ((.cse9 (= ~a_t~0 0)) (.cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~s_run_st~0)) (.cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse27 (= ~req_tt_a~0 1)) (.cse5 (<= ~c_req_a~0 1)) (.cse6 (<= 1 ~c_req_a~0)) (.cse7 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse10 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse11 (or (and .cse22 .cse14 .cse15 .cse23 .cse17 .cse19 .cse18) (and .cse14 .cse15 .cse23 .cse17 .cse19 .cse18 .cse20 .cse21))) (.cse12 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse0 (= ULTIMATE.start_m_run_~a~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse16 (not .cse17) (<= 2 ~s_run_pc~0) .cse18 .cse19) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse8 .cse13 .cse16 (= 50 ~c_rsp_d~0) .cse23 .cse17 .cse20 .cse12 .cse14 .cse1 .cse3 .cse4 .cse24 .cse21 .cse7 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse15 (= ~req_tt_a~0 0) .cse9 .cse10 .cse18) (and .cse14 .cse15 .cse16 .cse23 .cse17 .cse19 .cse18 .cse20) (and (= 0 ~c_req_a~0) .cse22 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse4 .cse25 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse11 .cse26 .cse24) (and .cse2 .cse27 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse13 (< 0 ULTIMATE.start_s_memory_read_~i) .cse16 (= 51 ~c_rsp_d~0) .cse23 .cse17 .cse20 .cse12 .cse0 .cse14 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse25 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse26 .cse5 .cse21 .cse6 .cse15 .cse10 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2019-12-07 13:33:30,967 INFO L242 CegarLoopResult]: At program point L766(lines 759 803) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,967 INFO L242 CegarLoopResult]: At program point L700(lines 693 719) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,967 INFO L246 CegarLoopResult]: For program point L634(lines 633 661) no Hoare annotation was computed. [2019-12-07 13:33:30,968 INFO L246 CegarLoopResult]: For program point L568(lines 568 572) no Hoare annotation was computed. [2019-12-07 13:33:30,968 INFO L246 CegarLoopResult]: For program point L106(lines 106 122) no Hoare annotation was computed. [2019-12-07 13:33:30,968 INFO L242 CegarLoopResult]: At program point L899(lines 873 900) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 1 ~c_req_type~0)) (.cse17 (= ~m_run_pc~0 3)) (.cse16 (<= ~c_req_type~0 1)) (.cse10 (= ~a_t~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse18 (<= ~c_req_a~0 1)) (.cse5 (= ~m_run_pc~0 6)) (.cse19 (<= 1 ~c_req_a~0)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse11 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse6 .cse7 .cse8 (= ~req_tt_a~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse16 .cse2 (<= 51 ~c_req_d~0) .cse17 .cse4 .cse18 .cse19 .cse8 (<= ~c_req_d~0 51) .cse9 .cse12 .cse13 .cse14) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse6 .cse8 (let ((.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse15 (= 0 ~s_run_pc~0) .cse17 .cse13 .cse4) (and .cse20 .cse21 .cse15 (<= 2 ~s_run_pc~0) .cse17 .cse13 .cse4))) .cse16 .cse9 .cse10) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse2 .cse3 (= ~req_tt_a~0 1) .cse4 .cse18 .cse5 .cse19 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 13:33:30,968 INFO L246 CegarLoopResult]: For program point L635(lines 635 639) no Hoare annotation was computed. [2019-12-07 13:33:30,968 INFO L242 CegarLoopResult]: At program point L107(lines 96 838) the Hoare annotation is: (let ((.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 1 ~c_req_type~0)) (.cse20 (<= ~c_req_type~0 1)) (.cse26 (= ~s_memory0~0 50)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse14 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse18 (let ((.cse31 (<= ~c_req_a~0 1)) (.cse30 (<= 1 ~c_req_a~0))) (or (and .cse30 .cse19 .cse8 .cse20 .cse26 .cse11 .cse2 .cse14 .cse5 .cse4 .cse31 .cse3) (and .cse19 .cse20 .cse26 .cse27 .cse28 .cse2 .cse4 .cse31 .cse30 .cse8 .cse11 .cse14 .cse3)))) (.cse23 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (<= 0 ~a_t~0)) (.cse24 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse25 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse17 (<= 51 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse10 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= ~c_req_d~0 51)) (.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 2 ~s_run_st~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse29 (= 0 ~s_run_pc~0)) (.cse6 (<= ~c_req_d~0 50)) (.cse21 (<= ~c_req_a~0 0)) (.cse7 (<= 50 ~c_req_d~0)) (.cse22 (<= 0 ~c_req_a~0)) (.cse12 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse8 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse15 .cse10 .cse16 .cse17 .cse5 .cse18) (and .cse19 .cse20 .cse2 .cse4 .cse6 .cse21 .cse7 .cse22 .cse8 .cse11 .cse12 .cse14 .cse3) (and .cse23 .cse15 .cse10 .cse16 .cse24 .cse25 .cse13 .cse17 .cse18) (and .cse23 .cse15 .cse26 .cse24 .cse25 .cse27 .cse28 .cse17 .cse2 .cse0 .cse8 .cse9 .cse10 .cse16 .cse11 .cse13 .cse14 .cse3) (and .cse21 .cse22 .cse19 .cse9 .cse29 .cse2 .cse3 .cse4) (and .cse9 (not .cse14) .cse1 .cse2 .cse3 .cse4) (and .cse19 .cse20 .cse29 .cse2 .cse4 .cse6 .cse21 .cse7 .cse22 .cse8 .cse11 .cse12 .cse3)))) [2019-12-07 13:33:30,968 INFO L242 CegarLoopResult]: At program point L173-2(lines 173 201) the Hoare annotation is: (let ((.cse23 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= ~a_t~0 0)) (.cse5 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse6 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse4 (= 0 ~s_run_pc~0)) (.cse9 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ~m_run_pc~0 0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse10 (= 0 ~c_req_type~0)) (.cse19 (<= 2 ~s_run_pc~0)) (.cse11 (= 0 ~c_req_a~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse20 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse21 (let ((.cse24 (<= 0 ~a_t~0)) (.cse25 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse26 (= ~s_memory0~0 50)) (.cse27 (= ~m_run_pc~0 3)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse31 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1))) (or (and .cse24 .cse25 .cse26 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse27 .cse7 .cse28 .cse29 .cse0 .cse13 .cse3 .cse30 .cse31 .cse14 .cse15 .cse5 .cse18 .cse6) (and .cse24 .cse25 .cse26 .cse27 .cse23 .cse7 .cse28 .cse29 .cse0 .cse13 .cse3 .cse30 .cse31 .cse14 .cse15 .cse16 .cse5 .cse18 .cse6)))) (.cse22 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ULTIMATE.start_m_run_~a~0) .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse7 .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse8) (and .cse3 (not .cse18) .cse19 .cse7 .cse6) (and (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse20 .cse21 .cse22) (and .cse9 .cse1 .cse2 .cse10 .cse19 .cse7 .cse11 .cse12 .cse0 .cse13 .cse3 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse8) (and .cse20 .cse23 .cse21 .cse22)))) [2019-12-07 13:33:30,968 INFO L246 CegarLoopResult]: For program point L768(lines 768 772) no Hoare annotation was computed. [2019-12-07 13:33:30,968 INFO L246 CegarLoopResult]: For program point L702(lines 702 706) no Hoare annotation was computed. [2019-12-07 13:33:30,969 INFO L242 CegarLoopResult]: At program point L1297(lines 1290 1307) the Hoare annotation is: (let ((.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse34 (= ~c_empty_rsp~0 1)) (.cse42 (<= ~c_req_a~0 1)) (.cse43 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (= ~req_tt_a~0 0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse31 (= 0 ~c_req_a~0)) (.cse27 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse32 (<= ~m_run_pc~0 0)) (.cse33 (<= ~c_m_lock~0 0)) (.cse37 (<= ~c_req_d~0 50)) (.cse38 (<= 50 ~c_req_d~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse29 (= ~a_t~0 0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse39 (= 0 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_type~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse40 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (= ~s_memory1~0 51)) (.cse30 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse36 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse0 .cse23 .cse2 .cse24 .cse25 .cse26 .cse27 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse28 .cse29 .cse30 .cse17) (and .cse31 .cse9 .cse32 .cse10 .cse11 .cse19 .cse29 .cse16 .cse33 .cse34 .cse17) (and .cse0 .cse19 .cse2 .cse3 .cse24 .cse5 .cse6 .cse34 .cse26 .cse25 .cse31 .cse20 .cse10 .cse28 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse35 .cse8 .cse17 .cse34) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse37 .cse38 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse35 .cse17 .cse34) (and .cse31 .cse9 .cse32 .cse10 .cse19 .cse39 .cse29 .cse33 .cse34 .cse17) (and .cse40 .cse0 .cse23 .cse19 .cse2 .cse24 .cse41 .cse34 .cse42 .cse26 .cse43 .cse27 .cse21 .cse10 .cse14 .cse30 .cse16 .cse17 .cse18 .cse22) (and .cse44 .cse45 .cse9 .cse32 .cse11 .cse39 .cse33 .cse17 .cse34) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse34) (and .cse46 .cse47 .cse39 .cse8 .cse34 .cse37 .cse44 .cse45 .cse38 .cse20 .cse10 .cse29 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse34 .cse37 .cse44 .cse38 .cse45 .cse20 .cse10 .cse29 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse39 .cse8 .cse17 .cse34) (and .cse19 .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse21 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse40 .cse0 .cse23 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse24 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse26 .cse43 .cse10 .cse30 .cse17) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse36 .cse48)))) [2019-12-07 13:33:30,969 INFO L242 CegarLoopResult]: At program point L240(lines 233 259) the Hoare annotation is: (let ((.cse29 (= 2 ~s_run_pc~0)) (.cse39 (<= ~m_run_pc~0 0)) (.cse40 (= ~m_run_pc~0 3)) (.cse26 (= ~c_empty_rsp~0 1)) (.cse27 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse30 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (= ~a_t~0 0)) (.cse3 (<= 1 ~c_req_type~0)) (.cse18 (<= ~c_req_type~0 1)) (.cse28 (or (and .cse39 .cse27 .cse26) (and .cse40 .cse26 .cse27))) (.cse6 (<= 2 ~s_run_st~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse22 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse25 (not .cse29))) (let ((.cse5 (or (and .cse39 .cse25 .cse27 .cse26) (and .cse25 .cse40 .cse26 .cse27))) (.cse7 (= 0 ~s_run_pc~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse19 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse20 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse24 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_d~0 51)) (.cse13 (<= 51 ~c_req_d~0)) (.cse14 (let ((.cse31 (<= 0 ~a_t~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse33 (= ~s_memory0~0 50)) (.cse34 (<= ~c_req_a~0 1)) (.cse35 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse36 (<= 1 ~c_req_a~0)) (.cse37 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse3 .cse31 .cse32 .cse18 .cse28 .cse33 .cse30 .cse34 .cse35 .cse36 .cse37 .cse6 .cse38 .cse21 .cse22 .cse23 .cse8 .cse29) (and .cse3 .cse31 .cse32 .cse18 .cse28 .cse33 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse34 .cse35 .cse36 .cse37 .cse6 .cse38 .cse21 .cse22 .cse8 .cse29)))) (.cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse1 .cse3 .cse4 .cse5 .cse18 .cse7 .cse19 .cse0 .cse20 .cse2 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse10) (and .cse6 .cse25 (<= 2 ~s_run_pc~0) .cse26 .cse27) (and .cse17 .cse1 .cse3 .cse4 .cse18 .cse28 .cse19 .cse0 .cse20 .cse2 .cse6 .cse21 .cse22 .cse23 .cse8 .cse24 .cse29 .cse10 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16))))) [2019-12-07 13:33:30,969 INFO L246 CegarLoopResult]: For program point L174(lines 173 201) no Hoare annotation was computed. [2019-12-07 13:33:30,969 INFO L242 CegarLoopResult]: At program point L967(lines 960 977) the Hoare annotation is: (let ((.cse5 (<= ~c_req_a~0 1)) (.cse8 (<= 1 ~c_req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse4 (= ~m_run_pc~0 3)) (.cse2 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 0 ~a_t~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse18 (= ~s_memory1~0 51)) (.cse25 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~a_t~0 0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= 2 ~s_run_pc~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse16 .cse17 .cse3 .cse18 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse6 .cse5 .cse19 .cse8 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse20 .cse9 .cse10 .cse12 .cse21 .cse13 .cse14 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse22 .cse10 (let ((.cse23 (<= ~c_req_a~0 0)) (.cse24 (<= 0 ~c_req_a~0))) (or (and .cse23 .cse24 .cse9 .cse0 .cse11 (= 0 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6) (and .cse23 .cse24 .cse9 .cse0 .cse11 (<= 2 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6))) .cse2 .cse26 .cse12 .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse16 .cse17 .cse3 .cse18 .cse25 .cse6 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse22 .cse20 .cse9 .cse10 (= ~req_tt_a~0 0) .cse26 .cse12 .cse21 .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,969 INFO L246 CegarLoopResult]: For program point L1298(lines 1250 1339) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L1232(lines 1232 1236) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L175(lines 175 179) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L109(lines 109 121) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L968(lines 960 977) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L242 CegarLoopResult]: At program point L440(lines 433 450) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse4 (not .cse8) (<= 2 ~s_run_pc~0) .cse7 .cse9 .cse1) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L374(lines 374 378) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L1299(lines 1299 1303) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L1167(lines 1167 1171) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L242 CegarLoopResult]: At program point L110(lines 96 838) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (not (= 2 ~s_run_pc~0)) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L1167-2(lines 1165 1344) no Hoare annotation was computed. [2019-12-07 13:33:30,970 INFO L242 CegarLoopResult]: At program point L1035(lines 1028 1081) the Hoare annotation is: (let ((.cse16 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse23 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse25 (= ~a_t~0 0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (= ~s_memory0~0 50)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 .cse2 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15) (and (<= 1 ~c_req_type~0) (<= ~c_req_type~0 1) .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse18 .cse19 .cse20 (let ((.cse21 (not .cse4))) (or (and .cse1 .cse21 (<= 2 ~s_run_pc~0) .cse22) (and .cse1 .cse21 (= 0 ~s_run_pc~0) .cse22))) .cse23 .cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse24 .cse3 .cse25 .cse26 .cse27) (and .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse1 .cse23 .cse14 .cse24 .cse3 .cse25 .cse26 .cse4 .cse27) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse0 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse2 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse25 .cse3 .cse15 .cse4 .cse5 .cse6) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse11 .cse12 (<= 51 ~c_req_d~0) .cse22 .cse1 .cse14 .cse24 (<= ~c_req_d~0 51) .cse3 .cse26 .cse4 .cse5))) [2019-12-07 13:33:30,970 INFO L246 CegarLoopResult]: For program point L969(lines 969 973) no Hoare annotation was computed. [2019-12-07 13:33:30,971 INFO L246 CegarLoopResult]: For program point L441(lines 129 475) no Hoare annotation was computed. [2019-12-07 13:33:30,971 INFO L242 CegarLoopResult]: At program point L574(lines 567 611) the Hoare annotation is: (let ((.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse0 (<= 0 ~a_t~0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (<= 2 ~s_run_st~0)) (.cse15 (= ~a_t~0 0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse12 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse13 (let ((.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse19 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ~c_req_a~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (<= 1 ~c_req_a~0)) (.cse23 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse0 .cse16 .cse17 .cse1 .cse2 .cse3 .cse5 .cse18 .cse6 .cse7 .cse19 .cse20 .cse21 .cse22 (< 0 ULTIMATE.start_s_memory_read_~i) .cse23 .cse8 .cse9 .cse10 .cse11 .cse24) (and .cse0 .cse16 .cse17 .cse1 .cse2 .cse3 .cse18 .cse7 .cse19 .cse20 .cse21 .cse22 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse8 .cse15 .cse9 .cse10 .cse11 .cse24)))) (.cse4 (= ~s_memory1~0 51)) (.cse14 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse3 .cse4 .cse5 .cse6 (= ~m_run_pc~0 3) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse9 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse10 .cse11) (and .cse12 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse13 (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse4 .cse14 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 (not .cse10) (<= 2 ~s_run_pc~0) .cse7 .cse11) (and .cse12 .cse13 .cse4 .cse15 .cse14)))) [2019-12-07 13:33:30,971 INFO L246 CegarLoopResult]: For program point L442(lines 442 446) no Hoare annotation was computed. [2019-12-07 13:33:30,971 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,971 INFO L246 CegarLoopResult]: For program point L112(lines 112 120) no Hoare annotation was computed. [2019-12-07 13:33:30,971 INFO L246 CegarLoopResult]: For program point L1037(lines 1037 1041) no Hoare annotation was computed. [2019-12-07 13:33:30,971 INFO L242 CegarLoopResult]: At program point L113(lines 96 838) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (not (= 2 ~s_run_pc~0)) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2019-12-07 13:33:30,971 INFO L246 CegarLoopResult]: For program point L906(lines 906 959) no Hoare annotation was computed. [2019-12-07 13:33:30,971 INFO L242 CegarLoopResult]: At program point L774(lines 767 802) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,971 INFO L242 CegarLoopResult]: At program point L708(lines 701 718) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,972 INFO L246 CegarLoopResult]: For program point L576(lines 576 580) no Hoare annotation was computed. [2019-12-07 13:33:30,972 INFO L249 CegarLoopResult]: At program point L1369(lines 1346 1371) the Hoare annotation is: true [2019-12-07 13:33:30,972 INFO L242 CegarLoopResult]: At program point L312(lines 282 313) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~c_req_d~0 51) .cse5 .cse6 .cse7 .cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,972 INFO L246 CegarLoopResult]: For program point L907(lines 907 911) no Hoare annotation was computed. [2019-12-07 13:33:30,972 INFO L246 CegarLoopResult]: For program point L709(lines 480 832) no Hoare annotation was computed. [2019-12-07 13:33:30,972 INFO L242 CegarLoopResult]: At program point L1238(lines 1231 1248) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 13:33:30,972 INFO L246 CegarLoopResult]: For program point L1172-1(lines 1165 1344) no Hoare annotation was computed. [2019-12-07 13:33:30,972 INFO L246 CegarLoopResult]: For program point L115(lines 115 119) no Hoare annotation was computed. [2019-12-07 13:33:30,972 INFO L246 CegarLoopResult]: For program point L776(lines 776 780) no Hoare annotation was computed. [2019-12-07 13:33:30,972 INFO L246 CegarLoopResult]: For program point L710(lines 710 714) no Hoare annotation was computed. [2019-12-07 13:33:30,972 INFO L242 CegarLoopResult]: At program point L380(lines 373 390) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,973 INFO L242 CegarLoopResult]: At program point L248(lines 241 258) the Hoare annotation is: (let ((.cse29 (= 2 ~s_run_pc~0)) (.cse39 (<= ~m_run_pc~0 0)) (.cse40 (= ~m_run_pc~0 3)) (.cse26 (= ~c_empty_rsp~0 1)) (.cse27 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse30 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (= ~a_t~0 0)) (.cse3 (<= 1 ~c_req_type~0)) (.cse18 (<= ~c_req_type~0 1)) (.cse28 (or (and .cse39 .cse27 .cse26) (and .cse40 .cse26 .cse27))) (.cse6 (<= 2 ~s_run_st~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse22 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse25 (not .cse29))) (let ((.cse5 (or (and .cse39 .cse25 .cse27 .cse26) (and .cse25 .cse40 .cse26 .cse27))) (.cse7 (= 0 ~s_run_pc~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse19 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse20 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse24 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_d~0 51)) (.cse13 (<= 51 ~c_req_d~0)) (.cse14 (let ((.cse31 (<= 0 ~a_t~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse33 (= ~s_memory0~0 50)) (.cse34 (<= ~c_req_a~0 1)) (.cse35 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse36 (<= 1 ~c_req_a~0)) (.cse37 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse3 .cse31 .cse32 .cse18 .cse28 .cse33 .cse30 .cse34 .cse35 .cse36 .cse37 .cse6 .cse38 .cse21 .cse22 .cse23 .cse8 .cse29) (and .cse3 .cse31 .cse32 .cse18 .cse28 .cse33 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse34 .cse35 .cse36 .cse37 .cse6 .cse38 .cse21 .cse22 .cse8 .cse29)))) (.cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse1 .cse3 .cse4 .cse5 .cse18 .cse7 .cse19 .cse0 .cse20 .cse2 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse10) (and .cse6 .cse25 (<= 2 ~s_run_pc~0) .cse26 .cse27) (and .cse17 .cse1 .cse3 .cse4 .cse18 .cse28 .cse19 .cse0 .cse20 .cse2 .cse6 .cse21 .cse22 .cse23 .cse8 .cse24 .cse29 .cse10 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16))))) [2019-12-07 13:33:30,973 INFO L242 CegarLoopResult]: At program point L116(lines 96 838) the Hoare annotation is: (let ((.cse13 (= ~req_tt_a~0 1)) (.cse14 (<= ~c_req_a~0 1)) (.cse15 (<= 1 ~c_req_a~0)) (.cse20 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (= 0 ~c_req_type~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse7 (= ~m_run_pc~0 6)) (.cse16 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse0 (= ~c_empty_req~0 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse22 (= ~req_tt_a~0 0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse23 (= ~a_t~0 0)) (.cse18 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse19 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse17 .cse2 .cse8 .cse18 .cse4 .cse5 .cse19) (and .cse10 .cse13 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse17 .cse3 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse8 .cse4 .cse19 .cse1 .cse9 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse20 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse21 .cse14 .cse7 .cse15 .cse2 .cse18 .cse5) (and .cse1 .cse10 .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse20 .cse21 .cse6 .cse7 (= 0 ~c_req_a~0) .cse2 .cse22 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse8 .cse23 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse4 .cse5) (and .cse1 .cse9 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse11 .cse12 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse7 .cse16 .cse0 .cse17 .cse2 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse22 (= 50 ~c_rsp_d~0) .cse8 .cse23 .cse18 .cse4 .cse5 .cse19) (and .cse3 (not .cse4) (<= 2 ~s_run_pc~0) .cse5 (<= 3 ~m_run_pc~0) .cse6))) [2019-12-07 13:33:30,973 INFO L246 CegarLoopResult]: For program point L381(lines 373 390) no Hoare annotation was computed. [2019-12-07 13:33:30,973 INFO L246 CegarLoopResult]: For program point L249(lines 129 475) no Hoare annotation was computed. [2019-12-07 13:33:30,973 INFO L246 CegarLoopResult]: For program point L1240(lines 1240 1244) no Hoare annotation was computed. [2019-12-07 13:33:30,973 INFO L246 CegarLoopResult]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-12-07 13:33:30,973 INFO L246 CegarLoopResult]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-12-07 13:33:30,973 INFO L242 CegarLoopResult]: At program point L1043(lines 1036 1080) the Hoare annotation is: (let ((.cse16 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse23 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse25 (= ~a_t~0 0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (= ~s_memory0~0 50)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 .cse2 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15) (and (<= 1 ~c_req_type~0) (<= ~c_req_type~0 1) .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse18 .cse19 .cse20 (let ((.cse21 (not .cse4))) (or (and .cse1 .cse21 (<= 2 ~s_run_pc~0) .cse22) (and .cse1 .cse21 (= 0 ~s_run_pc~0) .cse22))) .cse23 .cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse24 .cse3 .cse25 .cse26 .cse27) (and .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse1 .cse23 .cse14 .cse24 .cse3 .cse25 .cse26 .cse4 .cse27) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse0 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse2 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse25 .cse3 .cse15 .cse4 .cse5 .cse6) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse11 .cse12 (<= 51 ~c_req_d~0) .cse22 .cse1 .cse14 .cse24 (<= ~c_req_d~0 51) .cse3 .cse26 .cse4 .cse5))) [2019-12-07 13:33:30,974 INFO L242 CegarLoopResult]: At program point L582(lines 575 610) the Hoare annotation is: (let ((.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= 0 ~c_req_type~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse8 (= ~a_t~0 0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (let ((.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse19 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ~c_req_a~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (<= 1 ~c_req_a~0)) (.cse23 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse6 .cse19 .cse20 .cse21 .cse22 (< 0 ULTIMATE.start_s_memory_read_~i) .cse23 .cse4 .cse15 .cse5 .cse7 .cse24) (and .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse18 .cse6 .cse19 .cse20 .cse21 .cse22 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse4 .cse8 .cse15 .cse5 .cse7 .cse24)))) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ~s_memory1~0 51))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse2 .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse4 (not .cse5) (<= 2 ~s_run_pc~0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3) (and .cse9 .cse10 (or (and (<= ~m_run_pc~0 0) .cse7 .cse6) (and (= ~m_run_pc~0 3) .cse6 .cse7)) .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse2 .cse13 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse4 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5)))) [2019-12-07 13:33:30,974 INFO L246 CegarLoopResult]: For program point L1045(lines 1045 1049) no Hoare annotation was computed. [2019-12-07 13:33:30,974 INFO L242 CegarLoopResult]: At program point L913(lines 906 959) the Hoare annotation is: (let ((.cse5 (<= ~c_req_a~0 1)) (.cse8 (<= 1 ~c_req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse4 (= ~m_run_pc~0 3)) (.cse2 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 0 ~a_t~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse18 (= ~s_memory1~0 51)) (.cse25 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~a_t~0 0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= 2 ~s_run_pc~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse16 .cse17 .cse3 .cse18 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse6 .cse5 .cse19 .cse8 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse20 .cse9 .cse10 .cse12 .cse21 .cse13 .cse14 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse22 .cse10 (let ((.cse23 (<= ~c_req_a~0 0)) (.cse24 (<= 0 ~c_req_a~0))) (or (and .cse23 .cse24 .cse9 .cse0 .cse11 (= 0 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6) (and .cse23 .cse24 .cse9 .cse0 .cse11 (<= 2 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6))) .cse2 .cse26 .cse12 .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse16 .cse17 .cse3 .cse18 .cse25 .cse6 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse22 .cse20 .cse9 .cse10 (= ~req_tt_a~0 0) .cse26 .cse12 .cse21 .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,974 INFO L246 CegarLoopResult]: For program point L319(lines 319 372) no Hoare annotation was computed. [2019-12-07 13:33:30,974 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1182) no Hoare annotation was computed. [2019-12-07 13:33:30,974 INFO L246 CegarLoopResult]: For program point L980(lines 980 994) no Hoare annotation was computed. [2019-12-07 13:33:30,974 INFO L242 CegarLoopResult]: At program point L782(lines 775 801) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,974 INFO L246 CegarLoopResult]: For program point L584(lines 584 588) no Hoare annotation was computed. [2019-12-07 13:33:30,974 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-12-07 13:33:30,974 INFO L246 CegarLoopResult]: For program point L915(lines 915 919) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L242 CegarLoopResult]: At program point L519(lines 489 520) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= 0 ~a_t~0)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse16 (= ~c_empty_req~0 1)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse10 (= ~a_t~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (= 2 ~s_run_pc~0))) (let ((.cse1 (not .cse18)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse5 (let ((.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (= 0 ~c_req_type~0)) (.cse22 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse23 (= ~m_run_pc~0 6)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse11 .cse19 .cse20 .cse21 .cse12 .cse13 .cse14 .cse22 .cse15 .cse3 (<= ~c_req_a~0 1) .cse23 (<= 1 ~c_req_a~0) .cse16 .cse17 .cse0 (< 0 ULTIMATE.start_s_memory_read_~i) .cse18 .cse4 .cse24) (and .cse11 .cse19 .cse20 .cse21 .cse12 .cse13 .cse22 .cse3 .cse23 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse16 .cse17 .cse0 .cse10 .cse18 .cse4 .cse24)))) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ~s_memory1~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) (and .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse8 .cse9 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (and .cse11 .cse12 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse8 .cse14 .cse15 (<= 51 ~c_req_d~0) (= ~m_run_pc~0 3) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse18 .cse4)))) [2019-12-07 13:33:30,975 INFO L246 CegarLoopResult]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L246 CegarLoopResult]: For program point L784(lines 784 788) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1317) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L246 CegarLoopResult]: For program point L1115(lines 1114 1155) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L246 CegarLoopResult]: For program point L59(lines 59 62) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L246 CegarLoopResult]: For program point L456(lines 456 460) no Hoare annotation was computed. [2019-12-07 13:33:30,975 INFO L242 CegarLoopResult]: At program point L126(lines 96 838) the Hoare annotation is: (let ((.cse9 (= 0 ~s_run_pc~0)) (.cse4 (= 0 ~c_req_a~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~m_run_pc~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse8 (= 0 ~c_req_type~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse10 (= ~a_t~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse3 .cse2) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse5 .cse6 .cse0 .cse9 .cse11 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse0 .cse8 .cse1 .cse10 .cse11 .cse3 .cse2))) [2019-12-07 13:33:30,975 INFO L242 CegarLoopResult]: At program point L1051(lines 1044 1079) the Hoare annotation is: (let ((.cse16 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse23 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse25 (= ~a_t~0 0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (= ~s_memory0~0 50)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 .cse2 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15) (and (<= 1 ~c_req_type~0) (<= ~c_req_type~0 1) .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse18 .cse19 .cse20 (let ((.cse21 (not .cse4))) (or (and .cse1 .cse21 (<= 2 ~s_run_pc~0) .cse22) (and .cse1 .cse21 (= 0 ~s_run_pc~0) .cse22))) .cse23 .cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse24 .cse3 .cse25 .cse26 .cse27) (and .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse1 .cse23 .cse14 .cse24 .cse3 .cse25 .cse26 .cse4 .cse27) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse0 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse2 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse25 .cse3 .cse15 .cse4 .cse5 .cse6) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse11 .cse12 (<= 51 ~c_req_d~0) .cse22 .cse1 .cse14 .cse24 (<= ~c_req_d~0 51) .cse3 .cse26 .cse4 .cse5))) [2019-12-07 13:33:30,976 INFO L242 CegarLoopResult]: At program point L523-2(lines 523 551) the Hoare annotation is: (let ((.cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse14 (= ~c_empty_req~0 1)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse18 (= ~a_t~0 0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (= 2 ~s_run_pc~0))) (let ((.cse1 (not .cse17)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (let ((.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (= 0 ~c_req_type~0)) (.cse22 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse23 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse24 (= ~m_run_pc~0 6)) (.cse25 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse26 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse22 .cse13 .cse3 .cse23 (<= ~c_req_a~0 1) .cse24 (<= 1 ~c_req_a~0) .cse14 .cse15 (< 0 ULTIMATE.start_s_memory_read_~i) .cse25 .cse0 .cse16 .cse17 .cse4 .cse26) (and .cse9 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse3 .cse23 .cse24 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 .cse15 .cse25 .cse0 .cse18 .cse16 .cse17 .cse4 .cse26)))) (.cse7 (= ~s_memory1~0 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) (and .cse5 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse7 .cse8 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse9 .cse10 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse11 .cse7 .cse12 .cse13 (<= 51 ~c_req_d~0) (= ~m_run_pc~0 3) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse14 .cse15 .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) .cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse17 .cse4) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse5 .cse6 .cse7 .cse18 .cse8)))) [2019-12-07 13:33:30,976 INFO L242 CegarLoopResult]: At program point L1184(lines 1177 1230) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 13:33:30,976 INFO L246 CegarLoopResult]: For program point L986(lines 986 993) no Hoare annotation was computed. [2019-12-07 13:33:30,976 INFO L242 CegarLoopResult]: At program point L590(lines 583 609) the Hoare annotation is: (let ((.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= 0 ~c_req_type~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse8 (= ~a_t~0 0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse1 (let ((.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse19 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ~c_req_a~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (<= 1 ~c_req_a~0)) (.cse23 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse6 .cse19 .cse20 .cse21 .cse22 (< 0 ULTIMATE.start_s_memory_read_~i) .cse23 .cse4 .cse15 .cse5 .cse7 .cse24) (and .cse9 .cse16 .cse17 .cse10 .cse11 .cse12 .cse18 .cse6 .cse19 .cse20 .cse21 .cse22 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse4 .cse8 .cse15 .cse5 .cse7 .cse24)))) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= ~s_memory1~0 51))) (or (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse1 (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse2 .cse3 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse4 (not .cse5) (<= 2 ~s_run_pc~0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse3) (and .cse9 .cse10 (or (and (<= ~m_run_pc~0 0) .cse7 .cse6) (and (= ~m_run_pc~0 3) .cse6 .cse7)) .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse2 .cse13 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse4 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5)))) [2019-12-07 13:33:30,976 INFO L246 CegarLoopResult]: For program point L524(lines 523 551) no Hoare annotation was computed. [2019-12-07 13:33:30,976 INFO L246 CegarLoopResult]: For program point L392(lines 392 398) no Hoare annotation was computed. [2019-12-07 13:33:30,976 INFO L242 CegarLoopResult]: At program point L392-1(lines 392 398) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse4 (not .cse7) (<= 2 ~s_run_pc~0) .cse8 .cse1))) [2019-12-07 13:33:30,976 INFO L242 CegarLoopResult]: At program point L326(lines 319 372) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,976 INFO L246 CegarLoopResult]: For program point L1251(line 1251) no Hoare annotation was computed. [2019-12-07 13:33:30,976 INFO L246 CegarLoopResult]: For program point L1119(lines 1119 1123) no Hoare annotation was computed. [2019-12-07 13:33:30,977 INFO L246 CegarLoopResult]: For program point L1119-1(lines 1114 1155) no Hoare annotation was computed. [2019-12-07 13:33:30,977 INFO L246 CegarLoopResult]: For program point L1053(lines 1053 1057) no Hoare annotation was computed. [2019-12-07 13:33:30,977 INFO L242 CegarLoopResult]: At program point L921(lines 914 958) the Hoare annotation is: (let ((.cse5 (<= ~c_req_a~0 1)) (.cse8 (<= 1 ~c_req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse4 (= ~m_run_pc~0 3)) (.cse2 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 0 ~a_t~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse18 (= ~s_memory1~0 51)) (.cse25 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~a_t~0 0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= 2 ~s_run_pc~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse16 .cse17 .cse3 .cse18 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse6 .cse5 .cse19 .cse8 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse20 .cse9 .cse10 .cse12 .cse21 .cse13 .cse14 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse22 .cse10 (let ((.cse23 (<= ~c_req_a~0 0)) (.cse24 (<= 0 ~c_req_a~0))) (or (and .cse23 .cse24 .cse9 .cse0 .cse11 (= 0 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6) (and .cse23 .cse24 .cse9 .cse0 .cse11 (<= 2 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6))) .cse2 .cse26 .cse12 .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse16 .cse17 .cse3 .cse18 .cse25 .cse6 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse22 .cse20 .cse9 .cse10 (= ~req_tt_a~0 0) .cse26 .cse12 .cse21 .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,977 INFO L246 CegarLoopResult]: For program point L525(lines 525 529) no Hoare annotation was computed. [2019-12-07 13:33:30,977 INFO L246 CegarLoopResult]: For program point L1186(lines 1186 1190) no Hoare annotation was computed. [2019-12-07 13:33:30,977 INFO L242 CegarLoopResult]: At program point L129-2(lines 129 475) the Hoare annotation is: (let ((.cse10 (= 2 ~s_run_pc~0))) (let ((.cse0 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse18 (not .cse10)) (.cse16 (<= 2 ~s_run_pc~0)) (.cse12 (= 0 ~c_req_a~0)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_empty_req~0 1)) (.cse14 (<= ~m_run_pc~0 0)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= 0 ~s_run_pc~0)) (.cse7 (= ~a_t~0 0)) (.cse9 (<= ~c_m_lock~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse12 .cse13 .cse3 .cse14 .cse4 .cse5 .cse15 .cse16 .cse7 .cse9 .cse1 .cse11) (and .cse17 .cse5 .cse18 .cse16 .cse11 .cse1 .cse19) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11) (and (<= ~c_req_a~0 0) .cse17 (<= 0 ~c_req_a~0) .cse3 .cse14 .cse5 .cse20 .cse9 .cse11 .cse1 .cse19) (and .cse5 .cse18 .cse16 .cse9 .cse11 .cse1) (and .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse20 .cse7 .cse9 .cse1 .cse11)))) [2019-12-07 13:33:30,977 INFO L246 CegarLoopResult]: For program point L856(lines 856 868) no Hoare annotation was computed. [2019-12-07 13:33:30,977 INFO L242 CegarLoopResult]: At program point L790(lines 783 800) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,977 INFO L246 CegarLoopResult]: For program point L724(lines 724 728) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L592(lines 592 596) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L328(lines 328 332) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L242 CegarLoopResult]: At program point L1319(lines 1312 1329) the Hoare annotation is: (let ((.cse31 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse24 (= ~c_empty_rsp~0 1)) (.cse38 (<= ~c_req_a~0 1)) (.cse39 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse30 (<= 2 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_a~0)) (.cse37 (= ~req_tt_a~0 1)) (.cse35 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse20 (<= ~m_run_pc~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse32 (<= ~c_req_d~0 50)) (.cse33 (<= 50 ~c_req_d~0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse34 (= 0 ~s_run_pc~0)) (.cse21 (= 0 ~c_req_type~0)) (.cse28 (= ULTIMATE.start_m_run_~a~0 0)) (.cse41 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse43 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse36 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~s_memory1~0 51)) (.cse27 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse40 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse29 (= ~req_tt_a~0 0)) (.cse22 (= ~a_t~0 0)) (.cse42 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse31 .cse24 .cse38 .cse39 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse24 .cse38 .cse39 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse9 .cse20 .cse10 .cse11 .cse21 .cse22 .cse16 .cse23 .cse24 .cse17) (and .cse0 .cse21 .cse2 .cse3 .cse25 .cse5 .cse6 .cse24 .cse26 .cse27 .cse19 .cse28 .cse10 .cse29 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse30 .cse8 .cse17 .cse24) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse31 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse32 .cse33 .cse28 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse30 .cse17 .cse24) (and .cse19 .cse9 .cse20 .cse10 .cse21 .cse34 .cse22 .cse23 .cse24 .cse17) (and .cse35 .cse0 .cse36 .cse21 .cse2 .cse25 .cse37 .cse24 .cse38 .cse26 .cse39 .cse40 .cse41 .cse10 .cse14 .cse42 .cse16 .cse17 .cse18 .cse43) (and .cse21 .cse37 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse41 .cse9 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse43 .cse35 .cse0 .cse36 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse2 .cse25 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse38 .cse26 .cse39 .cse10 .cse42 .cse17) (and .cse44 .cse45 .cse9 .cse20 .cse11 .cse34 .cse23 .cse17 .cse24) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse24) (and .cse46 .cse47 .cse34 .cse8 .cse24 .cse32 .cse44 .cse45 .cse33 .cse28 .cse10 .cse22 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse24 .cse32 .cse44 .cse33 .cse45 .cse28 .cse10 .cse22 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse34 .cse8 .cse17 .cse24) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse24 .cse18 .cse26) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse24 .cse18 .cse26) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse21 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse28 .cse41 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse43 .cse0 .cse36 .cse2 .cse25 .cse27 .cse26 .cse40 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse29 .cse22 .cse42 .cse17) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse31 .cse48)))) [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L130(lines 129 475) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L242 CegarLoopResult]: At program point L64(lines 53 65) the Hoare annotation is: (let ((.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse12 (= ~m_run_pc~0 6)) (.cse3 (= ~c_empty_req~0 1)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse14 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (= 2 ~s_run_pc~0)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse0 (= ~req_tt_a~0 1) .cse1 .cse2 .cse3 (< 0 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 .cse6 .cse7 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 .cse14 .cse15) (and .cse8 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse0 .cse10 .cse11 .cse1 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse3 (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse4 (= ~a_t~0 0) .cse14 .cse5 .cse15 .cse6 .cse7))) [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L923(lines 923 927) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L791(lines 480 832) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L1320(lines 1250 1339) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L131(lines 131 135) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 13:33:30,978 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,979 INFO L246 CegarLoopResult]: For program point L792(lines 792 796) no Hoare annotation was computed. [2019-12-07 13:33:30,979 INFO L242 CegarLoopResult]: At program point L462(lines 455 472) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse4 (not .cse8) (<= 2 ~s_run_pc~0) .cse7 .cse9 .cse1) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,979 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1325) no Hoare annotation was computed. [2019-12-07 13:33:30,979 INFO L246 CegarLoopResult]: For program point L264(lines 264 268) no Hoare annotation was computed. [2019-12-07 13:33:30,979 INFO L246 CegarLoopResult]: For program point L859(lines 859 867) no Hoare annotation was computed. [2019-12-07 13:33:30,979 INFO L246 CegarLoopResult]: For program point L463(lines 455 472) no Hoare annotation was computed. [2019-12-07 13:33:30,979 INFO L242 CegarLoopResult]: At program point L860(lines 855 1106) the Hoare annotation is: false [2019-12-07 13:33:30,979 INFO L242 CegarLoopResult]: At program point L662(lines 632 663) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse15 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse2 .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14 .cse15) (and .cse0 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 .cse2 .cse3 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse9 .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,979 INFO L246 CegarLoopResult]: For program point L464(lines 464 468) no Hoare annotation was computed. [2019-12-07 13:33:30,980 INFO L242 CegarLoopResult]: At program point L1125(lines 1114 1155) the Hoare annotation is: (let ((.cse48 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse38 (<= 1 ~c_req_type~0)) (.cse39 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse23 (= ~m_run_pc~0 3)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse31 (<= ~c_req_a~0 1)) (.cse32 (<= 1 ~c_req_a~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse19 (<= 2 ~c_write_rsp_ev~0)) (.cse20 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse10 (= 0 ~c_req_a~0)) (.cse22 (<= 2 ~s_run_pc~0)) (.cse40 (<= ~c_req_d~0 50)) (.cse43 (<= 50 ~c_req_d~0)) (.cse41 (<= ~c_req_a~0 0)) (.cse42 (<= 0 ~c_req_a~0)) (.cse25 (<= ~m_run_pc~0 0)) (.cse26 (= 0 ~s_run_pc~0)) (.cse27 (<= ~c_m_lock~0 0)) (.cse44 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse45 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ~req_tt_a~0 1)) (.cse28 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse47 (<= ~c_req_d~0 51)) (.cse46 (<= 51 ~c_req_d~0)) (.cse49 (or (and .cse38 .cse39 .cse2 .cse23 .cse48 .cse7 .cse31 .cse32 .cse12 .cse15 .cse18 .cse19 .cse20) (and .cse38 .cse39 .cse2 .cse5 .cse6 .cse23 .cse7 .cse31 .cse32 .cse12 .cse15 .cse18 .cse19 .cse20))) (.cse1 (= 0 ~c_req_type~0)) (.cse21 (= ~c_empty_req~0 1)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse34 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse24 (<= 2 ~s_run_st~0)) (.cse37 (= ~m_run_st~0 0)) (.cse36 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse0 (<= 0 ~a_t~0)) (.cse29 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= ~s_memory1~0 51)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse33 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse13 (= ~req_tt_a~0 0)) (.cse16 (= ~a_t~0 0)) (.cse35 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse19 .cse7) (and .cse24 (not .cse18) .cse22 .cse19 .cse7) (and .cse10 .cse21 .cse25 .cse12 .cse1 .cse26 .cse16 .cse27 .cse7 .cse19) (and .cse28 .cse0 .cse29 .cse1 .cse2 .cse4 .cse30 .cse7 .cse31 .cse8 .cse32 .cse33 .cse34 .cse12 .cse15 .cse35 .cse18 .cse19 .cse20 .cse36) (and .cse12 .cse24 .cse23 .cse18 .cse19 .cse7) (and .cse10 .cse21 .cse25 .cse12 .cse24 .cse1 .cse22 .cse16 .cse27 .cse37 .cse7 .cse19) (and .cse38 .cse39 .cse26 .cse23 .cse7 .cse40 .cse41 .cse42 .cse43 .cse11 .cse12 .cse16 .cse15 .cse19) (and .cse38 .cse39 .cse23 .cse7 .cse40 .cse41 .cse43 .cse42 .cse11 .cse12 .cse16 .cse15 .cse18 .cse19) (and .cse0 .cse44 .cse2 .cse3 .cse45 .cse5 .cse6 .cse46 .cse23 .cse21 .cse12 .cse24 .cse14 .cse47 .cse15 .cse17 .cse37 .cse18 .cse19 .cse20) (and .cse41 .cse42 .cse38 .cse24 .cse26 .cse23 .cse19 .cse7) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse23 .cse48 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse40 .cse43 .cse11 .cse21 .cse12 .cse24 .cse14 .cse16 .cse15 .cse17 .cse37 .cse18 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse41 .cse42 .cse21 .cse25 .cse24 .cse26 .cse27 .cse37 .cse19 .cse7) (and .cse0 .cse12 .cse24 .cse15 .cse18 .cse19 .cse7 .cse20 .cse8) (and .cse21 .cse0 .cse12 .cse24 .cse18 .cse19 .cse7 .cse20 .cse8) (and .cse44 .cse0 .cse14 .cse47 .cse3 .cse45 .cse17 .cse46 .cse49) (and .cse1 .cse30 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse34 .cse21 (< 0 ULTIMATE.start_s_memory_read_~i) .cse24 (= 51 ~c_rsp_d~0) .cse15 .cse37 .cse18 .cse20 .cse36 .cse28 .cse0 .cse29 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse2 .cse4 .cse5 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse31 .cse8 .cse32 .cse12 .cse35 .cse19) (and .cse0 .cse14 .cse47 .cse46 .cse48 .cse49) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse21 .cse11 .cse34 .cse24 (= 50 ~c_rsp_d~0) .cse15 .cse37 .cse18 .cse20 .cse36 .cse0 .cse29 .cse2 .cse4 .cse8 .cse9 .cse33 .cse12 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse16 .cse35 .cse19)))) [2019-12-07 13:33:30,980 INFO L242 CegarLoopResult]: At program point L1059(lines 1052 1078) the Hoare annotation is: (let ((.cse16 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse23 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse25 (= ~a_t~0 0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (= ~s_memory0~0 50)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 .cse2 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15) (and (<= 1 ~c_req_type~0) (<= ~c_req_type~0 1) .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse18 .cse19 .cse20 (let ((.cse21 (not .cse4))) (or (and .cse1 .cse21 (<= 2 ~s_run_pc~0) .cse22) (and .cse1 .cse21 (= 0 ~s_run_pc~0) .cse22))) .cse23 .cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse24 .cse3 .cse25 .cse26 .cse27) (and .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse1 .cse23 .cse14 .cse24 .cse3 .cse25 .cse26 .cse4 .cse27) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse0 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse2 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse25 .cse3 .cse15 .cse4 .cse5 .cse6) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse11 .cse12 (<= 51 ~c_req_d~0) .cse22 .cse1 .cse14 .cse24 (<= ~c_req_d~0 51) .cse3 .cse26 .cse4 .cse5))) [2019-12-07 13:33:30,980 INFO L246 CegarLoopResult]: For program point L1258(lines 1258 1311) no Hoare annotation was computed. [2019-12-07 13:33:30,980 INFO L242 CegarLoopResult]: At program point L1192(lines 1185 1229) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 13:33:30,980 INFO L246 CegarLoopResult]: For program point L69(lines 69 74) no Hoare annotation was computed. [2019-12-07 13:33:30,980 INFO L246 CegarLoopResult]: For program point L862(lines 862 866) no Hoare annotation was computed. [2019-12-07 13:33:30,980 INFO L242 CegarLoopResult]: At program point L730(lines 723 740) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,980 INFO L242 CegarLoopResult]: At program point L598(lines 591 608) the Hoare annotation is: (let ((.cse15 (= ~a_t~0 0)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse4 (let ((.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse19 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ~c_req_a~0 1)) (.cse21 (= ~m_run_pc~0 6)) (.cse22 (<= 1 ~c_req_a~0)) (.cse23 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse24 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse18 .cse2 .cse19 .cse20 .cse21 .cse22 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse0 .cse23 .cse14 .cse15 .cse1 .cse3 .cse24) (and .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse2 .cse19 .cse20 .cse21 .cse22 .cse0 (< 0 ULTIMATE.start_s_memory_read_~i) .cse23 .cse14 .cse1 .cse3 .cse24)))) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (= ~s_memory1~0 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3) (and .cse4 .cse5 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse6 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse9 (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) .cse10 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse11 .cse6 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse14 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1) (and .cse4 .cse5 .cse6 .cse15 .cse7)))) [2019-12-07 13:33:30,981 INFO L242 CegarLoopResult]: At program point L334(lines 327 371) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,981 INFO L246 CegarLoopResult]: For program point L1259(lines 1259 1263) no Hoare annotation was computed. [2019-12-07 13:33:30,981 INFO L242 CegarLoopResult]: At program point L202(lines 172 203) the Hoare annotation is: (let ((.cse3 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse20 (= ~a_t~0 0)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse21 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse13 (= 0 ~c_req_type~0)) (.cse7 (<= 2 ~s_run_pc~0)) (.cse15 (= 0 ~c_req_a~0)) (.cse16 (= ULTIMATE.start_m_run_~a~0 0)) (.cse22 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse11 (<= ~m_run_pc~0 0)) (.cse12 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (= 0 ~s_run_pc~0)) (.cse23 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse0 (let ((.cse24 (<= 0 ~a_t~0)) (.cse25 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse26 (= ~s_memory0~0 50)) (.cse27 (= ~m_run_pc~0 3)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse24 .cse25 .cse26 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse27 .cse8 .cse28 .cse29 .cse17 .cse30 .cse5 .cse18 .cse19 .cse21 .cse6 .cse9) (and .cse24 .cse25 .cse26 .cse27 .cse3 .cse8 .cse28 .cse29 .cse17 .cse30 .cse5 .cse20 .cse18 .cse19 .cse21 .cse6 .cse9)))) (.cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse2 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse8 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse9 .cse23) (and .cse10 .cse12 .cse11 .cse13 .cse7 .cse8 .cse15 .cse16 .cse17 .cse5 .cse18 .cse19 .cse20 .cse21 .cse22 .cse9 .cse23) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 .cse5 .cse14 .cse21 .cse9 .cse8 (<= 0 ULTIMATE.start_m_run_~a~0) .cse23) (and .cse0 .cse1 (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse2 .cse4)))) [2019-12-07 13:33:30,981 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2019-12-07 13:33:30,981 INFO L242 CegarLoopResult]: At program point L929(lines 922 957) the Hoare annotation is: (let ((.cse5 (<= ~c_req_a~0 1)) (.cse8 (<= 1 ~c_req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse4 (= ~m_run_pc~0 3)) (.cse2 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 0 ~a_t~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse18 (= ~s_memory1~0 51)) (.cse25 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~a_t~0 0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= 2 ~s_run_pc~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse16 .cse17 .cse3 .cse18 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse6 .cse5 .cse19 .cse8 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse20 .cse9 .cse10 .cse12 .cse21 .cse13 .cse14 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse22 .cse10 (let ((.cse23 (<= ~c_req_a~0 0)) (.cse24 (<= 0 ~c_req_a~0))) (or (and .cse23 .cse24 .cse9 .cse0 .cse11 (= 0 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6) (and .cse23 .cse24 .cse9 .cse0 .cse11 (<= 2 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6))) .cse2 .cse26 .cse12 .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse16 .cse17 .cse3 .cse18 .cse25 .cse6 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse22 .cse20 .cse9 .cse10 (= ~req_tt_a~0 0) .cse26 .cse12 .cse21 .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,981 INFO L242 CegarLoopResult]: At program point L863(lines 855 1106) the Hoare annotation is: (let ((.cse16 (<= 1 ~c_req_type~0)) (.cse17 (<= ~c_req_type~0 1)) (.cse0 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~a_t~0 0)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~s_memory1~0 51)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse18 (<= ~c_req_a~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse19 (<= 1 ~c_req_a~0)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse13 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse14 (= 2 ~s_run_pc~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= ~c_empty_req~0 1) (<= 2 ~s_run_pc~0) .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse8 .cse9 .cse10 (= ~req_tt_a~0 0) .cse11 .cse12 .cse13 .cse14 .cse1 .cse15) (and .cse16 .cse3 .cse17 .cse5 (<= 51 ~c_req_d~0) .cse0 .cse2 .cse18 .cse19 .cse10 (<= ~c_req_d~0 51) .cse11 .cse14 .cse1 .cse15) (and .cse16 .cse17 .cse0 .cse2 (<= ~c_req_d~0 50) (<= ~c_req_a~0 0) (<= 50 ~c_req_d~0) (<= 0 ~c_req_a~0) .cse8 .cse10 .cse11 .cse12 .cse14 .cse1) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse3 .cse4 .cse5 .cse6 (= ~req_tt_a~0 1) .cse2 .cse18 .cse7 .cse19 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse9 .cse10 .cse11 .cse13 .cse14 .cse1 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 13:33:30,981 INFO L246 CegarLoopResult]: For program point L731(lines 723 740) no Hoare annotation was computed. [2019-12-07 13:33:30,981 INFO L246 CegarLoopResult]: For program point L599(lines 480 832) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L401(lines 401 454) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L1194(lines 1194 1198) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L71(lines 71 74) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L996-1(lines 871 1101) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L732(lines 732 736) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L402(lines 402 406) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L336(lines 336 340) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L242 CegarLoopResult]: At program point L270(lines 263 280) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse1 (<= 1 ~c_req_type~0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (= 0 ~s_run_pc~0)) (.cse4 (not .cse13)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (<= ~c_req_a~0 0)) (.cse7 (<= 0 ~c_req_a~0)) (.cse12 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and (<= ULTIMATE.start_m_run_~req_d~0 50) .cse0 .cse1 .cse2 (<= ~c_req_type~0 1) .cse3 .cse4 .cse5 (<= ~c_req_d~0 50) .cse6 (<= 50 ~c_req_d~0) .cse7 (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) (= ~a_t~0 0) .cse8 (<= 50 ULTIMATE.start_m_run_~req_d~0) .cse9 .cse10 .cse11) (and .cse12 .cse4 (<= 2 ~s_run_pc~0) .cse9 .cse5) (and .cse12 .cse13 .cse5 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10 .cse11)))) [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L1129(lines 1129 1136) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L997(lines 996 1020) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L931(lines 931 935) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L271(lines 263 280) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L998(lines 998 1002) no Hoare annotation was computed. [2019-12-07 13:33:30,982 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-12-07 13:33:30,983 INFO L242 CegarLoopResult]: At program point L140-2(lines 140 168) the Hoare annotation is: (let ((.cse21 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 2 ~s_run_st~0)) (.cse12 (= ~a_t~0 0)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse13 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= ~c_m_lock~0 0)) (.cse23 (= 2 ~s_run_pc~0)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse3 (= 0 ~c_req_type~0)) (.cse6 (= 0 ~c_req_a~0)) (.cse8 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (<= 2 ~s_run_pc~0)) (.cse19 (let ((.cse24 (<= 0 ~a_t~0)) (.cse25 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse26 (= ~s_memory0~0 50)) (.cse27 (= ~m_run_pc~0 3)) (.cse28 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse30 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse31 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1))) (or (and .cse24 .cse25 .cse26 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse27 .cse5 .cse28 .cse29 .cse7 .cse9 .cse30 .cse10 .cse31 .cse11 .cse13 .cse15 .cse23 .cse16) (and .cse24 .cse25 .cse26 .cse27 .cse21 .cse5 .cse28 .cse29 .cse7 .cse9 .cse30 .cse10 .cse31 .cse12 .cse11 .cse13 .cse15 .cse23 .cse16)))) (.cse20 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse22 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse2 (<= ~m_run_pc~0 0)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (= 0 ~s_run_pc~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse20 .cse21 .cse22) (and .cse10 (not .cse23) .cse4 .cse16 .cse5) (and (<= ~c_req_d~0 51) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse19 (<= 51 ~c_req_d~0) .cse20 .cse22) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse1 .cse18 .cse5 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse7 .cse10 .cse13 .cse15 .cse16 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17)))) [2019-12-07 13:33:30,983 INFO L246 CegarLoopResult]: For program point L669(lines 669 722) no Hoare annotation was computed. [2019-12-07 13:33:30,983 INFO L246 CegarLoopResult]: For program point L141(lines 140 168) no Hoare annotation was computed. [2019-12-07 13:33:30,983 INFO L246 CegarLoopResult]: For program point L670(lines 670 674) no Hoare annotation was computed. [2019-12-07 13:33:30,983 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,983 INFO L242 CegarLoopResult]: At program point L1265(lines 1258 1311) the Hoare annotation is: (let ((.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse34 (= ~c_empty_rsp~0 1)) (.cse42 (<= ~c_req_a~0 1)) (.cse43 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (= ~req_tt_a~0 0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse31 (= 0 ~c_req_a~0)) (.cse27 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse32 (<= ~m_run_pc~0 0)) (.cse33 (<= ~c_m_lock~0 0)) (.cse37 (<= ~c_req_d~0 50)) (.cse38 (<= 50 ~c_req_d~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse29 (= ~a_t~0 0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse39 (= 0 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_type~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse40 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (= ~s_memory1~0 51)) (.cse30 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse36 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse0 .cse23 .cse2 .cse24 .cse25 .cse26 .cse27 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse28 .cse29 .cse30 .cse17) (and .cse31 .cse9 .cse32 .cse10 .cse11 .cse19 .cse29 .cse16 .cse33 .cse34 .cse17) (and .cse0 .cse19 .cse2 .cse3 .cse24 .cse5 .cse6 .cse34 .cse26 .cse25 .cse31 .cse20 .cse10 .cse28 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse35 .cse8 .cse17 .cse34) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse37 .cse38 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse35 .cse17 .cse34) (and .cse31 .cse9 .cse32 .cse10 .cse19 .cse39 .cse29 .cse33 .cse34 .cse17) (and .cse40 .cse0 .cse23 .cse19 .cse2 .cse24 .cse41 .cse34 .cse42 .cse26 .cse43 .cse27 .cse21 .cse10 .cse14 .cse30 .cse16 .cse17 .cse18 .cse22) (and .cse44 .cse45 .cse9 .cse32 .cse11 .cse39 .cse33 .cse17 .cse34) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse34) (and .cse46 .cse47 .cse39 .cse8 .cse34 .cse37 .cse44 .cse45 .cse38 .cse20 .cse10 .cse29 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse34 .cse37 .cse44 .cse38 .cse45 .cse20 .cse10 .cse29 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse39 .cse8 .cse17 .cse34) (and .cse19 .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse21 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse40 .cse0 .cse23 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse24 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse26 .cse43 .cse10 .cse30 .cse17) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse36 .cse48)))) [2019-12-07 13:33:30,983 INFO L246 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-12-07 13:33:30,983 INFO L242 CegarLoopResult]: At program point L1067(lines 1060 1077) the Hoare annotation is: (let ((.cse16 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ~c_req_d~0 50)) (.cse20 (<= 50 ~c_req_d~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse10 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse23 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse25 (= ~a_t~0 0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (= ~s_memory0~0 50)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse24 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 .cse2 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 .cse9 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 .cse12 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15) (and (<= 1 ~c_req_type~0) (<= ~c_req_type~0 1) .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse18 .cse19 .cse20 (let ((.cse21 (not .cse4))) (or (and .cse1 .cse21 (<= 2 ~s_run_pc~0) .cse22) (and .cse1 .cse21 (= 0 ~s_run_pc~0) .cse22))) .cse23 .cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse24 .cse3 .cse25 .cse26 .cse27) (and .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse1 .cse23 .cse14 .cse24 .cse3 .cse25 .cse26 .cse4 .cse27) (and .cse7 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse0 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse23 .cse2 .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse25 .cse3 .cse15 .cse4 .cse5 .cse6) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse11 .cse12 (<= 51 ~c_req_d~0) .cse22 .cse1 .cse14 .cse24 (<= ~c_req_d~0 51) .cse3 .cse26 .cse4 .cse5))) [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point L209(lines 209 262) no Hoare annotation was computed. [2019-12-07 13:33:30,984 INFO L242 CegarLoopResult]: At program point L1200(lines 1193 1228) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point L1068(lines 871 1101) no Hoare annotation was computed. [2019-12-07 13:33:30,984 INFO L242 CegarLoopResult]: At program point L11-3(lines 1 1371) the Hoare annotation is: (let ((.cse0 (<= 0 ~a_t~0)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse11 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse5 (<= ~c_req_a~0 1) .cse6 (<= 1 ~c_req_a~0) .cse7 .cse8 .cse9 (< 0 ULTIMATE.start_s_memory_read_~i) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,984 INFO L242 CegarLoopResult]: At program point L11-4(lines 67 77) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= ~c_empty_req~0 1)) (.cse1 (= ~m_run_pc~0 3)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse16 (= 2 ~s_run_pc~0)) (.cse2 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (<= ~c_req_d~0 50)) (.cse7 (<= 50 ~c_req_d~0)) (.cse8 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse13 (= ~a_t~0 0)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse1 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 (<= ~c_req_d~0 51) .cse14 .cse15 .cse16 .cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 1 ~c_req_type~0) (<= ~c_req_type~0 1) .cse0 (let ((.cse19 (not .cse16))) (or (and .cse9 (= 0 ~s_run_pc~0) .cse19 .cse1 .cse17 .cse3) (and .cse9 .cse19 (<= 2 ~s_run_pc~0) .cse1 .cse17 .cse3))) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse18))) [2019-12-07 13:33:30,984 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 13:33:30,985 INFO L242 CegarLoopResult]: At program point L408(lines 401 454) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse4 (not .cse8) (<= 2 ~s_run_pc~0) .cse7 .cse9 .cse1) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,985 INFO L242 CegarLoopResult]: At program point L342(lines 335 370) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,985 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1337) no Hoare annotation was computed. [2019-12-07 13:33:30,985 INFO L246 CegarLoopResult]: For program point L1333-1(lines 1165 1344) no Hoare annotation was computed. [2019-12-07 13:33:30,985 INFO L246 CegarLoopResult]: For program point L1267(lines 1267 1271) no Hoare annotation was computed. [2019-12-07 13:33:30,985 INFO L246 CegarLoopResult]: For program point L210(lines 210 214) no Hoare annotation was computed. [2019-12-07 13:33:30,985 INFO L246 CegarLoopResult]: For program point L1069(lines 1069 1073) no Hoare annotation was computed. [2019-12-07 13:33:30,985 INFO L242 CegarLoopResult]: At program point L937(lines 930 956) the Hoare annotation is: (let ((.cse5 (<= ~c_req_a~0 1)) (.cse8 (<= 1 ~c_req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse4 (= ~m_run_pc~0 3)) (.cse2 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 0 ~a_t~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse18 (= ~s_memory1~0 51)) (.cse25 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~a_t~0 0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= 2 ~s_run_pc~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse16 .cse17 .cse3 .cse18 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse6 .cse5 .cse19 .cse8 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse20 .cse9 .cse10 .cse12 .cse21 .cse13 .cse14 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse22 .cse10 (let ((.cse23 (<= ~c_req_a~0 0)) (.cse24 (<= 0 ~c_req_a~0))) (or (and .cse23 .cse24 .cse9 .cse0 .cse11 (= 0 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6) (and .cse23 .cse24 .cse9 .cse0 .cse11 (<= 2 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6))) .cse2 .cse26 .cse12 .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse16 .cse17 .cse3 .cse18 .cse25 .cse6 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse22 .cse20 .cse9 .cse10 (= ~req_tt_a~0 0) .cse26 .cse12 .cse21 .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,985 INFO L242 CegarLoopResult]: At program point L871-1(lines 855 1106) the Hoare annotation is: (let ((.cse5 (<= 2 ~s_run_pc~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse1 (<= ~c_req_a~0 0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse19 (<= 0 ~a_t~0)) (.cse20 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= 0 ~c_req_type~0)) (.cse21 (= ~s_memory0~0 50)) (.cse22 (= ~s_memory1~0 51)) (.cse25 (= ~m_run_pc~0 6)) (.cse15 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse26 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= 2 ~s_run_pc~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse18 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse0 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse13 (= ~a_t~0 0)) (.cse28 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (let ((.cse3 (<= 1 ~c_req_type~0))) (or (and .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 (= 0 ~s_run_pc~0) .cse6 .cse7 .cse8))) .cse9 .cse10 .cse11 (<= ~c_req_type~0 1) .cse12 .cse13) (and .cse14 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse15 .cse16 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse12 .cse4 .cse17 .cse18 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse19 .cse20 .cse21 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse22 .cse23 .cse24 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse25 (<= 1 ~c_req_a~0) .cse11 .cse26 .cse7) (and .cse16 .cse5 .cse6 .cse7 .cse8) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse19 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse21 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse23 .cse24 (<= 51 ~c_req_d~0) .cse6 .cse16 .cse11 .cse27 (<= ~c_req_d~0 51) .cse12 .cse28 .cse7 .cse17) (and .cse1 .cse2 .cse16 .cse11 (<= ~m_run_pc~0 0) .cse14 .cse13 (<= ~c_m_lock~0 0) .cse7 .cse8) (and .cse19 .cse20 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse14 .cse21 .cse22 .cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse16 .cse10 .cse15 .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse12 .cse13 .cse26 .cse4 .cse7 .cse17 .cse18) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse9 .cse10 .cse16 .cse11 .cse27 .cse12 .cse13 .cse28 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,985 INFO L246 CegarLoopResult]: For program point L1202(lines 1202 1206) no Hoare annotation was computed. [2019-12-07 13:33:30,985 INFO L246 CegarLoopResult]: For program point L806(lines 806 810) no Hoare annotation was computed. [2019-12-07 13:33:30,986 INFO L242 CegarLoopResult]: At program point L476(lines 128 477) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_st~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (= ~c_empty_rsp~0 1))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) (= ~m_run_pc~0 3) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 13:33:30,986 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-12-07 13:33:30,986 INFO L246 CegarLoopResult]: For program point L344(lines 344 348) no Hoare annotation was computed. [2019-12-07 13:33:30,986 INFO L246 CegarLoopResult]: For program point L939(lines 939 943) no Hoare annotation was computed. [2019-12-07 13:33:30,986 INFO L246 CegarLoopResult]: For program point L874-1(lines 871 1101) no Hoare annotation was computed. [2019-12-07 13:33:30,986 INFO L246 CegarLoopResult]: For program point L742(lines 742 748) no Hoare annotation was computed. [2019-12-07 13:33:30,986 INFO L242 CegarLoopResult]: At program point L742-1(lines 742 748) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= ~s_memory1~0 51)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse15 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse9 .cse10 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 .cse14 .cse15) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14 .cse15))) [2019-12-07 13:33:30,986 INFO L242 CegarLoopResult]: At program point L676(lines 669 722) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,986 INFO L246 CegarLoopResult]: For program point L875(lines 874 898) no Hoare annotation was computed. [2019-12-07 13:33:30,987 INFO L242 CegarLoopResult]: At program point L1140(lines 1114 1155) the Hoare annotation is: (let ((.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse24 (= ~c_empty_rsp~0 1)) (.cse42 (<= ~c_req_a~0 1)) (.cse43 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse30 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse33 (= ~req_tt_a~0 0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_a~0)) (.cse32 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse20 (<= ~m_run_pc~0 0)) (.cse23 (<= ~c_m_lock~0 0)) (.cse37 (<= ~c_req_d~0 50)) (.cse38 (<= 50 ~c_req_d~0)) (.cse25 (= ULTIMATE.start_m_run_~a~0 0)) (.cse22 (= ~a_t~0 0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse39 (= 0 ~s_run_pc~0)) (.cse21 (= 0 ~c_req_type~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse27 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse40 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse29 (= ~s_memory1~0 51)) (.cse34 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse31 (= ~m_run_pc~0 6)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse36 .cse24 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse24 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse9 .cse20 .cse10 .cse11 .cse21 .cse22 .cse16 .cse23 .cse24 .cse17) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse21 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse25 .cse26 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse27 .cse0 .cse28 .cse2 .cse29 .cse30 .cse31 .cse32 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse33 .cse22 .cse34 .cse17) (and .cse0 .cse21 .cse2 .cse3 .cse29 .cse5 .cse6 .cse24 .cse31 .cse30 .cse19 .cse25 .cse10 .cse33 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse35 .cse8 .cse17 .cse24) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse37 .cse38 .cse25 .cse9 .cse10 .cse11 .cse12 .cse14 .cse22 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse35 .cse17 .cse24) (and .cse19 .cse9 .cse20 .cse10 .cse21 .cse39 .cse22 .cse23 .cse24 .cse17) (and .cse40 .cse0 .cse28 .cse21 .cse2 .cse29 .cse41 .cse24 .cse42 .cse31 .cse43 .cse32 .cse26 .cse10 .cse14 .cse34 .cse16 .cse17 .cse18 .cse27) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse24) (and .cse44 .cse45 .cse9 .cse20 .cse11 .cse39 .cse23 .cse17 .cse24) (and .cse46 .cse47 .cse39 .cse8 .cse24 .cse37 .cse44 .cse45 .cse38 .cse25 .cse10 .cse22 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse24 .cse37 .cse44 .cse38 .cse45 .cse25 .cse10 .cse22 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse39 .cse8 .cse17 .cse24) (and .cse21 .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse26 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse27 .cse40 .cse0 .cse28 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse29 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse31 .cse43 .cse10 .cse34 .cse17) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse24 .cse18 .cse31) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse24 .cse18 .cse31) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse36 .cse48)))) [2019-12-07 13:33:30,987 INFO L246 CegarLoopResult]: For program point L876(lines 876 880) no Hoare annotation was computed. [2019-12-07 13:33:30,987 INFO L246 CegarLoopResult]: For program point L678(lines 678 682) no Hoare annotation was computed. [2019-12-07 13:33:30,987 INFO L242 CegarLoopResult]: At program point L480-2(lines 480 832) the Hoare annotation is: (let ((.cse16 (= ~a_t~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse1 (= ~s_memory0~0 50)) (.cse3 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 2 ~s_run_st~0)) (.cse9 (<= ~c_m_lock~0 0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse14 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse15 (let ((.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (= 0 ~c_req_type~0)) (.cse20 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse0 .cse18 .cse19 .cse1 .cse20 .cse5 .cse21 .cse22 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse6 .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse8 .cse16 .cse9 .cse10 .cse11 .cse23) (and .cse0 .cse18 .cse19 .cse1 .cse3 .cse20 .cse4 .cse5 .cse21 (<= ~c_req_a~0 1) .cse22 (<= 1 ~c_req_a~0) .cse6 .cse7 (< 0 ULTIMATE.start_s_memory_read_~i) .cse8 .cse9 .cse10 .cse11 .cse23)))) (.cse2 (= ~s_memory1~0 51)) (.cse17 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (not .cse10)) (.cse13 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) (= ~m_run_pc~0 3) .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse12 .cse13 .cse9 .cse11 .cse5 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse14 (= ULTIMATE.start_m_run_~a~0 1) .cse15 .cse2 .cse16 .cse17) (and .cse14 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse15 .cse2 .cse17 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse8 .cse12 .cse13 .cse9 .cse11 (<= 3 ~m_run_pc~0) .cse5)))) [2019-12-07 13:33:30,987 INFO L242 CegarLoopResult]: At program point L1273(lines 1266 1310) the Hoare annotation is: (let ((.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse34 (= ~c_empty_rsp~0 1)) (.cse42 (<= ~c_req_a~0 1)) (.cse43 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (= ~req_tt_a~0 0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse31 (= 0 ~c_req_a~0)) (.cse27 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse32 (<= ~m_run_pc~0 0)) (.cse33 (<= ~c_m_lock~0 0)) (.cse37 (<= ~c_req_d~0 50)) (.cse38 (<= 50 ~c_req_d~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse29 (= ~a_t~0 0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse39 (= 0 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_type~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse40 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (= ~s_memory1~0 51)) (.cse30 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse36 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse0 .cse23 .cse2 .cse24 .cse25 .cse26 .cse27 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse28 .cse29 .cse30 .cse17) (and .cse31 .cse9 .cse32 .cse10 .cse11 .cse19 .cse29 .cse16 .cse33 .cse34 .cse17) (and .cse0 .cse19 .cse2 .cse3 .cse24 .cse5 .cse6 .cse34 .cse26 .cse25 .cse31 .cse20 .cse10 .cse28 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse35 .cse8 .cse17 .cse34) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse37 .cse38 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse35 .cse17 .cse34) (and .cse31 .cse9 .cse32 .cse10 .cse19 .cse39 .cse29 .cse33 .cse34 .cse17) (and .cse40 .cse0 .cse23 .cse19 .cse2 .cse24 .cse41 .cse34 .cse42 .cse26 .cse43 .cse27 .cse21 .cse10 .cse14 .cse30 .cse16 .cse17 .cse18 .cse22) (and .cse44 .cse45 .cse9 .cse32 .cse11 .cse39 .cse33 .cse17 .cse34) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse34) (and .cse46 .cse47 .cse39 .cse8 .cse34 .cse37 .cse44 .cse45 .cse38 .cse20 .cse10 .cse29 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse34 .cse37 .cse44 .cse38 .cse45 .cse20 .cse10 .cse29 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse39 .cse8 .cse17 .cse34) (and .cse19 .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse21 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse40 .cse0 .cse23 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse24 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse26 .cse43 .cse10 .cse30 .cse17) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse36 .cse48)))) [2019-12-07 13:33:30,988 INFO L242 CegarLoopResult]: At program point L216(lines 209 262) the Hoare annotation is: (let ((.cse0 (<= 1 ~c_req_type~0)) (.cse19 (<= ~c_req_type~0 1)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse27 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= 2 ~s_run_st~0)) (.cse23 (= ~a_t~0 0)) (.cse24 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse25 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse18 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (= 0 ~s_run_pc~0)) (.cse20 (<= ~c_req_d~0 50)) (.cse5 (<= ~c_req_a~0 0)) (.cse6 (<= 0 ~c_req_a~0)) (.cse21 (<= 50 ~c_req_d~0)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse26 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse11 (let ((.cse28 (<= 0 ~a_t~0)) (.cse29 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse30 (= ~s_memory0~0 50)) (.cse31 (= ~m_run_pc~0 3)) (.cse32 (<= ~c_req_a~0 1)) (.cse33 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse34 (<= 1 ~c_req_a~0)) (.cse35 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse36 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse0 .cse28 .cse29 .cse19 .cse30 .cse17 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse31 .cse32 .cse4 .cse33 .cse34 .cse35 .cse36 .cse7 .cse24 .cse25 .cse8 .cse9) (and .cse0 .cse28 .cse29 .cse19 .cse30 .cse17 .cse31 .cse27 .cse32 .cse4 .cse33 .cse34 .cse35 .cse36 .cse7 .cse23 .cse24 .cse25 .cse8 .cse9)))) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse14 (<= 51 ~c_req_d~0)) (.cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0) .cse10) (and .cse11 .cse12 .cse13 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse14 .cse15 .cse16) (and .cse7 (not (= 2 ~s_run_pc~0)) .cse17 .cse4 .cse9) (and .cse18 .cse0 .cse1 .cse2 .cse19 .cse17 .cse4 .cse20 .cse5 .cse21 .cse6 .cse22 .cse7 .cse23 .cse24 .cse25 .cse26 .cse8 .cse9 .cse10) (and .cse18 .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse20 .cse5 .cse6 .cse21 .cse22 .cse24 .cse25 .cse23 .cse8 .cse26 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16)))) [2019-12-07 13:33:30,988 INFO L246 CegarLoopResult]: For program point L481(lines 480 832) no Hoare annotation was computed. [2019-12-07 13:33:30,988 INFO L249 CegarLoopResult]: At program point L1340(lines 1162 1345) the Hoare annotation is: true [2019-12-07 13:33:30,988 INFO L242 CegarLoopResult]: At program point L283-2(lines 283 311) the Hoare annotation is: (let ((.cse19 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse28 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse29 (<= ~c_req_type~0 1)) (.cse16 (= ~s_memory0~0 50)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse26 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse23 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (= ~c_empty_req~0 1)) (.cse0 (= ~m_run_pc~0 3)) (.cse25 (<= 2 ~s_run_pc~0)) (.cse22 (<= ~c_req_d~0 51)) (.cse21 (<= 51 ~c_req_d~0)) (.cse24 (let ((.cse33 (<= ~c_req_a~0 1)) (.cse34 (<= 1 ~c_req_a~0))) (or (and .cse28 .cse14 .cse29 .cse16 .cse19 .cse20 .cse26 .cse33 .cse34 .cse6 .cse8 .cse10 .cse12 .cse13 .cse23) (and .cse28 .cse14 .cse29 .cse16 .cse1 .cse26 .cse33 .cse34 .cse6 .cse8 .cse10 .cse12 .cse13 .cse23)))) (.cse7 (<= 2 ~s_run_st~0)) (.cse30 (= 0 ~s_run_pc~0)) (.cse27 (not .cse12)) (.cse2 (<= ~c_req_d~0 50)) (.cse31 (<= ~c_req_a~0 0)) (.cse3 (<= 50 ~c_req_d~0)) (.cse32 (<= 0 ~c_req_a~0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (= ~a_t~0 0))) (or (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse0 .cse5 .cse6 .cse7 .cse8 .cse22 .cse10 .cse11 .cse12 .cse13 .cse23) (and .cse15 .cse22 .cse17 .cse18 .cse11 .cse21 .cse24) (and .cse5 .cse25 .cse0 .cse13 .cse26) (and .cse7 .cse27 .cse25 .cse13 .cse26) (and .cse6 .cse7 .cse12 .cse26 .cse13) (and .cse22 .cse21 .cse1 .cse24) (and .cse28 .cse29 .cse30 .cse27 .cse26 .cse2 .cse31 .cse3 .cse32 .cse4 .cse6 .cse10 .cse9 .cse13) (and .cse31 .cse32 .cse28 .cse7 .cse30 .cse27 .cse13 .cse26) (and .cse28 .cse29 .cse26 .cse2 .cse31 .cse3 .cse32 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13)))) [2019-12-07 13:33:30,988 INFO L242 CegarLoopResult]: At program point L1208(lines 1201 1227) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 13:33:30,988 INFO L242 CegarLoopResult]: At program point L812(lines 805 822) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,988 INFO L246 CegarLoopResult]: For program point L614(lines 614 618) no Hoare annotation was computed. [2019-12-07 13:33:30,988 INFO L246 CegarLoopResult]: For program point L482(lines 482 486) no Hoare annotation was computed. [2019-12-07 13:33:30,988 INFO L242 CegarLoopResult]: At program point L416(lines 409 453) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse4 (not .cse8) (<= 2 ~s_run_pc~0) .cse7 .cse9 .cse1) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,989 INFO L242 CegarLoopResult]: At program point L350(lines 343 369) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L284(lines 283 311) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L1275(lines 1275 1279) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L218(lines 218 222) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L242 CegarLoopResult]: At program point L945(lines 938 955) the Hoare annotation is: (let ((.cse5 (<= ~c_req_a~0 1)) (.cse8 (<= 1 ~c_req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse4 (= ~m_run_pc~0 3)) (.cse2 (<= ~c_req_type~0 1)) (.cse7 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 0 ~a_t~0)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse17 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse18 (= ~s_memory1~0 51)) (.cse25 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse19 (= ~m_run_pc~0 6)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse26 (= ~a_t~0 0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= 2 ~s_run_pc~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse15) (and (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse16 .cse17 .cse3 .cse18 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse6 .cse5 .cse19 .cse8 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse20 .cse9 .cse10 .cse12 .cse21 .cse13 .cse14 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse22 .cse10 (let ((.cse23 (<= ~c_req_a~0 0)) (.cse24 (<= 0 ~c_req_a~0))) (or (and .cse23 .cse24 .cse9 .cse0 .cse11 (= 0 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6) (and .cse23 .cse24 .cse9 .cse0 .cse11 (<= 2 ~s_run_pc~0) .cse4 .cse25 .cse14 .cse6))) .cse2 .cse26 .cse12 .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse16 .cse17 .cse3 .cse18 .cse25 .cse6 .cse19 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse22 .cse20 .cse9 .cse10 (= ~req_tt_a~0 0) .cse26 .cse12 .cse21 .cse13 .cse14 .cse15))) [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L813(lines 805 822) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1214) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L1144(lines 1144 1151) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L946(lines 871 1101) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L814(lines 814 818) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L352(lines 352 356) no Hoare annotation was computed. [2019-12-07 13:33:30,989 INFO L246 CegarLoopResult]: For program point L947(lines 947 951) no Hoare annotation was computed. [2019-12-07 13:33:30,990 INFO L242 CegarLoopResult]: At program point L684(lines 677 721) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,990 INFO L242 CegarLoopResult]: At program point L552(lines 522 553) the Hoare annotation is: (let ((.cse2 (= ~a_t~0 0)) (.cse10 (<= 0 ~a_t~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (let ((.cse18 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse20 (= 0 ~c_req_type~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse23 (= ~m_run_pc~0 6)) (.cse24 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse25 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse10 .cse18 .cse19 .cse20 .cse11 .cse12 .cse21 .cse8 .cse22 .cse23 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse15 .cse24 .cse5 .cse2 .cse16 .cse17 .cse9 .cse25) (and .cse10 .cse18 .cse19 .cse20 .cse11 .cse12 .cse13 .cse21 .cse14 .cse8 .cse22 (<= ~c_req_a~0 1) .cse23 (<= 1 ~c_req_a~0) .cse15 (< 0 ULTIMATE.start_s_memory_read_~i) .cse24 .cse5 .cse16 .cse17 .cse9 .cse25)))) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (= ~s_memory1~0 51)) (.cse6 (not .cse17)) (.cse7 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 (<= 3 ~m_run_pc~0)) (and .cse0 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse1 .cse3 .cse4 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse10 .cse11 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse1 .cse13 .cse14 (<= 51 ~c_req_d~0) (= ~m_run_pc~0 3) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse15 .cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) .cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse17 .cse9) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-12-07 13:33:30,990 INFO L246 CegarLoopResult]: For program point L751(lines 751 804) no Hoare annotation was computed. [2019-12-07 13:33:30,990 INFO L246 CegarLoopResult]: For program point L752(lines 752 756) no Hoare annotation was computed. [2019-12-07 13:33:30,990 INFO L246 CegarLoopResult]: For program point L686(lines 686 690) no Hoare annotation was computed. [2019-12-07 13:33:30,990 INFO L242 CegarLoopResult]: At program point L620(lines 613 630) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3) (and (<= 0 ~a_t~0) .cse0 (<= 1 ~c_m_lock~0) .cse1 .cse3 .cse2 (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-12-07 13:33:30,990 INFO L242 CegarLoopResult]: At program point L1281(lines 1274 1309) the Hoare annotation is: (let ((.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse34 (= ~c_empty_rsp~0 1)) (.cse42 (<= ~c_req_a~0 1)) (.cse43 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (= ~req_tt_a~0 0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse31 (= 0 ~c_req_a~0)) (.cse27 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse32 (<= ~m_run_pc~0 0)) (.cse33 (<= ~c_m_lock~0 0)) (.cse37 (<= ~c_req_d~0 50)) (.cse38 (<= 50 ~c_req_d~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse29 (= ~a_t~0 0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse39 (= 0 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_type~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse40 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (= ~s_memory1~0 51)) (.cse30 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse36 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse0 .cse23 .cse2 .cse24 .cse25 .cse26 .cse27 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse28 .cse29 .cse30 .cse17) (and .cse31 .cse9 .cse32 .cse10 .cse11 .cse19 .cse29 .cse16 .cse33 .cse34 .cse17) (and .cse0 .cse19 .cse2 .cse3 .cse24 .cse5 .cse6 .cse34 .cse26 .cse25 .cse31 .cse20 .cse10 .cse28 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse35 .cse8 .cse17 .cse34) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse37 .cse38 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse35 .cse17 .cse34) (and .cse31 .cse9 .cse32 .cse10 .cse19 .cse39 .cse29 .cse33 .cse34 .cse17) (and .cse40 .cse0 .cse23 .cse19 .cse2 .cse24 .cse41 .cse34 .cse42 .cse26 .cse43 .cse27 .cse21 .cse10 .cse14 .cse30 .cse16 .cse17 .cse18 .cse22) (and .cse44 .cse45 .cse9 .cse32 .cse11 .cse39 .cse33 .cse17 .cse34) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse34) (and .cse46 .cse47 .cse39 .cse8 .cse34 .cse37 .cse44 .cse45 .cse38 .cse20 .cse10 .cse29 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse34 .cse37 .cse44 .cse38 .cse45 .cse20 .cse10 .cse29 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse39 .cse8 .cse17 .cse34) (and .cse19 .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse21 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse40 .cse0 .cse23 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse24 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse26 .cse43 .cse10 .cse30 .cse17) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse36 .cse48)))) [2019-12-07 13:33:30,991 INFO L242 CegarLoopResult]: At program point L224(lines 217 261) the Hoare annotation is: (let ((.cse6 (<= 1 ~c_req_type~0)) (.cse21 (<= ~c_req_type~0 1)) (.cse19 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~s_run_st~0)) (.cse25 (= ~a_t~0 0)) (.cse26 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse27 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse17 (= 2 ~s_run_pc~0)) (.cse15 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse0 (let ((.cse29 (<= 0 ~a_t~0)) (.cse30 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse31 (= ~s_memory0~0 50)) (.cse32 (= ~m_run_pc~0 3)) (.cse33 (<= ~c_req_a~0 1)) (.cse34 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse35 (<= 1 ~c_req_a~0)) (.cse36 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse37 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse6 .cse29 .cse30 .cse21 .cse31 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse32 .cse10 .cse33 .cse34 .cse35 .cse36 .cse37 .cse13 .cse26 .cse27 .cse14 .cse17 .cse15) (and .cse6 .cse29 .cse30 .cse21 .cse31 .cse32 .cse19 .cse10 .cse33 .cse34 .cse35 .cse36 .cse37 .cse13 .cse25 .cse26 .cse27 .cse14 .cse17 .cse15)))) (.cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse2 (<= ~c_req_d~0 51)) (.cse3 (<= 51 ~c_req_d~0)) (.cse4 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse5 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse18 (<= 2 ~s_run_pc~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (<= ~m_run_pc~0 0)) (.cse9 (= 0 ~s_run_pc~0)) (.cse22 (<= ~c_req_d~0 50)) (.cse11 (<= ~c_req_a~0 0)) (.cse12 (<= 0 ~c_req_a~0)) (.cse23 (<= 50 ~c_req_d~0)) (.cse24 (= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16) (and .cse13 (not .cse17) .cse18 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5) (and .cse20 .cse6 .cse7 .cse8 .cse21 .cse18 .cse10 .cse22 .cse11 .cse23 .cse12 .cse24 .cse13 .cse25 .cse26 .cse27 .cse28 .cse14 .cse15 .cse16) (and .cse20 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse22 .cse11 .cse12 .cse23 .cse24 .cse26 .cse27 .cse25 .cse14 .cse28 .cse15 .cse16)))) [2019-12-07 13:33:30,991 INFO L246 CegarLoopResult]: For program point L1083(lines 1083 1087) no Hoare annotation was computed. [2019-12-07 13:33:30,991 INFO L246 CegarLoopResult]: For program point L621(lines 613 630) no Hoare annotation was computed. [2019-12-07 13:33:30,991 INFO L242 CegarLoopResult]: At program point L1216(lines 1209 1226) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 13:33:30,991 INFO L246 CegarLoopResult]: For program point L622(lines 622 626) no Hoare annotation was computed. [2019-12-07 13:33:30,991 INFO L242 CegarLoopResult]: At program point L424(lines 417 452) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse7 (<= ~c_m_lock~0 0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse4 (not .cse8) (<= 2 ~s_run_pc~0) .cse7 .cse9 .cse1) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,991 INFO L242 CegarLoopResult]: At program point L490-2(lines 490 518) the Hoare annotation is: (let ((.cse14 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= 0 ~a_t~0)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse16 (= ~c_empty_req~0 1)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (= ~a_t~0 0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse6 (let ((.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (= 0 ~c_req_type~0)) (.cse22 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse23 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse24 (= ~m_run_pc~0 6)) (.cse25 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse26 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse11 .cse19 .cse20 .cse21 .cse12 .cse13 .cse14 .cse22 .cse15 .cse5 .cse23 (<= ~c_req_a~0 1) .cse24 (<= 1 ~c_req_a~0) .cse16 .cse17 .cse0 (< 0 ULTIMATE.start_s_memory_read_~i) .cse25 .cse3 .cse18 .cse4 .cse26) (and .cse11 .cse19 .cse20 .cse21 .cse12 .cse13 .cse22 .cse5 .cse23 .cse24 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse16 .cse17 .cse0 .cse25 .cse9 .cse3 .cse18 .cse4 .cse26)))) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse10 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ~s_memory1~0 51)) (.cse1 (not .cse18)) (.cse2 (<= 2 ~s_run_pc~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse7 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse8 .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse11 .cse12 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse8 .cse14 .cse15 (<= 51 ~c_req_d~0) (= ~m_run_pc~0 3) .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_d~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 .cse18 .cse4) (and .cse0 .cse1 .cse2 .cse4 (<= 3 ~m_run_pc~0) .cse5)))) [2019-12-07 13:33:30,991 INFO L242 CegarLoopResult]: At program point L358(lines 351 368) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~c_req_d~0 51) .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1287) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L226(lines 226 230) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L1217(lines 1165 1344) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L491(lines 490 518) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L359(lines 129 475) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1222) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L492(lines 492 496) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L360(lines 360 364) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L242 CegarLoopResult]: At program point L1021(lines 995 1022) the Hoare annotation is: (let ((.cse5 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (= 0 ~c_req_type~0)) (.cse17 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse24 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse26 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse18 (<= 0 ~a_t~0)) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse21 (= ~s_memory0~0 50)) (.cse22 (= ~s_memory1~0 51)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse23 (= ~m_run_pc~0 6)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse25 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and (let ((.cse1 (not .cse4))) (or (and .cse0 .cse1 (= 0 ~s_run_pc~0) .cse2 .cse3) (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2 .cse3))) (<= 1 ~c_req_type~0) (<= ~c_req_type~0 1) .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse5 .cse2 .cse6 .cse17 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse4 .cse3 .cse16) (and .cse18 .cse19 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse20 .cse21 .cse22 .cse17 .cse23 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse0 .cse10 .cse24 .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse14 .cse13 .cse25 .cse4 .cse3 .cse26 .cse27) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse18 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse21 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse28 (<= 51 ~c_req_d~0) .cse29 .cse2 .cse17 .cse0 .cse11 .cse12 (<= ~c_req_d~0 51) .cse14 .cse15 .cse4 .cse3 .cse26) (and .cse20 (= ~req_tt_a~0 1) .cse17 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse24 (< 0 ULTIMATE.start_s_memory_read_~i) .cse14 .cse4 .cse26 .cse27 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse18 .cse19 .cse21 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse22 .cse28 .cse29 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_req_a~0 1) .cse23 (<= 1 ~c_req_a~0) .cse11 .cse25 .cse3))) [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L559(lines 559 612) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L97(lines 97 125) no Hoare annotation was computed. [2019-12-07 13:33:30,992 INFO L246 CegarLoopResult]: For program point L824(lines 824 830) no Hoare annotation was computed. [2019-12-07 13:33:30,993 INFO L242 CegarLoopResult]: At program point L824-1(lines 824 830) the Hoare annotation is: (let ((.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse3 (= ~a_t~0 0)) (.cse8 (<= ~c_m_lock~0 0)) (.cse7 (= 2 ~s_run_pc~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse1 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse2 (= ~s_memory1~0 51)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (let ((.cse11 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse13 (= 0 ~c_req_type~0)) (.cse14 (= ~s_memory0~0 50)) (.cse15 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse16 (= ~m_run_pc~0 6)) (.cse17 (= ~c_empty_req~0 1)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ULTIMATE.start_s_memory_read_~i 1))) (or (and .cse11 .cse12 .cse13 .cse14 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse15 (<= ~c_req_a~0 1) .cse10 .cse16 (<= 1 ~c_req_a~0) .cse17 .cse18 (< 0 ULTIMATE.start_s_memory_read_~i) .cse6 .cse8 .cse7 .cse9 .cse19 .cse20) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse10 .cse16 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse0 .cse17 .cse18 .cse6 .cse3 .cse8 .cse7 .cse9 .cse19 .cse20))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 (= ULTIMATE.start_m_run_~rsp_d___0~0 51) (= 51 ULTIMATE.start_s_memory_read_~x~0) (= 51 ~c_rsp_d~0) .cse2 .cse4 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse5 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse6 (not .cse7) (<= 2 ~s_run_pc~0) .cse8 .cse9 (<= 3 ~m_run_pc~0) .cse10)))) [2019-12-07 13:33:30,993 INFO L242 CegarLoopResult]: At program point L758(lines 751 804) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,993 INFO L242 CegarLoopResult]: At program point L692(lines 685 720) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse4 (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15 .cse16) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ~c_req_a~0 1) .cse13 (<= 1 ~c_req_a~0) .cse14 .cse15 .cse16))) [2019-12-07 13:33:30,993 INFO L246 CegarLoopResult]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-12-07 13:33:30,993 INFO L242 CegarLoopResult]: At program point L1089(lines 1082 1099) the Hoare annotation is: (let ((.cse6 (= ~c_empty_req~0 1))) (let ((.cse2 (= 0 ~c_req_type~0)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse13 (= 2 ~s_run_pc~0)) (.cse15 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse4 (= ~s_memory1~0 51)) (.cse5 (= ~m_run_pc~0 6)) (.cse12 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= ~s_memory0~0 50)) (.cse16 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse18 (let ((.cse21 (= ~m_run_pc~0 3))) (or (and .cse6 (<= 2 ~s_run_pc~0) .cse21) (and .cse6 (= 0 ~s_run_pc~0) .cse21)))) (.cse7 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse19 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse11 (= ~a_t~0 0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse20 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1))) (or (and .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (< 0 (+ ULTIMATE.start_s_memory_read_~i 1)) .cse6 .cse7 .cse8 .cse9 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse6 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse10 .cse13 .cse14 .cse15 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 .cse1 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse4 .cse16 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse17 (<= ~c_req_a~0 1) .cse5 (<= 1 ~c_req_a~0) .cse9 .cse12) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse16 .cse17 (<= 51 ~c_req_d~0) .cse18 .cse9 .cse19 (<= ~c_req_d~0 51) .cse10 .cse20 .cse14) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse7 .cse9 .cse19 .cse11 .cse10 .cse20 (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-12-07 13:33:30,994 INFO L242 CegarLoopResult]: At program point L1156(lines 1108 1161) the Hoare annotation is: (let ((.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse34 (= ~c_empty_rsp~0 1)) (.cse42 (<= ~c_req_a~0 1)) (.cse43 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (= ~req_tt_a~0 0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse31 (= 0 ~c_req_a~0)) (.cse27 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse32 (<= ~m_run_pc~0 0)) (.cse33 (<= ~c_m_lock~0 0)) (.cse37 (<= ~c_req_d~0 50)) (.cse38 (<= 50 ~c_req_d~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse29 (= ~a_t~0 0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse39 (= 0 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_type~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse40 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (= ~s_memory1~0 51)) (.cse30 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse36 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse0 .cse23 .cse2 .cse24 .cse25 .cse26 .cse27 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse28 .cse29 .cse30 .cse17) (and .cse31 .cse9 .cse32 .cse10 .cse11 .cse19 .cse29 .cse16 .cse33 .cse34 .cse17) (and .cse0 .cse19 .cse2 .cse3 .cse24 .cse5 .cse6 .cse34 .cse26 .cse25 .cse31 .cse20 .cse10 .cse28 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse35 .cse8 .cse17 .cse34) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse37 .cse38 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse35 .cse17 .cse34) (and .cse31 .cse9 .cse32 .cse10 .cse19 .cse39 .cse29 .cse33 .cse34 .cse17) (and .cse40 .cse0 .cse23 .cse19 .cse2 .cse24 .cse41 .cse34 .cse42 .cse26 .cse43 .cse27 .cse21 .cse10 .cse14 .cse30 .cse16 .cse17 .cse18 .cse22) (and .cse44 .cse45 .cse9 .cse32 .cse11 .cse39 .cse33 .cse17 .cse34) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse34) (and .cse46 .cse47 .cse39 .cse8 .cse34 .cse37 .cse44 .cse45 .cse38 .cse20 .cse10 .cse29 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse34 .cse37 .cse44 .cse38 .cse45 .cse20 .cse10 .cse29 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse39 .cse8 .cse17 .cse34) (and .cse19 .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse21 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse40 .cse0 .cse23 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse24 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse26 .cse43 .cse10 .cse30 .cse17) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse36 .cse48)))) [2019-12-07 13:33:30,994 INFO L246 CegarLoopResult]: For program point L1090(lines 1082 1099) no Hoare annotation was computed. [2019-12-07 13:33:30,994 INFO L246 CegarLoopResult]: For program point L760(lines 760 764) no Hoare annotation was computed. [2019-12-07 13:33:30,994 INFO L246 CegarLoopResult]: For program point L694(lines 694 698) no Hoare annotation was computed. [2019-12-07 13:33:30,994 INFO L242 CegarLoopResult]: At program point L1289(lines 1282 1308) the Hoare annotation is: (let ((.cse36 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse46 (<= 1 ~c_req_type~0)) (.cse47 (<= ~c_req_type~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse34 (= ~c_empty_rsp~0 1)) (.cse42 (<= ~c_req_a~0 1)) (.cse43 (<= 1 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0))) (let ((.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse28 (= ~req_tt_a~0 0)) (.cse35 (<= 2 ~s_run_pc~0)) (.cse31 (= 0 ~c_req_a~0)) (.cse27 (< 0 (+ ULTIMATE.start_s_memory_read_~i 1))) (.cse32 (<= ~m_run_pc~0 0)) (.cse33 (<= ~c_m_lock~0 0)) (.cse37 (<= ~c_req_d~0 50)) (.cse38 (<= 50 ~c_req_d~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse29 (= ~a_t~0 0)) (.cse44 (<= ~c_req_a~0 0)) (.cse45 (<= 0 ~c_req_a~0)) (.cse39 (= 0 ~s_run_pc~0)) (.cse19 (= 0 ~c_req_type~0)) (.cse41 (= ~req_tt_a~0 1)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse40 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (= ~s_memory1~0 51)) (.cse30 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~s_run_st~0)) (.cse26 (= ~m_run_pc~0 6)) (.cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ~a_t~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse13 (<= ~c_req_d~0 51)) (.cse7 (<= 51 ~c_req_d~0)) (.cse48 (or (and .cse46 .cse47 .cse2 .cse8 .cse36 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18) (and .cse46 .cse47 .cse2 .cse5 .cse6 .cse8 .cse34 .cse42 .cse43 .cse10 .cse14 .cse16 .cse17 .cse18)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 .cse9 .cse11 (= 50 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse0 .cse23 .cse2 .cse24 .cse25 .cse26 .cse27 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse28 .cse29 .cse30 .cse17) (and .cse31 .cse9 .cse32 .cse10 .cse11 .cse19 .cse29 .cse16 .cse33 .cse34 .cse17) (and .cse0 .cse19 .cse2 .cse3 .cse24 .cse5 .cse6 .cse34 .cse26 .cse25 .cse31 .cse20 .cse10 .cse28 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse35 .cse8 .cse17 .cse34) (and (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse36 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse37 .cse38 .cse20 .cse9 .cse10 .cse11 .cse12 .cse14 .cse29 .cse15 .cse16 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 (not .cse16) .cse35 .cse17 .cse34) (and .cse31 .cse9 .cse32 .cse10 .cse19 .cse39 .cse29 .cse33 .cse34 .cse17) (and .cse40 .cse0 .cse23 .cse19 .cse2 .cse24 .cse41 .cse34 .cse42 .cse26 .cse43 .cse27 .cse21 .cse10 .cse14 .cse30 .cse16 .cse17 .cse18 .cse22) (and .cse44 .cse45 .cse9 .cse32 .cse11 .cse39 .cse33 .cse17 .cse34) (and .cse10 .cse11 .cse8 .cse16 .cse17 .cse34) (and .cse46 .cse47 .cse39 .cse8 .cse34 .cse37 .cse44 .cse45 .cse38 .cse20 .cse10 .cse29 .cse14 .cse17) (and .cse46 .cse47 .cse8 .cse34 .cse37 .cse44 .cse38 .cse45 .cse20 .cse10 .cse29 .cse14 .cse16 .cse17) (and .cse44 .cse45 .cse46 .cse11 .cse39 .cse8 .cse17 .cse34) (and .cse19 .cse41 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse21 .cse11 (< 0 ULTIMATE.start_s_memory_read_~i) (= 51 ~c_rsp_d~0) .cse14 .cse16 .cse18 .cse22 .cse40 .cse0 .cse23 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse24 .cse5 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse42 .cse26 .cse43 .cse10 .cse30 .cse17) (and .cse0 .cse10 .cse11 .cse14 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse9 .cse0 .cse10 .cse11 .cse16 .cse17 .cse34 .cse18 .cse26) (and .cse1 .cse0 .cse12 .cse13 .cse3 .cse4 .cse15 .cse7 .cse48) (and .cse0 .cse12 .cse13 .cse7 .cse36 .cse48)))) [2019-12-07 13:33:30,994 INFO L242 CegarLoopResult]: At program point L232(lines 225 260) the Hoare annotation is: (let ((.cse29 (= 2 ~s_run_pc~0)) (.cse39 (<= ~m_run_pc~0 0)) (.cse40 (= ~m_run_pc~0 3)) (.cse26 (= ~c_empty_rsp~0 1)) (.cse27 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse30 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (= ~a_t~0 0)) (.cse3 (<= 1 ~c_req_type~0)) (.cse18 (<= ~c_req_type~0 1)) (.cse28 (or (and .cse39 .cse27 .cse26) (and .cse40 .cse26 .cse27))) (.cse6 (<= 2 ~s_run_st~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse22 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse25 (not .cse29))) (let ((.cse5 (or (and .cse39 .cse25 .cse27 .cse26) (and .cse25 .cse40 .cse26 .cse27))) (.cse7 (= 0 ~s_run_pc~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse19 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse20 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse24 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_d~0 51)) (.cse13 (<= 51 ~c_req_d~0)) (.cse14 (let ((.cse31 (<= 0 ~a_t~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse33 (= ~s_memory0~0 50)) (.cse34 (<= ~c_req_a~0 1)) (.cse35 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse36 (<= 1 ~c_req_a~0)) (.cse37 (<= ULTIMATE.start_m_run_~req_a~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1))) (or (and .cse3 .cse31 .cse32 .cse18 .cse28 .cse33 .cse30 .cse34 .cse35 .cse36 .cse37 .cse6 .cse38 .cse21 .cse22 .cse23 .cse8 .cse29) (and .cse3 .cse31 .cse32 .cse18 .cse28 .cse33 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse34 .cse35 .cse36 .cse37 .cse6 .cse38 .cse21 .cse22 .cse8 .cse29)))) (.cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory1~0 51) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse1 .cse3 .cse4 .cse5 .cse18 .cse7 .cse19 .cse0 .cse20 .cse2 .cse21 .cse22 .cse23 .cse8 .cse24 .cse9 .cse10) (and .cse6 .cse25 (<= 2 ~s_run_pc~0) .cse26 .cse27) (and .cse17 .cse1 .cse3 .cse4 .cse18 .cse28 .cse19 .cse0 .cse20 .cse2 .cse6 .cse21 .cse22 .cse23 .cse8 .cse24 .cse29 .cse10 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16))))) [2019-12-07 13:33:30,995 INFO L246 CegarLoopResult]: For program point L100(lines 100 124) no Hoare annotation was computed. [2019-12-07 13:33:30,995 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1095) no Hoare annotation was computed. [2019-12-07 13:33:30,995 INFO L242 CegarLoopResult]: At program point L101(lines 96 838) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (not (= 2 ~s_run_pc~0)) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1)) [2019-12-07 13:33:31,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:33:31 BoogieIcfgContainer [2019-12-07 13:33:31,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:33:31,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:33:31,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:33:31,172 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:33:31,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:31:01" (3/4) ... [2019-12-07 13:33:31,174 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:33:31,192 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 13:33:31,193 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 13:33:31,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && 2 <= s_run_pc) && a_t == 0) && c_m_lock <= 0) && m_run_st == 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) [2019-12-07 13:33:31,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((c_req_d <= 50 && ((((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && a_t == 0) || (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && m_run_pc <= 0) && 0 == c_req_type) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((((((0 <= a_t && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 <= c_write_rsp_ev) && req_d <= 50) [2019-12-07 13:33:31,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) || ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev)) && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((((((((((((((((((0 <= a_t && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,215 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((v <= 51 && a == 1) && ((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a___0 + 50 == rsp_d___0) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || (((((((((v <= 51 && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && ((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a___0 + 50 == rsp_d___0) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) [2019-12-07 13:33:31,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) || ((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((0 <= a_t && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) [2019-12-07 13:33:31,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) || (((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && a <= 1) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && a <= 1) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) [2019-12-07 13:33:31,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) || ((((((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && a == 1) && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || (((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) [2019-12-07 13:33:31,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) || (((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((v <= 51 && (((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v) [2019-12-07 13:33:31,216 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) [2019-12-07 13:33:31,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((v <= 51 && s_memory1 == 51) && a_t == 0) && (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 <= v) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || (((((((((v <= 51 && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) [2019-12-07 13:33:31,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) [2019-12-07 13:33:31,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1) || ((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v)) || ((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) || ((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3))) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 0 <= a)) || ((((((((((((s_memory0 == req_d && 0 == req_a) && (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) || ((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3))) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) [2019-12-07 13:33:31,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) [2019-12-07 13:33:31,217 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) [2019-12-07 13:33:31,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((1 == req_a___0 && a == 1) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_req_a <= 1) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && a_t == 0) && 51 <= v) && (((((((a == 0 && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6))) && i <= 1) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && a == 0) && 0 == c_req_type) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && (((((((a == 0 && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6))) && req_a <= 1) && 0 == req_a___0)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((((1 == req_a___0 && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_req_a <= 1) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 51 <= v) && (((((((a == 0 && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6))) && i <= 1) [2019-12-07 13:33:31,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) || (((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) [2019-12-07 13:33:31,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && v <= 51) && c_empty_req == 1) && 0 < i) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) [2019-12-07 13:33:31,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v) [2019-12-07 13:33:31,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) [2019-12-07 13:33:31,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) [2019-12-07 13:33:31,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && 2 <= s_run_st) && a <= 1) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= s_run_st) && 0 < i) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc)) || ((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && 2 <= s_run_st) && a <= 1) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= s_run_st) && 0 < i) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v) [2019-12-07 13:33:31,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) [2019-12-07 13:33:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((a == 0 && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v) && ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && c_req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) || (((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1))) || (((((((((v <= 51 && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && c_req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) || (((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1))) && req_tt_a == 1) && 51 == rsp_d)) || ((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) [2019-12-07 13:33:31,295 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2b39463b-e1d5-49e2-957a-8f1c6a9021e7/bin/uautomizer/witness.graphml [2019-12-07 13:33:31,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:33:31,296 INFO L168 Benchmark]: Toolchain (without parser) took 150540.57 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 945.1 MB in the beginning and 1.5 GB in the end (delta: -592.4 MB). Peak memory consumption was 976.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:31,297 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:33:31,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:31,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:33:31,297 INFO L168 Benchmark]: Boogie Preprocessor took 30.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:31,297 INFO L168 Benchmark]: RCFGBuilder took 553.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.5 MB in the end (delta: 83.9 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:31,298 INFO L168 Benchmark]: TraceAbstraction took 149465.84 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 997.5 MB in the beginning and 1.6 GB in the end (delta: -586.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 13:33:31,298 INFO L168 Benchmark]: Witness Printer took 124.15 ms. Allocated memory is still 2.6 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:33:31,299 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 553.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.5 MB in the end (delta: 83.9 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149465.84 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 997.5 MB in the beginning and 1.6 GB in the end (delta: -586.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 124.15 ms. Allocated memory is still 2.6 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 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 - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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 5 specifications checked. All of them hold - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 914]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && req_d <= 51) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && a_t == 0) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((((((((((1 == req_a___0 && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) - InvariantResult [Line: 1082]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1) || ((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v)) || ((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) || ((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3))) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 0 <= a)) || ((((((((((((s_memory0 == req_d && 0 == req_a) && (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) || ((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3))) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) - InvariantResult [Line: 559]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) || (((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 1060]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v) - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: (((((((v <= 51 && s_memory1 == 51) && a_t == 0) && (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 <= v) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || (((((((((v <= 51 && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || (((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) || ((((((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && a == 1) && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && a == 1) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || (((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1258]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1266]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && req_d <= 51) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && a_t == 0) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) && 51 <= req_d) && 0 == req_a) && req_d <= 51) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((req_d <= 50 && a <= 0) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a)) || (((((((((((((((req_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_type <= 1) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((a <= 0 && c_empty_req == 1) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || (((((((((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51) - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: (((((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((1 == req_a___0 && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) - InvariantResult [Line: 685]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 930]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && req_d <= 51) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && a_t == 0) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((v <= 51 && a == 1) && ((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a___0 + 50 == rsp_d___0) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || (((((((((v <= 51 && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && ((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a___0 + 50 == rsp_d___0) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: (((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: ((((((((((((c_req_d <= 50 && ((((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_type <= 1) && 1 <= c_m_lock) && a_t == 0) || (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && m_run_pc <= 0) && 0 == c_req_type) && a_t == 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((((((0 <= a_t && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 575]: Loop Invariant Derived loop invariant: (((((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) || ((((((((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && 2 <= s_run_pc) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) || (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && c_req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && 2 <= s_run_pc) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev) || (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && c_req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 <= c_write_rsp_ev)) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 1346]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((v <= 51 && (((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 824]: Loop Invariant Derived loop invariant: ((((((a == 0 && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v) && ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && c_req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) || (((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1))) || (((((((((v <= 51 && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && c_req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) || (((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && req_a___0 + 50 == rsp_d___0) && c_empty_rsp == 1) && m_run_pc == 6) && 0 < i + 1) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1))) && req_tt_a == 1) && 51 == rsp_d)) || ((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 1274]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && req_a <= 0) && ((((m_run_pc <= 0 && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((!(2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 0 <= a) && 0 <= req_a) || ((((((((i == req_a && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 0 == req_a) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc))) && 51 <= req_d) && req_d <= 51)) || (((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && ((((m_run_pc <= 0 && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((!(2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_type <= 1) && 0 == s_run_pc) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 0 <= a) && 0 <= req_a)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) && 0 <= a)) || ((((((i == req_a && c_req_d <= 51) && 51 <= c_req_d) && ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 0 == req_a) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc))) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 1282]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) && i == req_a) && 51 <= req_d) && 0 == req_a) && req_d <= 51) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((req_d <= 50 && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((((((req_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((a <= 0 && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || (((((((((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51) - InvariantResult [Line: 759]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51) || ((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && a <= 1) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 51 <= req_d) && 0 == req_a) && req_d <= 51)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && a_t == 0) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 960]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && req_d <= 51) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && a_t == 0) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && req_d <= 51) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && a_t == 0) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && req_a <= 0) && ((((m_run_pc <= 0 && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((!(2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 0 <= a) && 0 <= req_a) || ((((((((i == req_a && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 0 == req_a) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc))) && 51 <= req_d) && req_d <= 51)) || (((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && ((((m_run_pc <= 0 && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((!(2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_type <= 1) && 0 == s_run_pc) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 0 <= a) && 0 <= req_a)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) && 0 <= a)) || ((((((i == req_a && c_req_d <= 51) && 51 <= c_req_d) && ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 0 == req_a) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc))) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 401]: Loop Invariant Derived loop invariant: ((((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((0 <= a_t && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 591]: Loop Invariant Derived loop invariant: ((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && 2 <= s_run_st) && a <= 1) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= s_run_st) && 0 < i) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc)) || ((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && 2 <= s_run_st) && a <= 1) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= s_run_st) && 0 < i) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) || ((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((0 <= a_t && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 1114]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && v <= 51) && c_empty_req == 1) && 0 < i) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) - InvariantResult [Line: 1312]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 1290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 723]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 775]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) || ((((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && req_type <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && ((((((c_empty_req == 1 && 0 == s_run_pc) && !(2 == s_run_pc)) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) || (((((((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1) - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: ((((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 1177]: Loop Invariant Derived loop invariant: (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) || (((((((((v <= 51 && rsp_d___0 == 51) && (((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((v <= 51 && (((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 < i) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1))) && s_memory1 == 51) && a_t == 0) && 51 <= v) - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: ((((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) || (((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && a <= 1) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && s_memory1 == 51) && a_t == 0) && 51 <= v)) || ((((((((((((((((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && 1 <= req_a) && req_a___0 <= 1) && req_a <= 1) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 < i) && a <= 1) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) || (((((((((((((((((((0 <= a_t && req_type == 0) && 1 <= req_a___0) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && req_a___0 <= 1) && c_empty_rsp == 1) && 1 <= a) && m_run_pc == 6) && 0 < i + 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && a_t == 0) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1)) && v <= 51) && rsp_d___0 == 51) && 51 == x) && 51 == c_rsp_d) && s_memory1 == 51) && 51 <= v) && 51 == \result) && req_tt_a == 1) && 51 == rsp_d)) || ((((((((((((((((((((0 <= a_t && s_memory0 == 50) && s_memory1 == req_d) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 1185]: Loop Invariant Derived loop invariant: (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && req_a <= 0) && ((((m_run_pc <= 0 && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((!(2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 0 <= a) && 0 <= req_a) || ((((((((i == req_a && c_req_d <= 51) && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 0 == req_a) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc))) && 51 <= req_d) && req_d <= 51)) || (((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && ((((m_run_pc <= 0 && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((!(2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_type <= 1) && 0 == s_run_pc) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 0 <= a) && 0 <= req_a)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) && 0 <= a)) || ((((((i == req_a && c_req_d <= 51) && 51 <= c_req_d) && ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 0 == req_a) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && 1 <= req_a) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && req_a <= 1) && 2 <= s_run_st) && a <= 1) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc))) && 51 <= req_d) && 0 == req_a) && req_d <= 51) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && req_a <= 0) && c_req_type <= 1) && 0 == s_run_pc) && !(2 == s_run_pc)) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((2 <= s_run_st && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && 0 == s_run_pc) && !(2 == s_run_pc)) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) - InvariantResult [Line: 1108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && a_t == 0) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a))) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 == req_a___0 && a == 1) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_req_a <= 1) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && a_t == 0) && 51 <= v) && (((((((a == 0 && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6))) && i <= 1) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && m_run_pc == 6) && 0 < i + 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev)) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && a == 0) && 0 == c_req_type) && s_memory0 == 50) && i == req_a) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && v == req_d) && (((((((a == 0 && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6))) && req_a <= 1) && 0 == req_a___0)) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || ((((((((((((1 == req_a___0 && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_req_a <= 1) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 51 <= v) && (((((((a == 0 && 0 <= a_t) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) && m_run_pc == 6))) && i <= 1) - InvariantResult [Line: 805]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && rsp_d___0 == 50) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 2 <= s_run_st) && 0 < i) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1036]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) || ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev)) && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) || ((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((((((((((((((((((0 <= a_t && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 < i + 1) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && 51 <= c_req_d) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 1193]: Loop Invariant Derived loop invariant: (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 1201]: Loop Invariant Derived loop invariant: (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && 2 <= s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && i == req_a) && a_t == 0) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) || (((((((((((0 == c_req_a && a == 0) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && 2 <= s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((0 == c_req_a && a == 0) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((req_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a) || ((((((((((((((((req_d <= 50 && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= req_type) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && a_t == 0) && req_type <= 1) && 1 <= req_type) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) && 51 <= req_d) && 0 == req_a) && req_d <= 51)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((c_req_d <= 51 && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && (((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= req_type) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && i == req_a) && a_t == 0) && req_type <= 1) && 1 <= req_type) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev))) && 51 <= c_req_d) && 51 <= req_d) && req_d <= 51)) || (((((((((((((a <= 0 && m_run_pc <= 0) && req_a <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 2 <= s_run_st) && 1 <= req_type) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && ((((((((((((1 <= c_req_a && 1 <= c_req_type) && 2 <= c_write_req_ev) && c_req_type <= 1) && s_memory0 == 50) && 1 <= c_m_lock) && m_run_pc == 3) && 2 == s_run_pc) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 2 <= c_write_rsp_ev) || ((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)))) || ((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && ((((((((((((1 <= c_req_a && 1 <= c_req_type) && 2 <= c_write_req_ev) && c_req_type <= 1) && s_memory0 == 50) && 1 <= c_m_lock) && m_run_pc == 3) && 2 == s_run_pc) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 2 <= c_write_rsp_ev) || ((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)))) || (((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((a <= 0 && c_empty_req == 1) && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) || ((((((((((((((((req_d <= 50 && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_d <= 51 && s_memory1 == req_d) && s_memory1 == 51) && v == req_d) && 51 <= c_req_d) && 51 <= req_d) && (((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev))) && req_d <= 51)) || (((((((((((((((((req_d <= 50 && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((51 <= req_d && 0 == req_a) && (((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((0 <= a_t && 1 <= req_a) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && req_a <= 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && a_t == 0) && 1 <= req_type) && 2 == s_run_pc) && 2 <= c_write_rsp_ev))) && req_d <= 51) - InvariantResult [Line: 1162]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) || ((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((51 <= req_d && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((c_req_d <= 51 && 51 <= c_req_d) && 0 == req_a) && (((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && !(2 == s_run_pc)) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((1 <= c_req_type && c_req_type <= 1) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1 - InvariantResult [Line: 1052]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && v <= 51) && 0 < i) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) || ((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == s_run_pc) && m_run_pc == 3))) && a == 0) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 50)) || ((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && req_d <= 50)) || ((((((((((((((((((((((0 <= a_t && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 < i + 1) && a == 0) && v <= 51) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 0 <= a) && i <= 1)) || ((((((((((((((((51 <= req_d && 0 <= a_t) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 0 <= a) - InvariantResult [Line: 1231]: Loop Invariant Derived loop invariant: (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 1209]: Loop Invariant Derived loop invariant: (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == 50) && req_d <= 51) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && c_empty_rsp == 1) && req_type <= 1) && 1 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && a_t == 0) && 1 <= c_m_lock) && req_type <= 1) && 50 <= req_d) && req_d <= 50)) || ((((((((((((((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 1114]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == req_d) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && a_t == 0) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((1 == req_a___0 && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 0 < i + 1) && v <= 51) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= v) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && i <= 1)) || (((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && 2 <= s_run_pc) && a_t == 0) && c_m_lock <= 0) && m_run_st == 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= c_write_req_ev) && a_t == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((0 <= a_t && 51 <= req_d) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((s_memory0 == req_d && m_run_pc == 3) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && a_t == 0) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((c_empty_req == 1 && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || ((((((((51 <= req_d && 0 <= a_t) && i == req_a) && c_req_d <= 51) && s_memory1 == req_d) && req_d <= 51) && v == req_d) && 51 <= c_req_d) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && v <= 51) && c_empty_req == 1) && 0 < i) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 1 == req_a___0) && 0 <= a_t) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 51 <= v) && 2 <= c_write_rsp_ev)) || (((((0 <= a_t && i == req_a) && c_req_d <= 51) && 51 <= c_req_d) && 0 == req_a) && (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)))) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && v <= 51) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a) && i <= 1) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 6) && 0 == req_a___0) && 0 < i + 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 51 <= v) && 2 <= c_write_rsp_ev) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 272 locations, 5 error locations. Result: SAFE, OverallTime: 21.4s, OverallIterations: 26, TraceHistogramMax: 8, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 127.7s, HoareTripleCheckerStatistics: 15623 SDtfs, 33394 SDslu, 48628 SDs, 0 SdLazy, 4571 SolverSat, 942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1712 GetRequests, 1385 SyntacticMatches, 9 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9409occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 65154 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1454 NumberOfFragments, 29210 HoareAnnotationTreeSize, 98 FomulaSimplifications, 531959636 FormulaSimplificationTreeSizeReduction, 23.6s HoareSimplificationTime, 98 FomulaSimplificationsInter, 52618504 FormulaSimplificationTreeSizeReductionInter, 104.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4830 NumberOfCodeBlocks, 4830 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4800 ConstructedInterpolants, 0 QuantifiedInterpolants, 4111986 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3638 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 1578/2791 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...