./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.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_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/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 94ba032acbdf60cd08371ca325fec24fa00e036a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:41:25,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:41:25,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:41:25,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:41:25,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:41:25,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:41:25,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:41:25,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:41:25,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:41:25,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:41:25,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:41:25,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:41:25,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:41:25,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:41:25,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:41:25,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:41:25,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:41:25,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:41:25,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:41:25,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:41:25,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:41:25,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:41:25,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:41:25,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:41:25,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:41:25,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:41:25,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:41:25,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:41:25,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:41:25,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:41:25,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:41:25,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:41:25,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:41:25,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:41:25,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:41:25,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:41:25,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:41:25,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:41:25,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:41:25,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:41:25,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:41:25,857 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:41:25,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:41:25,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:41:25,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:41:25,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:41:25,870 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:41:25,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:41:25,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:41:25,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:41:25,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:41:25,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:41:25,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:41:25,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:41:25,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:41:25,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:41:25,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:41:25,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:41:25,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:41:25,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:41:25,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:41:25,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:41:25,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:41:25,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:41:25,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:41:25,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:41:25,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:41:25,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:41:25,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:41:25,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:41:25,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:41:25,873 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_19803041-e84e-4455-a57f-d7a6f27cdf35/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 -> 94ba032acbdf60cd08371ca325fec24fa00e036a [2019-12-07 14:41:25,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:41:25,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:41:25,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:41:25,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:41:25,995 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:41:25,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2019-12-07 14:41:26,033 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/data/3721479fd/b9766d00da0b4adfae3f0c6863dc6d39/FLAGd6b98e82c [2019-12-07 14:41:26,547 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:41:26,547 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/sv-benchmarks/c/systemc/mem_slave_tlm.3.cil.c [2019-12-07 14:41:26,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/data/3721479fd/b9766d00da0b4adfae3f0c6863dc6d39/FLAGd6b98e82c [2019-12-07 14:41:27,017 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/data/3721479fd/b9766d00da0b4adfae3f0c6863dc6d39 [2019-12-07 14:41:27,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:41:27,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:41:27,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:41:27,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:41:27,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:41:27,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f60ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27, skipping insertion in model container [2019-12-07 14:41:27,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:41:27,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:41:27,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:41:27,261 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:41:27,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:41:27,318 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:41:27,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27 WrapperNode [2019-12-07 14:41:27,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:41:27,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:41:27,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:41:27,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:41:27,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:41:27,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:41:27,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:41:27,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:41:27,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... [2019-12-07 14:41:27,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:41:27,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:41:27,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:41:27,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:41:27,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/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 14:41:27,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:41:27,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:41:27,972 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:41:27,972 INFO L287 CfgBuilder]: Removed 39 assume(true) statements. [2019-12-07 14:41:27,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:27 BoogieIcfgContainer [2019-12-07 14:41:27,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:41:27,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:41:27,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:41:27,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:41:27,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:41:27" (1/3) ... [2019-12-07 14:41:27,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210992b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:41:27, skipping insertion in model container [2019-12-07 14:41:27,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:27" (2/3) ... [2019-12-07 14:41:27,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210992b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:41:27, skipping insertion in model container [2019-12-07 14:41:27,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:27" (3/3) ... [2019-12-07 14:41:27,981 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.3.cil.c [2019-12-07 14:41:27,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:41:27,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-12-07 14:41:28,003 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:41:28,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:41:28,023 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:41:28,023 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:41:28,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:41:28,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:41:28,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:41:28,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:41:28,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:41:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states. [2019-12-07 14:41:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:41:28,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:28,053 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 14:41:28,053 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 14:41:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2019-12-07 14:41:28,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:28,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587178858] [2019-12-07 14:41:28,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:28,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587178858] [2019-12-07 14:41:28,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:28,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:28,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955913522] [2019-12-07 14:41:28,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:28,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,205 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 3 states. [2019-12-07 14:41:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:28,441 INFO L93 Difference]: Finished difference Result 731 states and 1328 transitions. [2019-12-07 14:41:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:28,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 14:41:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:28,454 INFO L225 Difference]: With dead ends: 731 [2019-12-07 14:41:28,454 INFO L226 Difference]: Without dead ends: 454 [2019-12-07 14:41:28,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-12-07 14:41:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 438. [2019-12-07 14:41:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-07 14:41:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 689 transitions. [2019-12-07 14:41:28,512 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 689 transitions. Word has length 28 [2019-12-07 14:41:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:28,512 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 689 transitions. [2019-12-07 14:41:28,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 689 transitions. [2019-12-07 14:41:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:41:28,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:28,514 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 14:41:28,515 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 14:41:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash -588620623, now seen corresponding path program 1 times [2019-12-07 14:41:28,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:28,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988102891] [2019-12-07 14:41:28,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:28,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988102891] [2019-12-07 14:41:28,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:28,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:28,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157420066] [2019-12-07 14:41:28,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:28,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:28,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:28,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,563 INFO L87 Difference]: Start difference. First operand 438 states and 689 transitions. Second operand 3 states. [2019-12-07 14:41:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:28,666 INFO L93 Difference]: Finished difference Result 1147 states and 1829 transitions. [2019-12-07 14:41:28,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:28,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 14:41:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:28,670 INFO L225 Difference]: With dead ends: 1147 [2019-12-07 14:41:28,670 INFO L226 Difference]: Without dead ends: 723 [2019-12-07 14:41:28,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-07 14:41:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 707. [2019-12-07 14:41:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-07 14:41:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1144 transitions. [2019-12-07 14:41:28,704 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1144 transitions. Word has length 38 [2019-12-07 14:41:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:28,704 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1144 transitions. [2019-12-07 14:41:28,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1144 transitions. [2019-12-07 14:41:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:41:28,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:28,707 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] [2019-12-07 14:41:28,707 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 14:41:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1580788038, now seen corresponding path program 1 times [2019-12-07 14:41:28,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:28,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645138788] [2019-12-07 14:41:28,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:28,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645138788] [2019-12-07 14:41:28,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:28,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:28,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705673113] [2019-12-07 14:41:28,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:28,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,752 INFO L87 Difference]: Start difference. First operand 707 states and 1144 transitions. Second operand 3 states. [2019-12-07 14:41:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:28,806 INFO L93 Difference]: Finished difference Result 1781 states and 2881 transitions. [2019-12-07 14:41:28,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:28,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 14:41:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:28,814 INFO L225 Difference]: With dead ends: 1781 [2019-12-07 14:41:28,814 INFO L226 Difference]: Without dead ends: 1099 [2019-12-07 14:41:28,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-12-07 14:41:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1087. [2019-12-07 14:41:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-12-07 14:41:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1754 transitions. [2019-12-07 14:41:28,853 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1754 transitions. Word has length 39 [2019-12-07 14:41:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:28,853 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 1754 transitions. [2019-12-07 14:41:28,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1754 transitions. [2019-12-07 14:41:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:41:28,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:28,855 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 14:41:28,855 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 14:41:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:28,856 INFO L82 PathProgramCache]: Analyzing trace with hash -568355804, now seen corresponding path program 1 times [2019-12-07 14:41:28,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:28,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948934559] [2019-12-07 14:41:28,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:28,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948934559] [2019-12-07 14:41:28,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:28,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:28,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133932281] [2019-12-07 14:41:28,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:28,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,898 INFO L87 Difference]: Start difference. First operand 1087 states and 1754 transitions. Second operand 3 states. [2019-12-07 14:41:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:28,952 INFO L93 Difference]: Finished difference Result 2909 states and 4694 transitions. [2019-12-07 14:41:28,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:28,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 14:41:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:28,960 INFO L225 Difference]: With dead ends: 2909 [2019-12-07 14:41:28,960 INFO L226 Difference]: Without dead ends: 1847 [2019-12-07 14:41:28,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-12-07 14:41:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1701. [2019-12-07 14:41:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2019-12-07 14:41:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2708 transitions. [2019-12-07 14:41:29,003 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2708 transitions. Word has length 46 [2019-12-07 14:41:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:29,004 INFO L462 AbstractCegarLoop]: Abstraction has 1701 states and 2708 transitions. [2019-12-07 14:41:29,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2708 transitions. [2019-12-07 14:41:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:41:29,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:29,005 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 14:41:29,005 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 14:41:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-12-07 14:41:29,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:29,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549148318] [2019-12-07 14:41:29,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:29,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549148318] [2019-12-07 14:41:29,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:29,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:29,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782531082] [2019-12-07 14:41:29,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:29,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:29,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:29,036 INFO L87 Difference]: Start difference. First operand 1701 states and 2708 transitions. Second operand 3 states. [2019-12-07 14:41:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:29,160 INFO L93 Difference]: Finished difference Result 4749 states and 7540 transitions. [2019-12-07 14:41:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:29,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 14:41:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:29,173 INFO L225 Difference]: With dead ends: 4749 [2019-12-07 14:41:29,173 INFO L226 Difference]: Without dead ends: 3067 [2019-12-07 14:41:29,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2019-12-07 14:41:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3001. [2019-12-07 14:41:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3001 states. [2019-12-07 14:41:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4703 transitions. [2019-12-07 14:41:29,251 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4703 transitions. Word has length 52 [2019-12-07 14:41:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:29,251 INFO L462 AbstractCegarLoop]: Abstraction has 3001 states and 4703 transitions. [2019-12-07 14:41:29,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4703 transitions. [2019-12-07 14:41:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:41:29,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:29,252 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 14:41:29,252 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 14:41:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-12-07 14:41:29,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:29,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707054274] [2019-12-07 14:41:29,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:29,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 14:41:29,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707054274] [2019-12-07 14:41:29,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:29,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:29,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098840979] [2019-12-07 14:41:29,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:29,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:29,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:29,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:29,287 INFO L87 Difference]: Start difference. First operand 3001 states and 4703 transitions. Second operand 3 states. [2019-12-07 14:41:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:29,396 INFO L93 Difference]: Finished difference Result 7063 states and 11022 transitions. [2019-12-07 14:41:29,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:29,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 14:41:29,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:29,412 INFO L225 Difference]: With dead ends: 7063 [2019-12-07 14:41:29,412 INFO L226 Difference]: Without dead ends: 4085 [2019-12-07 14:41:29,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2019-12-07 14:41:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3901. [2019-12-07 14:41:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2019-12-07 14:41:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 6033 transitions. [2019-12-07 14:41:29,517 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 6033 transitions. Word has length 52 [2019-12-07 14:41:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:29,518 INFO L462 AbstractCegarLoop]: Abstraction has 3901 states and 6033 transitions. [2019-12-07 14:41:29,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6033 transitions. [2019-12-07 14:41:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 14:41:29,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:29,520 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] [2019-12-07 14:41:29,520 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 14:41:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1900061236, now seen corresponding path program 1 times [2019-12-07 14:41:29,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:29,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429526342] [2019-12-07 14:41:29,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:29,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429526342] [2019-12-07 14:41:29,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:29,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:29,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606415375] [2019-12-07 14:41:29,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:29,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:29,566 INFO L87 Difference]: Start difference. First operand 3901 states and 6033 transitions. Second operand 3 states. [2019-12-07 14:41:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:29,892 INFO L93 Difference]: Finished difference Result 9389 states and 14610 transitions. [2019-12-07 14:41:29,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:29,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 14:41:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:29,914 INFO L225 Difference]: With dead ends: 9389 [2019-12-07 14:41:29,915 INFO L226 Difference]: Without dead ends: 5511 [2019-12-07 14:41:29,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2019-12-07 14:41:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5421. [2019-12-07 14:41:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-07 14:41:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 8297 transitions. [2019-12-07 14:41:30,063 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 8297 transitions. Word has length 58 [2019-12-07 14:41:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:30,063 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 8297 transitions. [2019-12-07 14:41:30,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 8297 transitions. [2019-12-07 14:41:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 14:41:30,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:30,065 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 14:41:30,065 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 14:41:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1776656032, now seen corresponding path program 1 times [2019-12-07 14:41:30,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:30,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533488328] [2019-12-07 14:41:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:30,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533488328] [2019-12-07 14:41:30,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:30,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:30,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905202175] [2019-12-07 14:41:30,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:30,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:30,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:30,092 INFO L87 Difference]: Start difference. First operand 5421 states and 8297 transitions. Second operand 3 states. [2019-12-07 14:41:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:30,234 INFO L93 Difference]: Finished difference Result 10819 states and 16564 transitions. [2019-12-07 14:41:30,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:30,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-07 14:41:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:30,255 INFO L225 Difference]: With dead ends: 10819 [2019-12-07 14:41:30,255 INFO L226 Difference]: Without dead ends: 5421 [2019-12-07 14:41:30,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2019-12-07 14:41:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5421. [2019-12-07 14:41:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-07 14:41:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 8161 transitions. [2019-12-07 14:41:30,436 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 8161 transitions. Word has length 60 [2019-12-07 14:41:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:30,437 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 8161 transitions. [2019-12-07 14:41:30,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 8161 transitions. [2019-12-07 14:41:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 14:41:30,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:30,438 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] [2019-12-07 14:41:30,438 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 14:41:30,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash 64035235, now seen corresponding path program 1 times [2019-12-07 14:41:30,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:30,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045111355] [2019-12-07 14:41:30,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:30,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045111355] [2019-12-07 14:41:30,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:30,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:30,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047008551] [2019-12-07 14:41:30,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:30,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:30,463 INFO L87 Difference]: Start difference. First operand 5421 states and 8161 transitions. Second operand 3 states. [2019-12-07 14:41:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:30,740 INFO L93 Difference]: Finished difference Result 12227 states and 18448 transitions. [2019-12-07 14:41:30,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:30,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-07 14:41:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:30,761 INFO L225 Difference]: With dead ends: 12227 [2019-12-07 14:41:30,762 INFO L226 Difference]: Without dead ends: 6829 [2019-12-07 14:41:30,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2019-12-07 14:41:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 6075. [2019-12-07 14:41:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2019-12-07 14:41:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 8971 transitions. [2019-12-07 14:41:30,893 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 8971 transitions. Word has length 61 [2019-12-07 14:41:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:30,894 INFO L462 AbstractCegarLoop]: Abstraction has 6075 states and 8971 transitions. [2019-12-07 14:41:30,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 8971 transitions. [2019-12-07 14:41:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 14:41:30,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:30,895 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 14:41:30,896 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 14:41:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2137011, now seen corresponding path program 1 times [2019-12-07 14:41:30,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:30,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426361598] [2019-12-07 14:41:30,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:30,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426361598] [2019-12-07 14:41:30,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:30,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:41:30,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950810628] [2019-12-07 14:41:30,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:41:30,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:30,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:41:30,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:41:30,930 INFO L87 Difference]: Start difference. First operand 6075 states and 8971 transitions. Second operand 5 states. [2019-12-07 14:41:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:31,457 INFO L93 Difference]: Finished difference Result 31527 states and 46500 transitions. [2019-12-07 14:41:31,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:41:31,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 14:41:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:31,504 INFO L225 Difference]: With dead ends: 31527 [2019-12-07 14:41:31,504 INFO L226 Difference]: Without dead ends: 25475 [2019-12-07 14:41:31,516 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 14:41:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25475 states. [2019-12-07 14:41:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25475 to 8423. [2019-12-07 14:41:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8423 states. [2019-12-07 14:41:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12424 transitions. [2019-12-07 14:41:31,849 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12424 transitions. Word has length 63 [2019-12-07 14:41:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:31,849 INFO L462 AbstractCegarLoop]: Abstraction has 8423 states and 12424 transitions. [2019-12-07 14:41:31,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:41:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12424 transitions. [2019-12-07 14:41:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 14:41:31,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:31,852 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, 1] [2019-12-07 14:41:31,852 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 14:41:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash 803926384, now seen corresponding path program 1 times [2019-12-07 14:41:31,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:31,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775393666] [2019-12-07 14:41:31,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:31,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775393666] [2019-12-07 14:41:31,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:31,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:41:31,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776137361] [2019-12-07 14:41:31,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:41:31,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:31,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:41:31,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:41:31,929 INFO L87 Difference]: Start difference. First operand 8423 states and 12424 transitions. Second operand 7 states. [2019-12-07 14:41:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:33,170 INFO L93 Difference]: Finished difference Result 41619 states and 61265 transitions. [2019-12-07 14:41:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:41:33,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-07 14:41:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:33,203 INFO L225 Difference]: With dead ends: 41619 [2019-12-07 14:41:33,203 INFO L226 Difference]: Without dead ends: 33219 [2019-12-07 14:41:33,214 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 14:41:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33219 states. [2019-12-07 14:41:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33219 to 5593. [2019-12-07 14:41:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5593 states. [2019-12-07 14:41:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 8137 transitions. [2019-12-07 14:41:33,615 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 8137 transitions. Word has length 64 [2019-12-07 14:41:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:33,616 INFO L462 AbstractCegarLoop]: Abstraction has 5593 states and 8137 transitions. [2019-12-07 14:41:33,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:41:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 8137 transitions. [2019-12-07 14:41:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 14:41:33,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:33,617 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 14:41:33,617 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 14:41:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash -642302294, now seen corresponding path program 1 times [2019-12-07 14:41:33,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:33,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059909372] [2019-12-07 14:41:33,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:33,639 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 14:41:33,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059909372] [2019-12-07 14:41:33,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:33,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:33,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417283383] [2019-12-07 14:41:33,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:33,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:33,640 INFO L87 Difference]: Start difference. First operand 5593 states and 8137 transitions. Second operand 3 states. [2019-12-07 14:41:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:33,891 INFO L93 Difference]: Finished difference Result 11802 states and 17131 transitions. [2019-12-07 14:41:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:33,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-12-07 14:41:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:33,897 INFO L225 Difference]: With dead ends: 11802 [2019-12-07 14:41:33,897 INFO L226 Difference]: Without dead ends: 6230 [2019-12-07 14:41:33,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2019-12-07 14:41:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 6138. [2019-12-07 14:41:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6138 states. [2019-12-07 14:41:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 8897 transitions. [2019-12-07 14:41:34,106 INFO L78 Accepts]: Start accepts. Automaton has 6138 states and 8897 transitions. Word has length 77 [2019-12-07 14:41:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:34,107 INFO L462 AbstractCegarLoop]: Abstraction has 6138 states and 8897 transitions. [2019-12-07 14:41:34,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6138 states and 8897 transitions. [2019-12-07 14:41:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 14:41:34,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:34,108 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 14:41:34,108 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 14:41:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1395734083, now seen corresponding path program 1 times [2019-12-07 14:41:34,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:34,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078457452] [2019-12-07 14:41:34,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:34,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078457452] [2019-12-07 14:41:34,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:34,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:34,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334439893] [2019-12-07 14:41:34,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:34,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:34,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:34,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:34,128 INFO L87 Difference]: Start difference. First operand 6138 states and 8897 transitions. Second operand 3 states. [2019-12-07 14:41:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:34,506 INFO L93 Difference]: Finished difference Result 15750 states and 22694 transitions. [2019-12-07 14:41:34,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:34,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-12-07 14:41:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:34,514 INFO L225 Difference]: With dead ends: 15750 [2019-12-07 14:41:34,514 INFO L226 Difference]: Without dead ends: 9501 [2019-12-07 14:41:34,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9501 states. [2019-12-07 14:41:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9501 to 9473. [2019-12-07 14:41:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2019-12-07 14:41:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 13515 transitions. [2019-12-07 14:41:34,837 INFO L78 Accepts]: Start accepts. Automaton has 9473 states and 13515 transitions. Word has length 88 [2019-12-07 14:41:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:34,838 INFO L462 AbstractCegarLoop]: Abstraction has 9473 states and 13515 transitions. [2019-12-07 14:41:34,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 9473 states and 13515 transitions. [2019-12-07 14:41:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:41:34,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:34,839 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 14:41:34,840 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 14:41:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash 254242823, now seen corresponding path program 1 times [2019-12-07 14:41:34,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:34,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389359537] [2019-12-07 14:41:34,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:34,863 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 14:41:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389359537] [2019-12-07 14:41:34,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:34,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:34,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848697331] [2019-12-07 14:41:34,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:34,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:34,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:34,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:34,865 INFO L87 Difference]: Start difference. First operand 9473 states and 13515 transitions. Second operand 3 states. [2019-12-07 14:41:35,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:35,184 INFO L93 Difference]: Finished difference Result 17390 states and 24716 transitions. [2019-12-07 14:41:35,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:35,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 14:41:35,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:35,190 INFO L225 Difference]: With dead ends: 17390 [2019-12-07 14:41:35,190 INFO L226 Difference]: Without dead ends: 6954 [2019-12-07 14:41:35,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6954 states. [2019-12-07 14:41:35,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6954 to 6541. [2019-12-07 14:41:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6541 states. [2019-12-07 14:41:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 8897 transitions. [2019-12-07 14:41:35,540 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 8897 transitions. Word has length 95 [2019-12-07 14:41:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:35,540 INFO L462 AbstractCegarLoop]: Abstraction has 6541 states and 8897 transitions. [2019-12-07 14:41:35,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 8897 transitions. [2019-12-07 14:41:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:41:35,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:35,542 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 14:41:35,542 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 14:41:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1408787564, now seen corresponding path program 1 times [2019-12-07 14:41:35,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:35,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622230931] [2019-12-07 14:41:35,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:35,565 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 14:41:35,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622230931] [2019-12-07 14:41:35,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:35,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:35,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447090891] [2019-12-07 14:41:35,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:35,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:35,566 INFO L87 Difference]: Start difference. First operand 6541 states and 8897 transitions. Second operand 3 states. [2019-12-07 14:41:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:35,739 INFO L93 Difference]: Finished difference Result 10570 states and 14444 transitions. [2019-12-07 14:41:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:35,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 14:41:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:35,742 INFO L225 Difference]: With dead ends: 10570 [2019-12-07 14:41:35,742 INFO L226 Difference]: Without dead ends: 4143 [2019-12-07 14:41:35,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2019-12-07 14:41:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4125. [2019-12-07 14:41:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2019-12-07 14:41:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5490 transitions. [2019-12-07 14:41:35,890 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5490 transitions. Word has length 98 [2019-12-07 14:41:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:35,890 INFO L462 AbstractCegarLoop]: Abstraction has 4125 states and 5490 transitions. [2019-12-07 14:41:35,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5490 transitions. [2019-12-07 14:41:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:41:35,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:35,891 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 14:41:35,891 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 14:41:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1416682179, now seen corresponding path program 1 times [2019-12-07 14:41:35,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:35,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451743660] [2019-12-07 14:41:35,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:35,924 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 14:41:35,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451743660] [2019-12-07 14:41:35,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:35,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:35,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767365140] [2019-12-07 14:41:35,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:35,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:35,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:35,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:35,926 INFO L87 Difference]: Start difference. First operand 4125 states and 5490 transitions. Second operand 3 states. [2019-12-07 14:41:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:36,082 INFO L93 Difference]: Finished difference Result 7312 states and 9768 transitions. [2019-12-07 14:41:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:36,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 14:41:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:36,085 INFO L225 Difference]: With dead ends: 7312 [2019-12-07 14:41:36,085 INFO L226 Difference]: Without dead ends: 3262 [2019-12-07 14:41:36,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-12-07 14:41:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2960. [2019-12-07 14:41:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2960 states. [2019-12-07 14:41:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2960 states and 3855 transitions. [2019-12-07 14:41:36,202 INFO L78 Accepts]: Start accepts. Automaton has 2960 states and 3855 transitions. Word has length 98 [2019-12-07 14:41:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:36,202 INFO L462 AbstractCegarLoop]: Abstraction has 2960 states and 3855 transitions. [2019-12-07 14:41:36,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2960 states and 3855 transitions. [2019-12-07 14:41:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:41:36,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:36,203 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 14:41:36,203 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 14:41:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash -965689605, now seen corresponding path program 1 times [2019-12-07 14:41:36,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:36,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407055951] [2019-12-07 14:41:36,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:36,227 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 14:41:36,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407055951] [2019-12-07 14:41:36,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:36,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:36,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41574418] [2019-12-07 14:41:36,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:36,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:36,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:36,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:36,229 INFO L87 Difference]: Start difference. First operand 2960 states and 3855 transitions. Second operand 3 states. [2019-12-07 14:41:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:36,364 INFO L93 Difference]: Finished difference Result 3286 states and 4247 transitions. [2019-12-07 14:41:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:36,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 14:41:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:36,366 INFO L225 Difference]: With dead ends: 3286 [2019-12-07 14:41:36,366 INFO L226 Difference]: Without dead ends: 3282 [2019-12-07 14:41:36,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-12-07 14:41:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3257. [2019-12-07 14:41:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2019-12-07 14:41:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 4200 transitions. [2019-12-07 14:41:36,537 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 4200 transitions. Word has length 99 [2019-12-07 14:41:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:36,538 INFO L462 AbstractCegarLoop]: Abstraction has 3257 states and 4200 transitions. [2019-12-07 14:41:36,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 4200 transitions. [2019-12-07 14:41:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 14:41:36,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:36,539 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, 1] [2019-12-07 14:41:36,539 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 14:41:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash -488246995, now seen corresponding path program 1 times [2019-12-07 14:41:36,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:36,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161851492] [2019-12-07 14:41:36,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:36,622 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 14:41:36,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161851492] [2019-12-07 14:41:36,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:36,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:41:36,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295460999] [2019-12-07 14:41:36,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:41:36,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:41:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:41:36,623 INFO L87 Difference]: Start difference. First operand 3257 states and 4200 transitions. Second operand 5 states. [2019-12-07 14:41:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:37,156 INFO L93 Difference]: Finished difference Result 12108 states and 15680 transitions. [2019-12-07 14:41:37,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:41:37,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-12-07 14:41:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:37,162 INFO L225 Difference]: With dead ends: 12108 [2019-12-07 14:41:37,162 INFO L226 Difference]: Without dead ends: 9043 [2019-12-07 14:41:37,165 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 14:41:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9043 states. [2019-12-07 14:41:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9043 to 3259. [2019-12-07 14:41:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3259 states. [2019-12-07 14:41:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 4194 transitions. [2019-12-07 14:41:37,330 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 4194 transitions. Word has length 158 [2019-12-07 14:41:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:37,330 INFO L462 AbstractCegarLoop]: Abstraction has 3259 states and 4194 transitions. [2019-12-07 14:41:37,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:41:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 4194 transitions. [2019-12-07 14:41:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 14:41:37,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:37,332 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, 1] [2019-12-07 14:41:37,332 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 14:41:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1660079688, now seen corresponding path program 1 times [2019-12-07 14:41:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:37,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316880862] [2019-12-07 14:41:37,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:37,446 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 14:41:37,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316880862] [2019-12-07 14:41:37,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513521616] [2019-12-07 14:41:37,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/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 14:41:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:37,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 14:41:37,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:37,583 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 14:41:37,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:37,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-12-07 14:41:37,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213554294] [2019-12-07 14:41:37,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:41:37,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:37,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:41:37,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:41:37,584 INFO L87 Difference]: Start difference. First operand 3259 states and 4194 transitions. Second operand 9 states. [2019-12-07 14:41:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:39,159 INFO L93 Difference]: Finished difference Result 17481 states and 22705 transitions. [2019-12-07 14:41:39,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 14:41:39,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-12-07 14:41:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:39,189 INFO L225 Difference]: With dead ends: 17481 [2019-12-07 14:41:39,189 INFO L226 Difference]: Without dead ends: 14436 [2019-12-07 14:41:39,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 14:41:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14436 states. [2019-12-07 14:41:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14436 to 4893. [2019-12-07 14:41:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4893 states. [2019-12-07 14:41:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4893 states to 4893 states and 6364 transitions. [2019-12-07 14:41:39,530 INFO L78 Accepts]: Start accepts. Automaton has 4893 states and 6364 transitions. Word has length 160 [2019-12-07 14:41:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:39,530 INFO L462 AbstractCegarLoop]: Abstraction has 4893 states and 6364 transitions. [2019-12-07 14:41:39,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:41:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4893 states and 6364 transitions. [2019-12-07 14:41:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-12-07 14:41:39,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:39,533 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 14:41:39,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:39,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 14:41:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash 975904749, now seen corresponding path program 1 times [2019-12-07 14:41:39,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:39,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938129551] [2019-12-07 14:41:39,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:41:40,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938129551] [2019-12-07 14:41:40,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697636450] [2019-12-07 14:41:40,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/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 14:41:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:40,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 14:41:40,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 14:41:40,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:40,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-12-07 14:41:40,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249447382] [2019-12-07 14:41:40,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:41:40,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:40,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:41:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:41:40,227 INFO L87 Difference]: Start difference. First operand 4893 states and 6364 transitions. Second operand 11 states. [2019-12-07 14:41:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:42,135 INFO L93 Difference]: Finished difference Result 22829 states and 29640 transitions. [2019-12-07 14:41:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 14:41:42,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2019-12-07 14:41:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:42,149 INFO L225 Difference]: With dead ends: 22829 [2019-12-07 14:41:42,149 INFO L226 Difference]: Without dead ends: 18150 [2019-12-07 14:41:42,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 14:41:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18150 states. [2019-12-07 14:41:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18150 to 6358. [2019-12-07 14:41:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6358 states. [2019-12-07 14:41:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 8288 transitions. [2019-12-07 14:41:42,608 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 8288 transitions. Word has length 258 [2019-12-07 14:41:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:42,609 INFO L462 AbstractCegarLoop]: Abstraction has 6358 states and 8288 transitions. [2019-12-07 14:41:42,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:41:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 8288 transitions. [2019-12-07 14:41:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-12-07 14:41:42,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:42,611 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:41:42,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:42,813 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 14:41:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1870192825, now seen corresponding path program 1 times [2019-12-07 14:41:42,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:42,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9820571] [2019-12-07 14:41:42,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 14:41:43,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9820571] [2019-12-07 14:41:43,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:43,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:41:43,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645884107] [2019-12-07 14:41:43,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:41:43,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:41:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:41:43,039 INFO L87 Difference]: Start difference. First operand 6358 states and 8288 transitions. Second operand 9 states. [2019-12-07 14:41:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:43,866 INFO L93 Difference]: Finished difference Result 14100 states and 18349 transitions. [2019-12-07 14:41:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:41:43,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 357 [2019-12-07 14:41:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:43,873 INFO L225 Difference]: With dead ends: 14100 [2019-12-07 14:41:43,873 INFO L226 Difference]: Without dead ends: 7950 [2019-12-07 14:41:43,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:41:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7950 states. [2019-12-07 14:41:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7950 to 6204. [2019-12-07 14:41:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2019-12-07 14:41:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 8082 transitions. [2019-12-07 14:41:44,279 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 8082 transitions. Word has length 357 [2019-12-07 14:41:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:44,280 INFO L462 AbstractCegarLoop]: Abstraction has 6204 states and 8082 transitions. [2019-12-07 14:41:44,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:41:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 8082 transitions. [2019-12-07 14:41:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-12-07 14:41:44,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:44,282 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:41:44,282 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 14:41:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash -228519270, now seen corresponding path program 1 times [2019-12-07 14:41:44,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:44,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968904942] [2019-12-07 14:41:44,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-12-07 14:41:44,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968904942] [2019-12-07 14:41:44,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:44,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:44,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468703330] [2019-12-07 14:41:44,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:44,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:44,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:44,377 INFO L87 Difference]: Start difference. First operand 6204 states and 8082 transitions. Second operand 3 states. [2019-12-07 14:41:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:45,017 INFO L93 Difference]: Finished difference Result 13947 states and 18249 transitions. [2019-12-07 14:41:45,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:45,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-12-07 14:41:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:45,023 INFO L225 Difference]: With dead ends: 13947 [2019-12-07 14:41:45,024 INFO L226 Difference]: Without dead ends: 7957 [2019-12-07 14:41:45,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-07 14:41:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 7656. [2019-12-07 14:41:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2019-12-07 14:41:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 9757 transitions. [2019-12-07 14:41:45,547 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 9757 transitions. Word has length 357 [2019-12-07 14:41:45,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:45,548 INFO L462 AbstractCegarLoop]: Abstraction has 7656 states and 9757 transitions. [2019-12-07 14:41:45,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 9757 transitions. [2019-12-07 14:41:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-12-07 14:41:45,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:45,550 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:41:45,550 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 14:41:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1050472350, now seen corresponding path program 1 times [2019-12-07 14:41:45,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:45,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260914288] [2019-12-07 14:41:45,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-12-07 14:41:45,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260914288] [2019-12-07 14:41:45,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:45,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:45,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5189841] [2019-12-07 14:41:45,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:45,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:45,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:45,634 INFO L87 Difference]: Start difference. First operand 7656 states and 9757 transitions. Second operand 3 states. [2019-12-07 14:41:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:45,831 INFO L93 Difference]: Finished difference Result 8987 states and 11270 transitions. [2019-12-07 14:41:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:45,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2019-12-07 14:41:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:45,833 INFO L225 Difference]: With dead ends: 8987 [2019-12-07 14:41:45,833 INFO L226 Difference]: Without dead ends: 1431 [2019-12-07 14:41:45,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-07 14:41:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1428. [2019-12-07 14:41:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 14:41:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1578 transitions. [2019-12-07 14:41:45,928 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1578 transitions. Word has length 358 [2019-12-07 14:41:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:45,928 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1578 transitions. [2019-12-07 14:41:45,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1578 transitions. [2019-12-07 14:41:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-12-07 14:41:45,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:45,930 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:41:45,931 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 14:41:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash -719470612, now seen corresponding path program 1 times [2019-12-07 14:41:45,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:45,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720137317] [2019-12-07 14:41:45,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-12-07 14:41:46,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720137317] [2019-12-07 14:41:46,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:46,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:41:46,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596967975] [2019-12-07 14:41:46,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:41:46,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:41:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:41:46,047 INFO L87 Difference]: Start difference. First operand 1428 states and 1578 transitions. Second operand 7 states. [2019-12-07 14:41:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:46,317 INFO L93 Difference]: Finished difference Result 2901 states and 3211 transitions. [2019-12-07 14:41:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:41:46,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 359 [2019-12-07 14:41:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:46,319 INFO L225 Difference]: With dead ends: 2901 [2019-12-07 14:41:46,319 INFO L226 Difference]: Without dead ends: 2369 [2019-12-07 14:41:46,320 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 14:41:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-07 14:41:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1424. [2019-12-07 14:41:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-12-07 14:41:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1568 transitions. [2019-12-07 14:41:46,416 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1568 transitions. Word has length 359 [2019-12-07 14:41:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:46,417 INFO L462 AbstractCegarLoop]: Abstraction has 1424 states and 1568 transitions. [2019-12-07 14:41:46,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:41:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1568 transitions. [2019-12-07 14:41:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-12-07 14:41:46,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:46,419 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:41:46,419 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 14:41:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash -91073449, now seen corresponding path program 1 times [2019-12-07 14:41:46,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:46,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801291242] [2019-12-07 14:41:46,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-12-07 14:41:46,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801291242] [2019-12-07 14:41:46,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:46,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:41:46,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099773668] [2019-12-07 14:41:46,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:41:46,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:41:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:41:46,513 INFO L87 Difference]: Start difference. First operand 1424 states and 1568 transitions. Second operand 5 states. [2019-12-07 14:41:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:46,677 INFO L93 Difference]: Finished difference Result 2338 states and 2584 transitions. [2019-12-07 14:41:46,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:41:46,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 360 [2019-12-07 14:41:46,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:46,679 INFO L225 Difference]: With dead ends: 2338 [2019-12-07 14:41:46,679 INFO L226 Difference]: Without dead ends: 1804 [2019-12-07 14:41:46,680 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 14:41:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-07 14:41:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1392. [2019-12-07 14:41:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-12-07 14:41:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1507 transitions. [2019-12-07 14:41:46,778 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1507 transitions. Word has length 360 [2019-12-07 14:41:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:46,778 INFO L462 AbstractCegarLoop]: Abstraction has 1392 states and 1507 transitions. [2019-12-07 14:41:46,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:41:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1507 transitions. [2019-12-07 14:41:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-12-07 14:41:46,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:46,780 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:41:46,780 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 14:41:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash -527435852, now seen corresponding path program 1 times [2019-12-07 14:41:46,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:46,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26152586] [2019-12-07 14:41:46,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-12-07 14:41:46,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26152586] [2019-12-07 14:41:46,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:46,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:41:46,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034977366] [2019-12-07 14:41:46,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:46,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:46,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:46,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:46,882 INFO L87 Difference]: Start difference. First operand 1392 states and 1507 transitions. Second operand 3 states. [2019-12-07 14:41:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:46,982 INFO L93 Difference]: Finished difference Result 2295 states and 2483 transitions. [2019-12-07 14:41:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:46,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-12-07 14:41:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:46,984 INFO L225 Difference]: With dead ends: 2295 [2019-12-07 14:41:46,984 INFO L226 Difference]: Without dead ends: 1217 [2019-12-07 14:41:46,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-12-07 14:41:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1001. [2019-12-07 14:41:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-12-07 14:41:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1090 transitions. [2019-12-07 14:41:47,084 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1090 transitions. Word has length 417 [2019-12-07 14:41:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:47,085 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1090 transitions. [2019-12-07 14:41:47,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1090 transitions. [2019-12-07 14:41:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-12-07 14:41:47,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:47,088 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:41:47,088 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:47,088 INFO L82 PathProgramCache]: Analyzing trace with hash -46355594, now seen corresponding path program 1 times [2019-12-07 14:41:47,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:47,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029533520] [2019-12-07 14:41:47,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 20 proven. 267 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-12-07 14:41:47,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029533520] [2019-12-07 14:41:47,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895403297] [2019-12-07 14:41:47,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/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 14:41:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:47,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 14:41:47,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 66 proven. 187 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-12-07 14:41:48,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:48,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-12-07 14:41:48,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791023027] [2019-12-07 14:41:48,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 14:41:48,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 14:41:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-12-07 14:41:48,155 INFO L87 Difference]: Start difference. First operand 1001 states and 1090 transitions. Second operand 29 states. [2019-12-07 14:41:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:48,900 INFO L93 Difference]: Finished difference Result 1215 states and 1332 transitions. [2019-12-07 14:41:48,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 14:41:48,900 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 417 [2019-12-07 14:41:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:48,901 INFO L225 Difference]: With dead ends: 1215 [2019-12-07 14:41:48,901 INFO L226 Difference]: Without dead ends: 1213 [2019-12-07 14:41:48,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 414 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 14:41:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-12-07 14:41:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1001. [2019-12-07 14:41:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-12-07 14:41:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1089 transitions. [2019-12-07 14:41:48,979 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1089 transitions. Word has length 417 [2019-12-07 14:41:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:48,980 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 1089 transitions. [2019-12-07 14:41:48,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 14:41:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1089 transitions. [2019-12-07 14:41:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-12-07 14:41:48,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:48,982 INFO L410 BasicCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:41:49,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:49,184 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:49,185 INFO L82 PathProgramCache]: Analyzing trace with hash 97766421, now seen corresponding path program 1 times [2019-12-07 14:41:49,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:49,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054497689] [2019-12-07 14:41:49,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 187 proven. 100 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-12-07 14:41:49,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054497689] [2019-12-07 14:41:49,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981660262] [2019-12-07 14:41:49,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/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 14:41:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:49,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 14:41:49,609 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 201 proven. 47 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-12-07 14:41:49,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:49,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-12-07 14:41:49,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177217055] [2019-12-07 14:41:49,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:41:49,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:41:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:41:49,771 INFO L87 Difference]: Start difference. First operand 1001 states and 1089 transitions. Second operand 11 states. [2019-12-07 14:41:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:50,235 INFO L93 Difference]: Finished difference Result 1430 states and 1552 transitions. [2019-12-07 14:41:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 14:41:50,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 464 [2019-12-07 14:41:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:50,236 INFO L225 Difference]: With dead ends: 1430 [2019-12-07 14:41:50,236 INFO L226 Difference]: Without dead ends: 1221 [2019-12-07 14:41:50,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 481 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2019-12-07 14:41:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-12-07 14:41:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1000. [2019-12-07 14:41:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-12-07 14:41:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1085 transitions. [2019-12-07 14:41:50,318 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1085 transitions. Word has length 464 [2019-12-07 14:41:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:50,318 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 1085 transitions. [2019-12-07 14:41:50,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:41:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1085 transitions. [2019-12-07 14:41:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-12-07 14:41:50,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:50,321 INFO L410 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 14:41:50,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:50,522 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash -577347883, now seen corresponding path program 1 times [2019-12-07 14:41:50,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:50,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357529719] [2019-12-07 14:41:50,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 28 proven. 657 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-12-07 14:41:51,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357529719] [2019-12-07 14:41:51,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051092282] [2019-12-07 14:41:51,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:51,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 14:41:51,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 161 proven. 503 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 14:41:51,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:51,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 37 [2019-12-07 14:41:51,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966874665] [2019-12-07 14:41:51,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 14:41:51,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:51,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 14:41:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 14:41:51,892 INFO L87 Difference]: Start difference. First operand 1000 states and 1085 transitions. Second operand 37 states. [2019-12-07 14:41:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:53,053 INFO L93 Difference]: Finished difference Result 1161 states and 1265 transitions. [2019-12-07 14:41:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 14:41:53,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 523 [2019-12-07 14:41:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:53,055 INFO L225 Difference]: With dead ends: 1161 [2019-12-07 14:41:53,055 INFO L226 Difference]: Without dead ends: 1159 [2019-12-07 14:41:53,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 525 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=4203, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 14:41:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-12-07 14:41:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1000. [2019-12-07 14:41:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-12-07 14:41:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1084 transitions. [2019-12-07 14:41:53,141 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1084 transitions. Word has length 523 [2019-12-07 14:41:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:53,142 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 1084 transitions. [2019-12-07 14:41:53,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 14:41:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1084 transitions. [2019-12-07 14:41:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2019-12-07 14:41:53,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:53,145 INFO L410 BasicCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:53,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:53,346 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1917072682, now seen corresponding path program 1 times [2019-12-07 14:41:53,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:53,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536461718] [2019-12-07 14:41:53,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 311 proven. 276 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-12-07 14:41:53,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536461718] [2019-12-07 14:41:53,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713135496] [2019-12-07 14:41:53,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:53,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 14:41:53,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 340 proven. 208 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-12-07 14:41:54,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:54,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 13 [2019-12-07 14:41:54,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360701761] [2019-12-07 14:41:54,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:41:54,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:41:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:41:54,263 INFO L87 Difference]: Start difference. First operand 1000 states and 1084 transitions. Second operand 13 states. [2019-12-07 14:41:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:55,109 INFO L93 Difference]: Finished difference Result 1227 states and 1334 transitions. [2019-12-07 14:41:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 14:41:55,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 570 [2019-12-07 14:41:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:55,111 INFO L225 Difference]: With dead ends: 1227 [2019-12-07 14:41:55,111 INFO L226 Difference]: Without dead ends: 1162 [2019-12-07 14:41:55,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 589 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:41:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-12-07 14:41:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 998. [2019-12-07 14:41:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-12-07 14:41:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1080 transitions. [2019-12-07 14:41:55,200 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1080 transitions. Word has length 570 [2019-12-07 14:41:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:55,201 INFO L462 AbstractCegarLoop]: Abstraction has 998 states and 1080 transitions. [2019-12-07 14:41:55,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:41:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1080 transitions. [2019-12-07 14:41:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-12-07 14:41:55,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:55,204 INFO L410 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:55,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:55,405 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2024653189, now seen corresponding path program 1 times [2019-12-07 14:41:55,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:55,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506594535] [2019-12-07 14:41:55,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 14:41:56,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506594535] [2019-12-07 14:41:56,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193552781] [2019-12-07 14:41:56,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:56,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 14:41:56,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 168 proven. 918 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 14:41:57,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:57,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 43 [2019-12-07 14:41:57,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069700521] [2019-12-07 14:41:57,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 14:41:57,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 14:41:57,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1689, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 14:41:57,313 INFO L87 Difference]: Start difference. First operand 998 states and 1080 transitions. Second operand 43 states. [2019-12-07 14:41:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:58,743 INFO L93 Difference]: Finished difference Result 1162 states and 1264 transitions. [2019-12-07 14:41:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 14:41:58,744 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 630 [2019-12-07 14:41:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:58,744 INFO L225 Difference]: With dead ends: 1162 [2019-12-07 14:41:58,744 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:41:58,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=652, Invalid=6658, Unknown=0, NotChecked=0, Total=7310 [2019-12-07 14:41:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:41:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:41:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:41:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:41:58,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 630 [2019-12-07 14:41:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:58,747 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:41:58,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 14:41:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:41:58,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:41:58,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:41:58,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:41:59,420 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 253 [2019-12-07 14:41:59,739 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 253 [2019-12-07 14:42:00,098 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-12-07 14:42:03,806 WARN L192 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 1414 DAG size of output: 936 [2019-12-07 14:42:04,153 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-12-07 14:42:04,435 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 350 [2019-12-07 14:42:04,853 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 294 [2019-12-07 14:42:04,972 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 190 [2019-12-07 14:42:05,289 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 253 [2019-12-07 14:42:05,568 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 326 [2019-12-07 14:42:05,689 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 220 [2019-12-07 14:42:05,913 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 232 [2019-12-07 14:42:06,062 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 250 [2019-12-07 14:42:07,046 WARN L192 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-12-07 14:42:08,016 WARN L192 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-12-07 14:42:08,356 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-12-07 14:42:08,533 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 214 [2019-12-07 14:42:08,683 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 175 [2019-12-07 14:42:09,103 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-12-07 14:42:09,444 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 292 [2019-12-07 14:42:10,273 WARN L192 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 388 [2019-12-07 14:42:10,448 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 242 [2019-12-07 14:42:10,623 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 242 [2019-12-07 14:42:10,825 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 219 [2019-12-07 14:42:11,804 WARN L192 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-12-07 14:42:12,040 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 245 [2019-12-07 14:42:12,993 WARN L192 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 696 DAG size of output: 473 [2019-12-07 14:42:13,355 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-12-07 14:42:13,636 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 256 [2019-12-07 14:42:13,977 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 346 [2019-12-07 14:42:14,121 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 207 [2019-12-07 14:42:14,382 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 146 [2019-12-07 14:42:14,487 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 200 [2019-12-07 14:42:14,668 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 246 [2019-12-07 14:42:18,404 WARN L192 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 1430 DAG size of output: 945 [2019-12-07 14:42:19,907 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 906 DAG size of output: 557 [2019-12-07 14:42:20,016 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 200 [2019-12-07 14:42:20,976 WARN L192 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 696 DAG size of output: 473 [2019-12-07 14:42:21,235 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 200 [2019-12-07 14:42:21,535 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 241 [2019-12-07 14:42:21,690 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 260 [2019-12-07 14:42:21,850 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 341 DAG size of output: 275 [2019-12-07 14:42:22,902 WARN L192 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 690 DAG size of output: 468 [2019-12-07 14:42:23,526 WARN L192 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 492 DAG size of output: 426 [2019-12-07 14:42:24,418 WARN L192 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 523 DAG size of output: 433 [2019-12-07 14:42:24,575 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 251 [2019-12-07 14:42:24,753 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 247 [2019-12-07 14:42:25,615 WARN L192 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 523 DAG size of output: 433 [2019-12-07 14:42:26,451 WARN L192 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 513 DAG size of output: 435 [2019-12-07 14:42:26,861 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 303 [2019-12-07 14:42:27,255 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 375 DAG size of output: 171 [2019-12-07 14:42:28,151 WARN L192 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 98 [2019-12-07 14:42:29,021 WARN L192 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 98 [2019-12-07 14:42:29,288 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-12-07 14:42:31,438 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-12-07 14:42:44,368 WARN L192 SmtUtils]: Spent 12.92 s on a formula simplification. DAG size of input: 903 DAG size of output: 206 [2019-12-07 14:42:44,740 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-12-07 14:42:48,308 WARN L192 SmtUtils]: Spent 3.57 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-12-07 14:42:50,381 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 335 DAG size of output: 113 [2019-12-07 14:42:51,826 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 288 DAG size of output: 144 [2019-12-07 14:42:52,359 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 106 [2019-12-07 14:42:53,232 WARN L192 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 98 [2019-12-07 14:42:54,742 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 316 DAG size of output: 115 [2019-12-07 14:42:55,288 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 103 [2019-12-07 14:42:56,027 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 110 [2019-12-07 14:42:56,908 WARN L192 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 110 [2019-12-07 14:42:57,787 WARN L192 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2019-12-07 14:43:02,478 WARN L192 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 456 DAG size of output: 164 [2019-12-07 14:43:02,887 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 101 [2019-12-07 14:43:06,421 WARN L192 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 456 DAG size of output: 164 [2019-12-07 14:43:06,838 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-12-07 14:43:09,077 WARN L192 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-12-07 14:43:09,378 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-12-07 14:43:10,034 WARN L192 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 92 [2019-12-07 14:43:10,744 WARN L192 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 96 [2019-12-07 14:43:11,111 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-12-07 14:43:11,764 WARN L192 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 102 [2019-12-07 14:43:14,172 WARN L192 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-12-07 14:43:15,617 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 271 DAG size of output: 112 [2019-12-07 14:43:15,882 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 76 [2019-12-07 14:43:20,032 WARN L192 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 369 DAG size of output: 158 [2019-12-07 14:43:20,246 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 14:43:21,140 WARN L192 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 107 [2019-12-07 14:43:21,356 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 14:43:22,139 WARN L192 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 107 [2019-12-07 14:43:22,334 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-12-07 14:43:22,918 WARN L192 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 94 [2019-12-07 14:43:26,015 WARN L192 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 456 DAG size of output: 164 [2019-12-07 14:43:26,437 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-12-07 14:43:27,164 WARN L192 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 96 [2019-12-07 14:43:31,126 WARN L192 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 461 DAG size of output: 164 [2019-12-07 14:43:31,561 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-12-07 14:43:34,243 WARN L192 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-12-07 14:43:35,467 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 248 DAG size of output: 95 [2019-12-07 14:43:35,828 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-12-07 14:43:38,073 WARN L192 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 325 DAG size of output: 130 [2019-12-07 14:43:38,804 WARN L192 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 90 [2019-12-07 14:43:39,164 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2019-12-07 14:43:39,461 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-12-07 14:43:40,073 WARN L192 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 38 [2019-12-07 14:43:41,620 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 197 DAG size of output: 111 [2019-12-07 14:43:41,837 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 14:43:42,678 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 109 [2019-12-07 14:43:57,807 WARN L192 SmtUtils]: Spent 15.12 s on a formula simplification. DAG size of input: 913 DAG size of output: 206 [2019-12-07 14:43:59,067 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 14:44:03,701 WARN L192 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 539 DAG size of output: 166 [2019-12-07 14:44:04,723 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 197 DAG size of output: 111 [2019-12-07 14:44:08,441 WARN L192 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 461 DAG size of output: 164 [2019-12-07 14:44:08,855 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-12-07 14:44:09,006 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 50 [2019-12-07 14:44:09,514 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 100 [2019-12-07 14:44:12,455 WARN L192 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 197 DAG size of output: 111 [2019-12-07 14:44:12,896 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-12-07 14:44:13,238 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-12-07 14:44:14,373 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 233 DAG size of output: 112 [2019-12-07 14:44:15,329 WARN L192 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 112 [2019-12-07 14:44:16,100 WARN L192 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 113 [2019-12-07 14:44:16,411 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-12-07 14:44:16,627 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 14:44:16,840 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 14:44:22,958 WARN L192 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 456 DAG size of output: 164 [2019-12-07 14:44:29,788 WARN L192 SmtUtils]: Spent 6.80 s on a formula simplification. DAG size of input: 422 DAG size of output: 155 [2019-12-07 14:44:31,317 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-12-07 14:44:32,852 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 162 DAG size of output: 101 [2019-12-07 14:44:35,179 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 425 DAG size of output: 158 [2019-12-07 14:44:35,828 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 97 [2019-12-07 14:44:36,496 WARN L192 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 98 [2019-12-07 14:44:37,260 WARN L192 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 99 [2019-12-07 14:44:40,559 WARN L192 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 425 DAG size of output: 158 [2019-12-07 14:44:44,401 WARN L192 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 422 DAG size of output: 149 [2019-12-07 14:44:44,583 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2019-12-07 14:44:46,199 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 301 DAG size of output: 118 [2019-12-07 14:44:46,486 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-12-07 14:44:46,774 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-12-07 14:44:47,111 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 80 [2019-12-07 14:44:47,560 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 94 [2019-12-07 14:44:47,563 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,563 INFO L246 CegarLoopResult]: For program point L564(lines 564 617) no Hoare annotation was computed. [2019-12-07 14:44:47,563 INFO L246 CegarLoopResult]: For program point L102(lines 102 130) no Hoare annotation was computed. [2019-12-07 14:44:47,563 INFO L246 CegarLoopResult]: For program point L829(lines 829 835) no Hoare annotation was computed. [2019-12-07 14:44:47,563 INFO L242 CegarLoopResult]: At program point L829-1(lines 829 835) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory2~0 52)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse17 (<= 2 ~a_t~0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse10 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 .cse14 .cse15 (= ~a_t~0 1)) (and .cse2 .cse14 .cse3 .cse16 .cse4 .cse5 .cse17 .cse15 .cse1 .cse12) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse13 .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15) (and .cse14 .cse3 (= ~m_run_pc~0 3) .cse16 .cse5 .cse4 .cse17 .cse15 .cse1) (and .cse3 (not .cse5) (<= 2 ~s_run_pc~0) .cse4 .cse15 (<= 3 ~m_run_pc~0) .cse1))) [2019-12-07 14:44:47,564 INFO L242 CegarLoopResult]: At program point L763(lines 756 809) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,564 INFO L242 CegarLoopResult]: At program point L697(lines 690 725) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.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 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,564 INFO L246 CegarLoopResult]: For program point L565(lines 565 569) no Hoare annotation was computed. [2019-12-07 14:44:47,564 INFO L242 CegarLoopResult]: At program point L1094(lines 1087 1104) the Hoare annotation is: (let ((.cse10 (= ~c_empty_req~0 1)) (.cse13 (= ~m_run_st~0 0))) (let ((.cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (let ((.cse26 (= ~m_run_pc~0 3))) (or (and .cse10 (= 0 ~s_run_pc~0) .cse26 .cse13) (and .cse10 (<= 2 ~s_run_pc~0) .cse26 .cse13)))) (.cse16 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse25 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (= 0 ~c_req_type~0)) (.cse5 (= 1 ~c_write_rsp_ev~0)) (.cse18 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse14 (= 2 ~s_run_pc~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= ~s_memory2~0 52)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= 2 ~a_t~0)) (.cse21 (<= 2 ULTIMATE.start_s_run_~req_a~1))) (or (and .cse0 .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse9 .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse12 (= ~a_t~0 0) .cse13 .cse14) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse11 .cse15 .cse16 .cse12 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse3 .cse4 .cse5 .cse18 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse19 .cse11 .cse15 .cse16 (<= 52 ~c_req_d~0) .cse12 .cse17 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse20 .cse21) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse23 .cse5 (<= 51 ~c_req_d~0) .cse24 .cse11 .cse25 (<= 1 ~a_t~0) .cse15 .cse16 (<= ~c_req_d~0 51) .cse12 .cse17) (and .cse2 .cse5 (= ~req_tt_a~0 1) .cse24 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse10 .cse25 (= 51 ~c_rsp_d~0) .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_read_~i 1) .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse4 .cse22 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse23 .cse7 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) .cse8 (<= 1 ~c_req_a~0) .cse9 .cse11 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse2 (<= ULTIMATE.start_s_memory_read_~i 2) .cse5 .cse18 (<= 2 ~c_req_a~0) .cse10 (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse19 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse13 .cse14 .cse0 (= ~req_tt_a~0 2) .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse20 .cse21 (<= ~c_req_a~0 2))))) [2019-12-07 14:44:47,565 INFO L242 CegarLoopResult]: At program point L1161(lines 1113 1166) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse10 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_a~0 1)) (.cse14 (<= 1 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ~s_memory2~0 52)) (.cse25 (<= 2 ~c_req_a~0)) (.cse29 (<= ~c_req_a~0 2)) (.cse41 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse33 (<= ~m_run_pc~0 0)) (.cse7 (= 0 ~c_req_type~0)) (.cse35 (<= ~c_m_lock~0 0)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~a_t~0)) (.cse36 (<= ~a_t~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse39 (<= 1 ~a_t~0)) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse40 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 2 ~s_run_st~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse19 (<= 3 ~m_run_pc~0)) (.cse42 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse20 (<= 1 ~c_req_type~0)) (.cse43 (<= 0 ~a_t~0)) (.cse21 (<= ~c_req_type~0 1)) (.cse34 (= 0 ~s_run_pc~0)) (.cse44 (<= ~a_t~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse45 (<= ~c_req_d~0 50)) (.cse31 (<= ~c_req_a~0 0)) (.cse46 (<= 50 ~c_req_d~0)) (.cse32 (<= 0 ~c_req_a~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 .cse10 (= ~req_tt_a~0 1) .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 (= ~a_t~0 1)) (and .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse21 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse23 .cse2 .cse24 .cse4 .cse25 .cse16 .cse26 (<= 52 ~c_req_d~0) .cse17 .cse27 (<= ~c_req_d~0 52) .cse18 .cse28 .cse3 .cse29) (and .cse30 (not .cse18) .cse1 .cse3 .cse4) (and .cse31 .cse32 .cse0 .cse33 .cse30 .cse34 .cse35 .cse3 .cse4) (and .cse16 .cse30 .cse2 .cse18 .cse3 .cse4) (and .cse0 .cse16 .cse30 .cse24 .cse18 .cse28 .cse3 .cse4 .cse13) (and .cse20 .cse36 .cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse2 .cse10 .cse4 .cse12 .cse37 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse16 .cse38 .cse39 .cse26 (<= ~c_req_d~0 51) .cse17 .cse27 .cse18 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse31 .cse32 .cse20 .cse30 .cse34 .cse2 .cse3 .cse4) (and .cse40 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse41 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 (= ~req_tt_a~0 0) .cse26 .cse17 (= ~a_t~0 0) .cse27 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3 .cse19 .cse42) (and .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse4 .cse13 .cse15 .cse25 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse28 .cse3 .cse19 .cse29 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse40 .cse20 .cse43 .cse21 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 .cse16 .cse17 .cse18 .cse3 .cse42) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse30 .cse7 .cse44 .cse18 .cse35 .cse4 .cse3) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse7 .cse44 .cse34 .cse35 .cse4 .cse3) (and (or (and .cse16 .cse30 .cse17 .cse24 .cse18 .cse28 .cse3 .cse19 .cse4) (and .cse16 .cse36 .cse30 .cse38 .cse39 .cse17 .cse18 .cse3 .cse19 .cse4 .cse37) (and .cse40 .cse16 .cse43 .cse30 .cse44 .cse17 .cse18 .cse3 .cse19 .cse4 .cse42)) .cse13) (and .cse20 .cse43 .cse21 .cse34 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse3))) [2019-12-07 14:44:47,565 INFO L246 CegarLoopResult]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2019-12-07 14:44:47,565 INFO L246 CegarLoopResult]: For program point L765(lines 765 769) no Hoare annotation was computed. [2019-12-07 14:44:47,565 INFO L246 CegarLoopResult]: For program point L699(lines 699 703) no Hoare annotation was computed. [2019-12-07 14:44:47,566 INFO L242 CegarLoopResult]: At program point L1294(lines 1287 1313) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse31 (<= ~a_t~0 1)) (.cse10 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_a~0 1)) (.cse34 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= 1 ~c_req_a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse32 (<= 1 ~a_t~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse13 (= ~m_run_pc~0 6)) (.cse15 (= ~s_memory2~0 52)) (.cse25 (<= 2 ~c_req_a~0)) (.cse28 (<= 2 ~a_t~0)) (.cse19 (<= 3 ~m_run_pc~0)) (.cse29 (<= ~c_req_a~0 2)) (.cse35 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse38 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse30 (<= 2 ~s_run_st~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse44 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse41 (<= ~m_run_pc~0 0)) (.cse7 (= 0 ~c_req_type~0)) (.cse43 (<= ~c_m_lock~0 0)) (.cse20 (<= 1 ~c_req_type~0)) (.cse36 (<= 0 ~a_t~0)) (.cse21 (<= ~c_req_type~0 1)) (.cse42 (= 0 ~s_run_pc~0)) (.cse37 (<= ~a_t~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse45 (<= ~c_req_d~0 50)) (.cse39 (<= ~c_req_a~0 0)) (.cse46 (<= 50 ~c_req_d~0)) (.cse40 (<= 0 ~c_req_a~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 .cse10 (= ~req_tt_a~0 1) .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 (= ~a_t~0 1)) (and .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse21 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse23 .cse2 .cse24 .cse4 .cse25 .cse16 .cse26 (<= 52 ~c_req_d~0) .cse17 .cse27 (<= ~c_req_d~0 52) .cse18 .cse28 .cse3 .cse29) (and .cse30 (not .cse18) .cse1 .cse3 .cse4) (and (or (and .cse16 .cse30 .cse17 .cse24 .cse18 .cse28 .cse3 .cse19 .cse4) (and .cse16 .cse31 .cse32 .cse33 .cse30 .cse17 .cse18 .cse3 .cse19 .cse4 .cse34) (and .cse35 .cse16 .cse36 .cse30 .cse37 .cse17 .cse18 .cse3 .cse19 .cse4 .cse38)) .cse13) (and .cse39 .cse40 .cse0 .cse41 .cse30 .cse42 .cse43 .cse3 .cse4) (and .cse16 .cse30 .cse2 .cse18 .cse3 .cse4) (and .cse0 .cse16 .cse30 .cse24 .cse18 .cse28 .cse3 .cse4 .cse13) (and .cse20 .cse31 .cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse2 .cse10 .cse4 .cse12 .cse34 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse16 .cse33 .cse32 .cse26 (<= ~c_req_d~0 51) .cse17 .cse27 .cse18 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse39 .cse40 .cse20 .cse30 .cse42 .cse2 .cse3 .cse4) (and .cse35 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse44 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 (= ~req_tt_a~0 0) .cse26 .cse17 (= ~a_t~0 0) .cse27 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3 .cse19 .cse38) (and .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse4 .cse13 .cse15 .cse25 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse28 .cse3 .cse19 .cse29 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse35 .cse20 .cse36 .cse21 .cse37 .cse2 .cse4 .cse45 .cse39 .cse46 .cse40 .cse16 .cse17 .cse18 .cse3 .cse38) (and .cse44 .cse0 .cse36 .cse41 .cse16 .cse30 .cse7 .cse37 .cse18 .cse43 .cse4 .cse3) (and .cse44 .cse0 .cse36 .cse41 .cse16 .cse7 .cse37 .cse42 .cse43 .cse4 .cse3) (and .cse20 .cse36 .cse21 .cse42 .cse37 .cse2 .cse4 .cse45 .cse39 .cse46 .cse40 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse3))) [2019-12-07 14:44:47,566 INFO L242 CegarLoopResult]: At program point L237(lines 230 265) the Hoare annotation is: (let ((.cse19 (= 2 ~s_run_pc~0))) (let ((.cse27 (<= ~m_run_pc~0 0)) (.cse11 (not .cse19)) (.cse28 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse16 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse22 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (or (and .cse27 .cse11 .cse13 .cse12) (and .cse11 .cse28 .cse12 .cse13))) (.cse7 (= 0 ~s_run_pc~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse3 (<= 1 ~c_req_type~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (<= 0 ~a_t~0)) (.cse14 (<= ~c_req_type~0 1)) (.cse21 (or (and .cse27 .cse13 .cse12) (and .cse28 .cse12 .cse13))) (.cse15 (<= ~a_t~0 0)) (.cse24 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse25 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse26 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse13) (and .cse3 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse14 .cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse17 .cse18 .cse8 .cse19 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse20 .cse21 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_a~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= ~c_req_d~0 51) .cse22 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse3 (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse14 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 2 ~c_req_a~0) .cse6 .cse16 .cse17 .cse18 .cse8 (<= ~c_req_d~0 52) .cse19 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse21 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= 52 ~c_req_d~0) .cse22 (<= ~c_req_a~0 2)) (and .cse23 .cse1 .cse3 .cse20 .cse4 .cse5 .cse14 .cse15 .cse7 .cse24 .cse0 .cse25 .cse2 .cse17 .cse18 .cse8 .cse26 .cse9 .cse10) (and .cse23 .cse3 .cse4 .cse20 .cse14 .cse21 .cse15 .cse24 .cse0 .cse25 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse17 .cse18 .cse8 .cse26 .cse19 .cse10))))) [2019-12-07 14:44:47,566 INFO L246 CegarLoopResult]: For program point L105(lines 105 129) no Hoare annotation was computed. [2019-12-07 14:44:47,566 INFO L246 CegarLoopResult]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2019-12-07 14:44:47,567 INFO L242 CegarLoopResult]: At program point L106(lines 101 843) 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 14:44:47,567 INFO L242 CegarLoopResult]: At program point L437(lines 430 456) the Hoare annotation is: (let ((.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= ~c_m_lock~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3 .cse4) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 (= ~s_memory1~0 51) .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) .cse4 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 .cse9 (<= 52 ~c_req_d~0) .cse10 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse1 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse1 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse5 (= ~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) .cse6 .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse2 .cse1 .cse3))) [2019-12-07 14:44:47,567 INFO L246 CegarLoopResult]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2019-12-07 14:44:47,567 INFO L246 CegarLoopResult]: For program point L239(lines 239 243) no Hoare annotation was computed. [2019-12-07 14:44:47,567 INFO L246 CegarLoopResult]: For program point L966(lines 966 970) no Hoare annotation was computed. [2019-12-07 14:44:47,567 INFO L242 CegarLoopResult]: At program point L174(lines 144 175) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= 0 ~c_req_type~0)) (.cse8 (= 0 ~c_req_a~0)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse5 (<= ~a_t~0 0)) (.cse1 (<= 0 ~a_t~0)) (.cse21 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse20 (= 2 ~s_run_pc~0)) (.cse22 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse23 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse18 (<= 2 ~s_run_st~0)) (.cse6 (= 0 ~s_run_pc~0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse19 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse1 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse18 (not .cse20) .cse17 .cse7 .cse14) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse5 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse7 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= ULTIMATE.start_m_run_~a~0 1) .cse18 .cse21 .cse11 .cse12 .cse20 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse1 .cse22 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 50 ~c_req_d~0) .cse10 .cse23 .cse14 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse7 .cse9 .cse18 .cse21 .cse11 .cse12 .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse22 (<= ULTIMATE.start_m_run_~req_a~0 2) .cse10 (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse23 .cse14) (and .cse16 .cse9 .cse2 .cse3 .cse18 .cse6 .cse12 .cse14 .cse7 .cse19 .cse15))) [2019-12-07 14:44:47,568 INFO L246 CegarLoopResult]: For program point L108(lines 108 128) no Hoare annotation was computed. [2019-12-07 14:44:47,568 INFO L246 CegarLoopResult]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2019-12-07 14:44:47,568 INFO L242 CegarLoopResult]: At program point L571(lines 564 617) the Hoare annotation is: (let ((.cse10 (= 2 ~s_run_pc~0))) (let ((.cse1 (not .cse10)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse5 (= 0 ~c_req_type~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse8 (= ~s_memory1~0 51)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (= ~s_memory2~0 52)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 .cse7 .cse8 (= ~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) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 (= 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) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse10 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse4) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse6 .cse7 .cse8 .cse13 (<= ~c_req_a~0 1) .cse14 (<= 1 ~c_req_a~0) .cse15 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse4) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse5 (= ~req_tt_a~0 1) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) .cse0 (= 51 ~c_rsp_d~0) .cse9 .cse10 (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse11 .cse12 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse13 .cse14 .cse15 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (= ~a_t~0 1) (<= ~c_req_a~0 2))))) [2019-12-07 14:44:47,568 INFO L246 CegarLoopResult]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-12-07 14:44:47,568 INFO L242 CegarLoopResult]: At program point L109(lines 101 843) 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 14:44:47,568 INFO L246 CegarLoopResult]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2019-12-07 14:44:47,569 INFO L242 CegarLoopResult]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse9 (= ~req_tt_a~0 2)) (.cse37 (<= ~a_t~0 1)) (.cse18 (<= 2 ~a_t~0)) (.cse36 (<= ~a_t~0 0)) (.cse31 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse33 (= ~req_tt_a~0 1)) (.cse38 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse35 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse28 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse32 (<= ~c_req_a~0 1)) (.cse29 (<= 1 ~c_req_a~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse8 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse24 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse25 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse1 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse26 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (= ~s_memory2~0 52)) (.cse2 (<= 2 ~c_req_a~0)) (.cse17 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse22 (<= 1 ~a_t~0)) (.cse27 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse21 (<= ~c_req_a~0 2)) (.cse43 (= ~a_t~0 1)) (.cse40 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse34 (<= 0 ~a_t~0)) (.cse0 (= 0 ~c_req_type~0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= ~s_memory1~0 51)) (.cse23 (= ~c_empty_rsp~0 1)) (.cse41 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse42 (= 0 ~c_req_a~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse7 (= 2 ~s_run_pc~0)) (.cse19 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse20 (<= 2 ~c_write_rsp_ev~0)) (.cse39 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) .cse1 .cse2 .cse3 .cse4 (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse5 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse6 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse18 .cse19 .cse20 .cse21) (and .cse16 .cse22 .cse5 .cse6 .cse1 .cse7 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 .cse24 .cse25 .cse1 .cse26 .cse13 .cse23 .cse14 .cse15 .cse2 .cse17 .cse16 .cse22 .cse6 .cse7 .cse20 .cse27 .cse21) (and .cse5 (not .cse7) (<= 2 ~s_run_pc~0) .cse20 .cse23) (and .cse8 .cse15 (let ((.cse30 (or (and .cse34 .cse16 .cse35 .cse36 .cse6 .cse7 .cse23 .cse20) (and .cse16 .cse37 .cse35 .cse22 .cse6 .cse7 .cse23 .cse20)))) (or (and .cse28 .cse29 .cse30 .cse10 .cse0 .cse11 .cse12 (= ~a_t~0 0) .cse31 .cse32 .cse14) (and .cse28 .cse29 .cse30 .cse10 .cse0 .cse11 .cse12 .cse31 .cse33 .cse32 .cse14))) .cse13 .cse38) (and (or (and .cse34 .cse16 .cse35 .cse5 .cse36 .cse6 .cse7 .cse23 .cse20) (and .cse16 .cse37 .cse22 .cse5 .cse6 .cse7 .cse23 .cse20)) .cse38) (and .cse3 .cse16 .cse5 .cse1 .cse7 .cse18 .cse20 .cse23 .cse14) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse36 .cse31 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse5 (= 50 ~c_rsp_d~0) .cse6 .cse7 .cse39 .cse8 .cse40 .cse34 .cse10 .cse11 .cse12 .cse13 .cse41 .cse14 .cse15 .cse42 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse16 (= ~req_tt_a~0 0) .cse20) (and .cse0 .cse33 .cse38 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse5 .cse35 (= 51 ~c_rsp_d~0) .cse6 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse24 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse25 .cse26 .cse13 .cse32 .cse14 .cse29 .cse15 .cse16 .cse20 .cse43) (and .cse40 .cse34 .cse16 .cse5 .cse6 .cse7 .cse23 .cse20 .cse39) (and .cse8 .cse10 .cse0 .cse11 .cse12 .cse24 .cse25 .cse1 .cse26 .cse13 .cse23 .cse14 .cse15 .cse2 .cse17 .cse16 .cse22 .cse6 .cse7 .cse20 (= ULTIMATE.start_m_run_~a~0 2) .cse27 .cse21 .cse43) (and .cse40 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse34 .cse0 .cse11 .cse12 .cse23 .cse41 .cse42 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse16 .cse4 (= 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) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse7 .cse19 .cse20 .cse39))) [2019-12-07 14:44:47,569 INFO L242 CegarLoopResult]: At program point L771(lines 764 808) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,569 INFO L242 CegarLoopResult]: At program point L705(lines 698 724) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.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 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,569 INFO L246 CegarLoopResult]: For program point L639(lines 638 666) no Hoare annotation was computed. [2019-12-07 14:44:47,569 INFO L246 CegarLoopResult]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-12-07 14:44:47,569 INFO L246 CegarLoopResult]: For program point L111(lines 111 127) no Hoare annotation was computed. [2019-12-07 14:44:47,570 INFO L242 CegarLoopResult]: At program point L904(lines 878 905) the Hoare annotation is: (let ((.cse4 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= 2 ~c_req_a~0)) (.cse10 (<= 2 ~a_t~0)) (.cse13 (<= ~c_req_a~0 2)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse1 (<= ~c_req_type~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse18 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse19 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse23 (<= ~c_req_a~0 1)) (.cse24 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse21 (= ~m_run_pc~0 6)) (.cse25 (<= 1 ~c_req_a~0)) (.cse22 (= ~s_memory2~0 52)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse26 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_memory_write_~v 51) .cse8 (<= 52 ~c_req_d~0) .cse9 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse10 .cse11 .cse12 .cse13) (and (<= ~c_req_d~0 50) .cse14 (<= 50 ~c_req_d~0) (<= 0 ~a_t~0) .cse8 (let ((.cse15 (<= ~c_req_a~0 0)) (.cse16 (<= 0 ~c_req_a~0))) (or (and .cse15 .cse16 .cse0 (= 0 ~s_run_pc~0) .cse5 .cse12 .cse6) (and .cse15 .cse16 .cse0 (<= 2 ~s_run_pc~0) .cse5 .cse12 .cse6))) .cse1 (<= ~a_t~0 0) .cse9 .cse17) (and .cse18 (= ~req_tt_a~0 2) .cse19 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse20 .cse6 .cse21 .cse22 .cse7 .cse8 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse11 .cse10 .cse12 .cse13 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse18 .cse14 .cse19 .cse2 .cse3 .cse20 .cse6 .cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse22 (= 0 ~c_req_a~0) .cse8 (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0) .cse11 .cse12 .cse17) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse0 (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse5 .cse6 .cse23 .cse24 .cse25 .cse8 .cse26 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse9 .cse11 .cse12) (and .cse18 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse19 .cse2 .cse3 (= ~req_tt_a~0 1) .cse20 .cse6 .cse23 .cse24 .cse21 .cse25 .cse22 .cse8 .cse26 .cse9 .cse11 .cse12 (= ~a_t~0 1)))) [2019-12-07 14:44:47,570 INFO L246 CegarLoopResult]: For program point L640(lines 640 644) no Hoare annotation was computed. [2019-12-07 14:44:47,570 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,570 INFO L242 CegarLoopResult]: At program point L112(lines 101 843) the Hoare annotation is: (let ((.cse17 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (= ~s_memory0~0 50)) (.cse20 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse30 (<= 52 ~c_req_d~0)) (.cse31 (<= ~c_req_d~0 52)) (.cse32 (<= 2 ~a_t~0)) (.cse1 (<= 0 ~a_t~0)) (.cse3 (<= ~a_t~0 0)) (.cse7 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse14 (= ~c_empty_req~0 1)) (.cse8 (<= ~c_req_a~0 0)) (.cse10 (<= 0 ~c_req_a~0)) (.cse4 (= 0 ~s_run_pc~0)) (.cse16 (<= 2 ~s_run_st~0)) (.cse15 (<= 2 ~s_run_pc~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse18 (<= ~a_t~0 1)) (.cse2 (<= ~c_req_type~0 1)) (.cse33 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= 51 ~c_req_d~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse34 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse35 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse25 (<= 1 ~a_t~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= ~c_req_d~0 51)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse28 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse29 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse36 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse5 .cse13 .cse6) (and .cse11 .cse16 .cse15 .cse5 .cse13 .cse6) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse5 .cse14 .cse11 .cse16 .cse25 .cse26 .cse27 .cse12 .cse28 .cse29 .cse13) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse19 (= ~s_memory1~0 51) .cse5 .cse14 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 .cse26 .cse30 .cse12 .cse28 .cse31 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse29 .cse32 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse13) (and .cse0 .cse17 .cse2 .cse19 .cse20 .cse21 .cse22 .cse23 .cse5 .cse6 (<= 2 ~c_req_a~0) .cse11 .cse26 .cse30 .cse12 .cse28 .cse31 .cse32 .cse29 .cse13 (<= ~c_req_a~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13) (and .cse1 .cse3 .cse33 .cse5 .cse34 .cse35 .cse7 .cse9 .cse14 .cse11 .cse16 .cse26 .cse12 .cse28 .cse29 .cse13 .cse36) (and .cse8 .cse10 .cse0 .cse16 .cse4 .cse5 .cse13 .cse6) (and .cse16 (not .cse29) .cse15 .cse5 .cse13 .cse6) (and .cse0 .cse18 .cse2 .cse33 .cse24 .cse5 .cse34 .cse6 (<= ~c_req_a~0 1) .cse35 (<= 1 ~c_req_a~0) .cse11 .cse25 .cse26 .cse27 .cse12 .cse28 .cse29 .cse13 .cse36))) [2019-12-07 14:44:47,570 INFO L242 CegarLoopResult]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (= 2 ~s_run_pc~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse15 (= 0 ~s_run_pc~0)) (.cse21 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse12 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= 0 ~a_t~0)) (.cse13 (<= ~m_run_pc~0 0)) (.cse14 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse22 (= 0 ~c_req_type~0)) (.cse19 (<= ~a_t~0 0)) (.cse18 (<= 2 ~s_run_pc~0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse23 (= 0 ~c_req_a~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse24 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) .cse0 (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_m_run_~req_a~0 2) .cse9 (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse10 .cse11) (and .cse12 .cse1 .cse13 .cse14 .cse2 .cse15 .cse6 .cse11 .cse0 .cse16 .cse17) (and .cse2 (not .cse7) .cse18 .cse0 .cse11) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse19 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_m_run_~a~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse20 (<= 51 ULTIMATE.start_m_run_~req_d~0) .cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 50 ~c_req_d~0) .cse9 .cse10 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse21 .cse20 .cse13 .cse14 .cse22 .cse19 .cse15 .cse0 .cse23 .cse1 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse4 .cse5 .cse6 .cse24 .cse11 .cse17) (and .cse21 .cse12 .cse20 .cse13 .cse14 .cse22 .cse19 .cse18 .cse0 .cse23 .cse1 .cse9 .cse2 .cse4 .cse5 .cse24 .cse6 .cse11 .cse17 .cse16))) [2019-12-07 14:44:47,570 INFO L246 CegarLoopResult]: For program point L773(lines 773 777) no Hoare annotation was computed. [2019-12-07 14:44:47,570 INFO L246 CegarLoopResult]: For program point L707(lines 707 711) no Hoare annotation was computed. [2019-12-07 14:44:47,571 INFO L242 CegarLoopResult]: At program point L1302(lines 1295 1312) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse31 (<= ~a_t~0 1)) (.cse10 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_a~0 1)) (.cse34 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= 1 ~c_req_a~0)) (.cse33 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse32 (<= 1 ~a_t~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse13 (= ~m_run_pc~0 6)) (.cse15 (= ~s_memory2~0 52)) (.cse25 (<= 2 ~c_req_a~0)) (.cse28 (<= 2 ~a_t~0)) (.cse19 (<= 3 ~m_run_pc~0)) (.cse29 (<= ~c_req_a~0 2)) (.cse35 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse38 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse30 (<= 2 ~s_run_st~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse44 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse41 (<= ~m_run_pc~0 0)) (.cse7 (= 0 ~c_req_type~0)) (.cse43 (<= ~c_m_lock~0 0)) (.cse20 (<= 1 ~c_req_type~0)) (.cse36 (<= 0 ~a_t~0)) (.cse21 (<= ~c_req_type~0 1)) (.cse42 (= 0 ~s_run_pc~0)) (.cse37 (<= ~a_t~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse45 (<= ~c_req_d~0 50)) (.cse39 (<= ~c_req_a~0 0)) (.cse46 (<= 50 ~c_req_d~0)) (.cse40 (<= 0 ~c_req_a~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 .cse10 (= ~req_tt_a~0 1) .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 (= ~a_t~0 1)) (and .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse21 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse23 .cse2 .cse24 .cse4 .cse25 .cse16 .cse26 (<= 52 ~c_req_d~0) .cse17 .cse27 (<= ~c_req_d~0 52) .cse18 .cse28 .cse3 .cse29) (and .cse30 (not .cse18) .cse1 .cse3 .cse4) (and (or (and .cse16 .cse30 .cse17 .cse24 .cse18 .cse28 .cse3 .cse19 .cse4) (and .cse16 .cse31 .cse32 .cse33 .cse30 .cse17 .cse18 .cse3 .cse19 .cse4 .cse34) (and .cse35 .cse16 .cse36 .cse30 .cse37 .cse17 .cse18 .cse3 .cse19 .cse4 .cse38)) .cse13) (and .cse39 .cse40 .cse0 .cse41 .cse30 .cse42 .cse43 .cse3 .cse4) (and .cse16 .cse30 .cse2 .cse18 .cse3 .cse4) (and .cse0 .cse16 .cse30 .cse24 .cse18 .cse28 .cse3 .cse4 .cse13) (and .cse20 .cse31 .cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse2 .cse10 .cse4 .cse12 .cse34 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse16 .cse33 .cse32 .cse26 (<= ~c_req_d~0 51) .cse17 .cse27 .cse18 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse39 .cse40 .cse20 .cse30 .cse42 .cse2 .cse3 .cse4) (and .cse35 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse44 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 (= ~req_tt_a~0 0) .cse26 .cse17 (= ~a_t~0 0) .cse27 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3 .cse19 .cse38) (and .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse4 .cse13 .cse15 .cse25 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse28 .cse3 .cse19 .cse29 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse35 .cse20 .cse36 .cse21 .cse37 .cse2 .cse4 .cse45 .cse39 .cse46 .cse40 .cse16 .cse17 .cse18 .cse3 .cse38) (and .cse44 .cse0 .cse36 .cse41 .cse16 .cse30 .cse7 .cse37 .cse18 .cse43 .cse4 .cse3) (and .cse44 .cse0 .cse36 .cse41 .cse16 .cse7 .cse37 .cse42 .cse43 .cse4 .cse3) (and .cse20 .cse36 .cse21 .cse42 .cse37 .cse2 .cse4 .cse45 .cse39 .cse46 .cse40 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse3))) [2019-12-07 14:44:47,571 INFO L242 CegarLoopResult]: At program point L245(lines 238 264) the Hoare annotation is: (let ((.cse19 (= 2 ~s_run_pc~0))) (let ((.cse27 (<= ~m_run_pc~0 0)) (.cse11 (not .cse19)) (.cse28 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse16 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse22 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (or (and .cse27 .cse11 .cse13 .cse12) (and .cse11 .cse28 .cse12 .cse13))) (.cse7 (= 0 ~s_run_pc~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse3 (<= 1 ~c_req_type~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (<= 0 ~a_t~0)) (.cse14 (<= ~c_req_type~0 1)) (.cse21 (or (and .cse27 .cse13 .cse12) (and .cse28 .cse12 .cse13))) (.cse15 (<= ~a_t~0 0)) (.cse24 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse25 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse26 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse13) (and .cse3 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse14 .cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse17 .cse18 .cse8 .cse19 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse20 .cse21 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_a~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= ~c_req_d~0 51) .cse22 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse3 (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse14 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 2 ~c_req_a~0) .cse6 .cse16 .cse17 .cse18 .cse8 (<= ~c_req_d~0 52) .cse19 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse21 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= 52 ~c_req_d~0) .cse22 (<= ~c_req_a~0 2)) (and .cse23 .cse1 .cse3 .cse20 .cse4 .cse5 .cse14 .cse15 .cse7 .cse24 .cse0 .cse25 .cse2 .cse17 .cse18 .cse8 .cse26 .cse9 .cse10) (and .cse23 .cse3 .cse4 .cse20 .cse14 .cse21 .cse15 .cse24 .cse0 .cse25 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse17 .cse18 .cse8 .cse26 .cse19 .cse10))))) [2019-12-07 14:44:47,571 INFO L246 CegarLoopResult]: For program point L179(lines 178 206) no Hoare annotation was computed. [2019-12-07 14:44:47,571 INFO L242 CegarLoopResult]: At program point L972(lines 965 982) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse26 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse24 (= ~m_run_pc~0 3)) (.cse8 (<= ~c_req_a~0 1)) (.cse10 (<= 1 ~c_req_a~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.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 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse28 (<= 2 ~c_req_a~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse29 (<= 2 ~a_t~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (<= ~c_req_a~0 2))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~a_t~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse11 .cse12 .cse19 .cse13 (= ~req_tt_a~0 0) .cse15 (= ~a_t~0 0) .cse16 .cse17) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse19 (<= 0 ~a_t~0) .cse13 (let ((.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse12 .cse22 .cse23 (= 0 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6) (and .cse20 .cse21 .cse12 .cse22 .cse23 (<= 2 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6))) .cse25 (<= ~a_t~0 0) .cse15 .cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse25 .cse3 .cse4 .cse24 .cse27 .cse6 .cse26 .cse28 (<= ULTIMATE.start_s_memory_write_~v 51) .cse12 .cse13 .cse23 (<= 52 ~c_req_d~0) .cse15 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse16 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse29 .cse17 .cse30) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse22 .cse25 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 .cse12 .cse14 .cse23 .cse15 .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse3 (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse24 .cse8 .cse10 .cse13 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse17) (and .cse0 (= ~req_tt_a~0 2) .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse6 .cse9 .cse11 .cse28 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse13 .cse15 .cse16 .cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse17 .cse30 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L180(lines 180 184) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L114(lines 114 126) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L973(lines 965 982) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L242 CegarLoopResult]: At program point L445(lines 438 455) the Hoare annotation is: (let ((.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= ~c_m_lock~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3 .cse4) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 (= ~s_memory1~0 51) .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) .cse4 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 .cse9 (<= 52 ~c_req_d~0) .cse10 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse1 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse1 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse5 (= ~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) .cse6 .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse2 .cse1 .cse3))) [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L247(lines 247 251) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2019-12-07 14:44:47,572 INFO L242 CegarLoopResult]: At program point L115(lines 101 843) 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 14:44:47,572 INFO L246 CegarLoopResult]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2019-12-07 14:44:47,573 INFO L242 CegarLoopResult]: At program point L1040(lines 1033 1086) the Hoare annotation is: (let ((.cse20 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse29 (<= 2 ~a_t~0)) (.cse30 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse0 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ~a_t~0 0)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse14 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse32 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (= 0 ~c_req_type~0)) (.cse24 (= ~s_memory0~0 50)) (.cse25 (= ~s_memory1~0 51)) (.cse8 (= 1 ~c_write_rsp_ev~0)) (.cse9 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse27 (= ~m_run_pc~0 6)) (.cse28 (= ~s_memory2~0 52)) (.cse1 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0))) (or (and .cse0 (let ((.cse2 (not .cse4))) (or (and .cse1 (= 0 ~s_run_pc~0) .cse2 .cse3) (and .cse1 .cse2 (<= 2 ~s_run_pc~0) .cse3))) (<= 1 ~c_req_type~0) .cse5 (<= ~c_req_type~0 1) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse10 .cse11 .cse12 .cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 52 ~c_rsp_d~0) .cse19 .cse8 (<= ULTIMATE.start_s_memory_read_~i 2) .cse20 (<= 2 ~c_req_a~0) .cse1 .cse21 (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse15 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse22 (= ~req_tt_a~0 2) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse29 .cse30 (<= ~c_req_a~0 2)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse24 .cse25 .cse8 .cse3 .cse20 .cse1 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse21 .cse14 (<= 52 ~c_req_d~0) .cse15 .cse16 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse4 .cse29 .cse30) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse14 .cse15 .cse16 .cse4 .cse17 .cse18) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse24 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse8 .cse32 (<= 51 ~c_req_d~0) .cse3 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse13 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse14 (<= ~c_req_d~0 51) .cse15 .cse16 .cse4) (and (= ULTIMATE.start_m_run_~a~0 1) .cse19 .cse8 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= 51 ~c_rsp_d~0) .cse15 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) .cse22 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse23 .cse24 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse25 .cse31 .cse32 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse26 (<= ~c_req_a~0 1) .cse27 (<= 1 ~c_req_a~0) .cse28 .cse13 (= ~a_t~0 1)) (and .cse22 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse23 .cse19 .cse24 .cse25 .cse8 .cse9 .cse26 .cse27 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse28 .cse1 (= ULTIMATE.start_m_run_~a~0 0) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse15 (= ~a_t~0 0) .cse4))) [2019-12-07 14:44:47,573 INFO L246 CegarLoopResult]: For program point L974(lines 974 978) no Hoare annotation was computed. [2019-12-07 14:44:47,573 INFO L246 CegarLoopResult]: For program point L446(lines 134 480) no Hoare annotation was computed. [2019-12-07 14:44:47,573 INFO L242 CegarLoopResult]: At program point L579(lines 572 616) the Hoare annotation is: (let ((.cse4 (= 0 ~c_req_type~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse7 (= ~s_memory1~0 51)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory2~0 52)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 3) .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 (= 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) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse1 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse4 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse8 .cse1 .cse9 .cse10 .cse5 .cse6 .cse7 .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse3) (and .cse4 (= ~req_tt_a~0 1) .cse2 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) .cse0 (= 51 ~c_rsp_d~0) .cse8 .cse1 (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse9 .cse10 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 .cse12 .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse3 (= ~a_t~0 1) (<= ~c_req_a~0 2)))) [2019-12-07 14:44:47,573 INFO L246 CegarLoopResult]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-12-07 14:44:47,573 INFO L246 CegarLoopResult]: For program point L117(lines 117 125) no Hoare annotation was computed. [2019-12-07 14:44:47,573 INFO L246 CegarLoopResult]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2019-12-07 14:44:47,573 INFO L242 CegarLoopResult]: At program point L118(lines 101 843) 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 14:44:47,573 INFO L246 CegarLoopResult]: For program point L911(lines 911 964) no Hoare annotation was computed. [2019-12-07 14:44:47,574 INFO L242 CegarLoopResult]: At program point L779(lines 772 807) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,574 INFO L242 CegarLoopResult]: At program point L713(lines 706 723) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.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 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,574 INFO L246 CegarLoopResult]: For program point L581(lines 581 585) no Hoare annotation was computed. [2019-12-07 14:44:47,574 INFO L249 CegarLoopResult]: At program point L1374(lines 1351 1376) the Hoare annotation is: true [2019-12-07 14:44:47,574 INFO L242 CegarLoopResult]: At program point L317(lines 287 318) the Hoare annotation is: (let ((.cse9 (= ~s_memory0~0 50)) (.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 (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~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) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse9 (= ~s_memory1~0 51) (<= 2 ULTIMATE.start_m_run_~a~0) .cse0 .cse1 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse3 .cse4 (<= 52 ~c_req_d~0) .cse5 .cse6 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse7 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse8) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse9 (= ~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 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse4 (<= ~c_req_d~0 51) .cse5 .cse6 .cse7 .cse8))) [2019-12-07 14:44:47,574 INFO L246 CegarLoopResult]: For program point L912(lines 912 916) no Hoare annotation was computed. [2019-12-07 14:44:47,574 INFO L246 CegarLoopResult]: For program point L714(lines 485 837) no Hoare annotation was computed. [2019-12-07 14:44:47,574 INFO L242 CegarLoopResult]: At program point L1243(lines 1236 1253) 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 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse2 .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 14:44:47,574 INFO L246 CegarLoopResult]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2019-12-07 14:44:47,574 INFO L246 CegarLoopResult]: For program point L120(lines 120 124) no Hoare annotation was computed. [2019-12-07 14:44:47,574 INFO L246 CegarLoopResult]: For program point L781(lines 781 785) no Hoare annotation was computed. [2019-12-07 14:44:47,575 INFO L246 CegarLoopResult]: For program point L715(lines 715 719) no Hoare annotation was computed. [2019-12-07 14:44:47,575 INFO L242 CegarLoopResult]: At program point L385(lines 378 395) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse0 (= ~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) .cse1 .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7 .cse8 .cse9 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse9 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse10) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 14:44:47,575 INFO L242 CegarLoopResult]: At program point L253(lines 246 263) the Hoare annotation is: (let ((.cse19 (= 2 ~s_run_pc~0))) (let ((.cse27 (<= ~m_run_pc~0 0)) (.cse11 (not .cse19)) (.cse28 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse16 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse22 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (or (and .cse27 .cse11 .cse13 .cse12) (and .cse11 .cse28 .cse12 .cse13))) (.cse7 (= 0 ~s_run_pc~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse3 (<= 1 ~c_req_type~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse20 (<= 0 ~a_t~0)) (.cse14 (<= ~c_req_type~0 1)) (.cse21 (or (and .cse27 .cse13 .cse12) (and .cse28 .cse12 .cse13))) (.cse15 (<= ~a_t~0 0)) (.cse24 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse25 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse17 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse26 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse13) (and .cse3 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse14 .cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) .cse16 .cse17 .cse18 .cse8 .cse19 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse20 .cse21 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_a~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= ~c_req_d~0 51) .cse22 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse3 (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse14 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 2 ~c_req_a~0) .cse6 .cse16 .cse17 .cse18 .cse8 (<= ~c_req_d~0 52) .cse19 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse21 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= 52 ~c_req_d~0) .cse22 (<= ~c_req_a~0 2)) (and .cse23 .cse1 .cse3 .cse20 .cse4 .cse5 .cse14 .cse15 .cse7 .cse24 .cse0 .cse25 .cse2 .cse17 .cse18 .cse8 .cse26 .cse9 .cse10) (and .cse23 .cse3 .cse4 .cse20 .cse14 .cse21 .cse15 .cse24 .cse0 .cse25 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse17 .cse18 .cse8 .cse26 .cse19 .cse10))))) [2019-12-07 14:44:47,575 INFO L242 CegarLoopResult]: At program point L121(lines 101 843) the Hoare annotation is: (let ((.cse22 (= ~req_tt_a~0 2)) (.cse18 (<= 2 ~c_req_a~0)) (.cse25 (<= ~c_req_a~0 2)) (.cse6 (= ~req_tt_a~0 1)) (.cse29 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse26 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse28 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse9 (<= ~c_req_a~0 1)) (.cse11 (<= 1 ~c_req_a~0)) (.cse17 (= ~a_t~0 1)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse1 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~s_memory2~0 52)) (.cse19 (= ~c_empty_req~0 1)) (.cse23 (<= 2 ~a_t~0)) (.cse2 (= 0 ~c_req_type~0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ~s_memory1~0 51)) (.cse10 (= ~m_run_pc~0 6)) (.cse30 (= 0 ~c_req_a~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse31 (= ~req_tt_a~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse32 (= ~a_t~0 0)) (.cse24 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= 2 ~s_run_st~0)) (.cse15 (= 2 ~s_run_pc~0)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (= 52 ~c_rsp_d~0) .cse2 (<= ULTIMATE.start_s_memory_read_~i 2) .cse18 .cse19 .cse20 (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse21 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse14 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse15 .cse0 .cse22 .cse1 .cse3 .cse4 .cse7 .cse10 .cse12 .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse23 .cse24 .cse16 .cse25) (and (<= 0 ~a_t~0) .cse13 .cse21 .cse14 .cse15 .cse16 .cse8 .cse10) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse26 .cse27 .cse28 .cse7 .cse8 .cse10 .cse12 .cse18 .cse13 .cse14 .cse15 .cse23 .cse16 .cse25 .cse29) (and .cse2 .cse6 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse19 .cse21 (= 51 ~c_rsp_d~0) .cse14 .cse15 .cse29 .cse0 .cse1 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse26 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse27 .cse28 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17) (and .cse0 .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse30 .cse12 .cse19 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse21 .cse31 (= 50 ~c_rsp_d~0) .cse14 .cse32 .cse15 .cse16) (and .cse19 .cse13 .cse21 .cse15 .cse23 .cse16 .cse8 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 .cse8 .cse10 .cse30 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse20 .cse31 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse14 .cse32 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse15 .cse24 .cse16) (and .cse21 (not .cse15) (<= 2 ~s_run_pc~0) .cse16 (<= 3 ~m_run_pc~0) .cse8))) [2019-12-07 14:44:47,575 INFO L246 CegarLoopResult]: For program point L386(lines 378 395) no Hoare annotation was computed. [2019-12-07 14:44:47,575 INFO L246 CegarLoopResult]: For program point L254(lines 134 480) no Hoare annotation was computed. [2019-12-07 14:44:47,575 INFO L246 CegarLoopResult]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2019-12-07 14:44:47,576 INFO L246 CegarLoopResult]: For program point L387(lines 387 391) no Hoare annotation was computed. [2019-12-07 14:44:47,576 INFO L246 CegarLoopResult]: For program point L255(lines 255 259) no Hoare annotation was computed. [2019-12-07 14:44:47,576 INFO L242 CegarLoopResult]: At program point L1048(lines 1041 1085) the Hoare annotation is: (let ((.cse20 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse29 (<= 2 ~a_t~0)) (.cse30 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse0 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ~a_t~0 0)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse14 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse32 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse22 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (= 0 ~c_req_type~0)) (.cse24 (= ~s_memory0~0 50)) (.cse25 (= ~s_memory1~0 51)) (.cse8 (= 1 ~c_write_rsp_ev~0)) (.cse9 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse27 (= ~m_run_pc~0 6)) (.cse28 (= ~s_memory2~0 52)) (.cse1 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0))) (or (and .cse0 (let ((.cse2 (not .cse4))) (or (and .cse1 (= 0 ~s_run_pc~0) .cse2 .cse3) (and .cse1 .cse2 (<= 2 ~s_run_pc~0) .cse3))) (<= 1 ~c_req_type~0) .cse5 (<= ~c_req_type~0 1) .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse10 .cse11 .cse12 .cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse14 .cse15 .cse16 .cse17 .cse18) (and (= 52 ~c_rsp_d~0) .cse19 .cse8 (<= ULTIMATE.start_s_memory_read_~i 2) .cse20 (<= 2 ~c_req_a~0) .cse1 .cse21 (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse15 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse22 (= ~req_tt_a~0 2) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse29 .cse30 (<= ~c_req_a~0 2)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse24 .cse25 .cse8 .cse3 .cse20 .cse1 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse21 .cse14 (<= 52 ~c_req_d~0) .cse15 .cse16 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse4 .cse29 .cse30) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse14 .cse15 .cse16 .cse4 .cse17 .cse18) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse24 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse31 .cse8 .cse32 (<= 51 ~c_req_d~0) .cse3 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse13 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse14 (<= ~c_req_d~0 51) .cse15 .cse16 .cse4) (and (= ULTIMATE.start_m_run_~a~0 1) .cse19 .cse8 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= 51 ~c_rsp_d~0) .cse15 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) .cse22 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse23 .cse24 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse25 .cse31 .cse32 (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse26 (<= ~c_req_a~0 1) .cse27 (<= 1 ~c_req_a~0) .cse28 .cse13 (= ~a_t~0 1)) (and .cse22 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse23 .cse19 .cse24 .cse25 .cse8 .cse9 .cse26 .cse27 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse28 .cse1 (= ULTIMATE.start_m_run_~a~0 0) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse15 (= ~a_t~0 0) .cse4))) [2019-12-07 14:44:47,576 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:44:47,576 INFO L246 CegarLoopResult]: For program point L58(lines 58 65) no Hoare annotation was computed. [2019-12-07 14:44:47,576 INFO L242 CegarLoopResult]: At program point L587(lines 580 615) the Hoare annotation is: (let ((.cse2 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~s_run_st~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse5 (= ~s_memory1~0 51)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory2~0 52)) (.cse0 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (or (and (<= ~m_run_pc~0 0) .cse0 .cse1) (and (= ~m_run_pc~0 3) .cse1 .cse0)) .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse6 (not .cse8) (<= 2 ~s_run_pc~0) .cse1 .cse0) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse0) (and .cse2 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse9 .cse10 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 .cse12 .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ~a_t~0 1) (<= ~c_req_a~0 2)))) [2019-12-07 14:44:47,576 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L242 CegarLoopResult]: At program point L918(lines 911 964) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse26 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse24 (= ~m_run_pc~0 3)) (.cse8 (<= ~c_req_a~0 1)) (.cse10 (<= 1 ~c_req_a~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.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 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse28 (<= 2 ~c_req_a~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse29 (<= 2 ~a_t~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (<= ~c_req_a~0 2))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~a_t~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse11 .cse12 .cse19 .cse13 (= ~req_tt_a~0 0) .cse15 (= ~a_t~0 0) .cse16 .cse17) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse19 (<= 0 ~a_t~0) .cse13 (let ((.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse12 .cse22 .cse23 (= 0 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6) (and .cse20 .cse21 .cse12 .cse22 .cse23 (<= 2 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6))) .cse25 (<= ~a_t~0 0) .cse15 .cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse25 .cse3 .cse4 .cse24 .cse27 .cse6 .cse26 .cse28 (<= ULTIMATE.start_s_memory_write_~v 51) .cse12 .cse13 .cse23 (<= 52 ~c_req_d~0) .cse15 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse16 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse29 .cse17 .cse30) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse22 .cse25 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 .cse12 .cse14 .cse23 .cse15 .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse3 (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse24 .cse8 .cse10 .cse13 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse17) (and .cse0 (= ~req_tt_a~0 2) .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse6 .cse9 .cse11 .cse28 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse13 .cse15 .cse16 .cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse17 .cse30 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 14:44:47,577 INFO L246 CegarLoopResult]: For program point L324(lines 324 377) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L246 CegarLoopResult]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L246 CegarLoopResult]: For program point L60(lines 60 65) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L246 CegarLoopResult]: For program point L985(lines 985 999) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L242 CegarLoopResult]: At program point L787(lines 780 806) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,577 INFO L246 CegarLoopResult]: For program point L589(lines 589 593) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L246 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L246 CegarLoopResult]: For program point L920(lines 920 924) no Hoare annotation was computed. [2019-12-07 14:44:47,577 INFO L242 CegarLoopResult]: At program point L524(lines 494 525) the Hoare annotation is: (let ((.cse10 (= 2 ~s_run_pc~0))) (let ((.cse11 (= 0 ~c_req_type~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse12 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse13 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse7 (= ~s_memory1~0 51)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (= ~s_memory2~0 52)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (not .cse10)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 .cse7 (= ~m_run_pc~0 3) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse10 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse4) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 (<= ULTIMATE.start_m_run_~a~0 1) .cse0 (= 50 ~c_rsp_d~0) .cse10 .cse12 .cse13 .cse5 .cse6 .cse7 .cse14 .cse15 .cse16 (= 0 ~c_req_a~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse4) (and .cse11 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse0 (= 51 ~c_rsp_d~0) .cse10 (<= ULTIMATE.start_s_memory_read_~i 1) .cse12 .cse13 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse14 (<= ~c_req_a~0 1) .cse15 (<= 1 ~c_req_a~0) .cse16 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (<= ULTIMATE.start_m_run_~a~0 2) .cse4 (= ~a_t~0 1)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-12-07 14:44:47,578 INFO L246 CegarLoopResult]: For program point L62(lines 62 65) no Hoare annotation was computed. [2019-12-07 14:44:47,578 INFO L246 CegarLoopResult]: For program point L789(lines 789 793) no Hoare annotation was computed. [2019-12-07 14:44:47,578 INFO L246 CegarLoopResult]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2019-12-07 14:44:47,578 INFO L246 CegarLoopResult]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2019-12-07 14:44:47,578 INFO L246 CegarLoopResult]: For program point L461(lines 461 465) no Hoare annotation was computed. [2019-12-07 14:44:47,578 INFO L242 CegarLoopResult]: At program point L131(lines 101 843) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse4 (= 0 ~c_req_a~0)) (.cse7 (<= 0 ~a_t~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= 0 ~c_req_type~0)) (.cse10 (<= ~a_t~0 0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~m_run_pc~0 0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse12 (= 0 ~s_run_pc~0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse1 .cse11 .cse3 .cse2) (and .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse12 .cse11 .cse3 .cse2) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse5 .cse6 .cse0 .cse12 .cse11 .cse2 .cse3))) [2019-12-07 14:44:47,578 INFO L242 CegarLoopResult]: At program point L1056(lines 1049 1084) the Hoare annotation is: (let ((.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse1 (= 1 ~c_write_rsp_ev~0)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse2 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse3 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~a~0 1) .cse0 .cse1 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 51 ~c_rsp_d~0) .cse3 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse9 (<= ~c_req_a~0 1) .cse10 (<= 1 ~c_req_a~0) .cse11 .cse12 (= ~a_t~0 1)) (and .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse0 .cse7 .cse8 .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse11 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse3 (= ~a_t~0 0) .cse4))) [2019-12-07 14:44:47,578 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 14:44:47,578 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,578 INFO L242 CegarLoopResult]: At program point L528-2(lines 528 556) the Hoare annotation is: (let ((.cse12 (= 2 ~s_run_pc~0))) (let ((.cse5 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse1 (not .cse12)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (= 0 ~c_req_type~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse15 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse8 (= ~s_memory1~0 51)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (= ~s_memory2~0 52)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) (and .cse5 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse6 .cse7 .cse8 (= ~m_run_pc~0 3) .cse3 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse10 .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) .cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse12 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse4 .cse13) (and .cse14 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1) .cse3 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse0 (= 51 ~c_rsp_d~0) .cse11 .cse12 (<= ULTIMATE.start_s_memory_read_~i 1) .cse15 .cse16 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse17 (<= ~c_req_a~0 1) .cse18 (<= 1 ~c_req_a~0) .cse19 .cse10 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) .cse4 (= ~a_t~0 1)) (and .cse5 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse14 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse9 .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse11 .cse12 .cse15 .cse16 .cse6 .cse7 .cse8 .cse17 .cse18 (= 0 ~c_req_a~0) .cse19 .cse10 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse4)))) [2019-12-07 14:44:47,579 INFO L242 CegarLoopResult]: At program point L1189(lines 1182 1235) 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 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse2 .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 14:44:47,579 INFO L246 CegarLoopResult]: For program point L991(lines 991 998) no Hoare annotation was computed. [2019-12-07 14:44:47,579 INFO L242 CegarLoopResult]: At program point L595(lines 588 614) the Hoare annotation is: (let ((.cse2 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~s_run_st~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse5 (= ~s_memory1~0 51)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory2~0 52)) (.cse0 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (or (and (<= ~m_run_pc~0 0) .cse0 .cse1) (and (= ~m_run_pc~0 3) .cse1 .cse0)) .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse6 (not .cse8) (<= 2 ~s_run_pc~0) .cse1 .cse0) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse0) (and .cse2 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) .cse9 .cse10 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 .cse12 .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (= ~a_t~0 1) (<= ~c_req_a~0 2)))) [2019-12-07 14:44:47,579 INFO L246 CegarLoopResult]: For program point L529(lines 528 556) no Hoare annotation was computed. [2019-12-07 14:44:47,579 INFO L246 CegarLoopResult]: For program point L397(lines 397 403) no Hoare annotation was computed. [2019-12-07 14:44:47,579 INFO L242 CegarLoopResult]: At program point L397-1(lines 397 403) the Hoare annotation is: (let ((.cse9 (= ~s_memory0~0 50)) (.cse0 (<= 2 ~s_run_pc~0)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse8) (and .cse5 (not (= 2 ~s_run_pc~0)) .cse0 .cse8 .cse2) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 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) .cse1 .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7 .cse8))) [2019-12-07 14:44:47,579 INFO L242 CegarLoopResult]: At program point L331(lines 324 377) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse0 (= ~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) .cse1 .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7 .cse8 .cse9 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse9 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse10) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 14:44:47,579 INFO L246 CegarLoopResult]: For program point L1256(line 1256) no Hoare annotation was computed. [2019-12-07 14:44:47,579 INFO L246 CegarLoopResult]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2019-12-07 14:44:47,580 INFO L246 CegarLoopResult]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2019-12-07 14:44:47,580 INFO L242 CegarLoopResult]: At program point L67(lines 54 68) the Hoare annotation is: (let ((.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse2 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse3 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse13 (<= ~c_req_a~0 2)) (and .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) .cse10 (<= 1 ~c_req_a~0) .cse11 .cse12 .cse13 (= ~a_t~0 1)) (and .cse5 .cse6 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse7 .cse8 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse9 .cse1 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse11 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse3 (= ~a_t~0 0) (= ULTIMATE.start_s_memory_read_~i 0) .cse4 .cse13))) [2019-12-07 14:44:47,580 INFO L246 CegarLoopResult]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2019-12-07 14:44:47,580 INFO L242 CegarLoopResult]: At program point L926(lines 919 963) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse26 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse24 (= ~m_run_pc~0 3)) (.cse8 (<= ~c_req_a~0 1)) (.cse10 (<= 1 ~c_req_a~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.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 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse28 (<= 2 ~c_req_a~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse29 (<= 2 ~a_t~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (<= ~c_req_a~0 2))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~a_t~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse11 .cse12 .cse19 .cse13 (= ~req_tt_a~0 0) .cse15 (= ~a_t~0 0) .cse16 .cse17) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse19 (<= 0 ~a_t~0) .cse13 (let ((.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse12 .cse22 .cse23 (= 0 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6) (and .cse20 .cse21 .cse12 .cse22 .cse23 (<= 2 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6))) .cse25 (<= ~a_t~0 0) .cse15 .cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse25 .cse3 .cse4 .cse24 .cse27 .cse6 .cse26 .cse28 (<= ULTIMATE.start_s_memory_write_~v 51) .cse12 .cse13 .cse23 (<= 52 ~c_req_d~0) .cse15 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse16 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse29 .cse17 .cse30) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse22 .cse25 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 .cse12 .cse14 .cse23 .cse15 .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse3 (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse24 .cse8 .cse10 .cse13 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse17) (and .cse0 (= ~req_tt_a~0 2) .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse6 .cse9 .cse11 .cse28 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse13 .cse15 .cse16 .cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse17 .cse30 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 14:44:47,580 INFO L246 CegarLoopResult]: For program point L530(lines 530 534) no Hoare annotation was computed. [2019-12-07 14:44:47,580 INFO L246 CegarLoopResult]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2019-12-07 14:44:47,580 INFO L242 CegarLoopResult]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse20 (= 2 ~s_run_pc~0))) (let ((.cse6 (= 0 ~c_req_a~0)) (.cse7 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (= 0 ~c_req_type~0)) (.cse13 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse1 (<= ~m_run_pc~0 0)) (.cse21 (= 0 ~s_run_pc~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (= ~s_memory0~0 50)) (.cse14 (not .cse20)) (.cse4 (<= 2 ~s_run_pc~0)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (<= ~a_t~0 0)) (.cse17 (= ~m_run_pc~0 3)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 2 ~s_run_st~0)) (.cse18 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse19 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_m_lock~0 0)) (.cse12 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse10 .cse14 .cse4 .cse12 .cse5 .cse15) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 3 ULTIMATE.start_m_run_~a~0) (= ~s_memory1~0 51) .cse17 .cse5 .cse8 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse10 .cse18 (<= 52 ~c_req_d~0) .cse19 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse11 .cse20 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse12) (and .cse6 .cse7 .cse8 .cse0 .cse1 .cse9 .cse2 .cse3 .cse21 .cse11 .cse5 .cse12) (and (<= ~c_req_a~0 0) .cse13 (<= 0 ~c_req_a~0) .cse8 .cse1 .cse10 .cse21 .cse11 .cse12 .cse5 .cse15) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse16 (= ~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) (<= 2 ULTIMATE.start_m_run_~a~0) .cse17 .cse5 .cse8 .cse9 (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) .cse10 .cse18 (<= ~c_req_d~0 51) .cse19 .cse11 .cse20 .cse12) (and .cse10 .cse14 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse17 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse8 .cse9 (<= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse18 .cse19 .cse11 .cse20 .cse12 (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-12-07 14:44:47,581 INFO L246 CegarLoopResult]: For program point L861(lines 861 873) no Hoare annotation was computed. [2019-12-07 14:44:47,581 INFO L242 CegarLoopResult]: At program point L795(lines 788 805) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,581 INFO L246 CegarLoopResult]: For program point L729(lines 729 733) no Hoare annotation was computed. [2019-12-07 14:44:47,581 INFO L246 CegarLoopResult]: For program point L597(lines 597 601) no Hoare annotation was computed. [2019-12-07 14:44:47,581 INFO L246 CegarLoopResult]: For program point L333(lines 333 337) no Hoare annotation was computed. [2019-12-07 14:44:47,581 INFO L242 CegarLoopResult]: At program point L1324(lines 1317 1334) the Hoare annotation is: (let ((.cse9 (<= 2 ~s_run_pc~0)) (.cse16 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ~c_req_a~0 1)) (.cse19 (<= 1 ~c_req_a~0)) (.cse28 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse29 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ~s_memory0~0 50)) (.cse15 (= ~s_memory1~0 51)) (.cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse20 (= ~s_memory2~0 52)) (.cse27 (<= 2 ~c_req_a~0)) (.cse30 (<= ~c_req_a~0 2)) (.cse41 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse33 (<= ~m_run_pc~0 0)) (.cse13 (= 0 ~c_req_type~0)) (.cse35 (<= ~c_m_lock~0 0)) (.cse3 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 2 ~a_t~0)) (.cse36 (<= ~a_t~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse39 (<= 1 ~a_t~0)) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse40 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse22 (<= 3 ~m_run_pc~0)) (.cse42 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse23 (<= 1 ~c_req_type~0)) (.cse43 (<= 0 ~a_t~0)) (.cse24 (<= ~c_req_type~0 1)) (.cse34 (= 0 ~s_run_pc~0)) (.cse44 (<= ~a_t~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse45 (<= ~c_req_d~0 50)) (.cse31 (<= ~c_req_a~0 0)) (.cse46 (<= 50 ~c_req_d~0)) (.cse32 (<= 0 ~c_req_a~0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse21 (<= 1 ~c_m_lock~0)) (.cse6 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse6 .cse7) (and .cse11 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (= ULTIMATE.start_m_run_~a~0 1) .cse13 .cse14 .cse15 .cse16 (= ~req_tt_a~0 1) .cse17 .cse7 .cse18 .cse8 .cse19 .cse20 .cse1 .cse21 .cse5 .cse6 .cse22 (= ~a_t~0 1)) (and .cse23 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse24 .cse14 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse25 .cse26 .cse10 .cse3 .cse7 .cse27 .cse1 .cse28 (<= 52 ~c_req_d~0) .cse21 .cse29 (<= ~c_req_d~0 52) .cse5 .cse4 .cse6 .cse30) (and .cse2 (not .cse5) .cse9 .cse6 .cse7) (and .cse31 .cse32 .cse0 .cse33 .cse2 .cse34 .cse35 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse5 .cse6 .cse7) (and .cse23 .cse36 .cse24 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse10 .cse16 .cse7 .cse18 .cse37 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse19 .cse1 .cse38 .cse39 .cse28 (<= ~c_req_d~0 51) .cse21 .cse29 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse31 .cse32 .cse23 .cse2 .cse34 .cse10 .cse6 .cse7) (and .cse40 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse14 .cse15 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse41 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 (= ~req_tt_a~0 0) .cse28 .cse21 (= ~a_t~0 0) .cse29 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse5 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse6 .cse22 .cse42) (and .cse11 (= ~req_tt_a~0 2) .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse3 .cse17 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse7 .cse8 .cse20 .cse27 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse21 .cse5 .cse4 .cse6 .cse22 .cse30 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse40 .cse23 .cse43 .cse24 .cse44 .cse10 .cse7 .cse45 .cse31 .cse46 .cse32 .cse1 .cse21 .cse5 .cse6 .cse42) (and .cse41 .cse0 .cse43 .cse33 .cse1 .cse2 .cse13 .cse44 .cse5 .cse35 .cse7 .cse6) (and .cse41 .cse0 .cse43 .cse33 .cse1 .cse13 .cse44 .cse34 .cse35 .cse7 .cse6) (and (or (and .cse1 .cse2 .cse21 .cse3 .cse5 .cse4 .cse6 .cse22 .cse7) (and .cse1 .cse36 .cse2 .cse38 .cse39 .cse21 .cse5 .cse6 .cse22 .cse7 .cse37) (and .cse40 .cse1 .cse43 .cse2 .cse44 .cse21 .cse5 .cse6 .cse22 .cse7 .cse42)) .cse8) (and .cse23 .cse43 .cse24 .cse34 .cse44 .cse10 .cse7 .cse45 .cse31 .cse46 .cse32 (= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse21 .cse6))) [2019-12-07 14:44:47,581 INFO L246 CegarLoopResult]: For program point L135(lines 134 480) no Hoare annotation was computed. [2019-12-07 14:44:47,581 INFO L246 CegarLoopResult]: For program point L928(lines 928 932) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L796(lines 485 837) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L136(lines 136 140) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L797(lines 797 801) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L242 CegarLoopResult]: At program point L467(lines 460 477) the Hoare annotation is: (let ((.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= ~c_m_lock~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3 .cse4) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 (= ~s_memory1~0 51) .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) .cse4 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 .cse9 (<= 52 ~c_req_d~0) .cse10 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse1 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse1 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse5 (= ~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) .cse6 .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse2 .cse1 .cse3))) [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L864(lines 864 872) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L468(lines 460 477) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L72(lines 72 79) no Hoare annotation was computed. [2019-12-07 14:44:47,582 INFO L242 CegarLoopResult]: At program point L865(lines 860 1111) the Hoare annotation is: false [2019-12-07 14:44:47,582 INFO L242 CegarLoopResult]: At program point L667(lines 637 668) the Hoare annotation is: (let ((.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse1 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~c_req_a~0) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse2 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse3 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse13 (<= ~c_req_a~0 2)) (and .cse0 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (<= ULTIMATE.start_m_run_~a~0 1) .cse2 (= 51 ~c_rsp_d~0) .cse3 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse9 (<= ~c_req_a~0 1) .cse10 (<= 1 ~c_req_a~0) .cse11 .cse12 .cse13 (= ~a_t~0 1)) (and .cse5 .cse6 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_s_run_~req_a~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse10 .cse11 (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse1 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse2 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse3 (= ~a_t~0 0) .cse4 .cse13))) [2019-12-07 14:44:47,582 INFO L246 CegarLoopResult]: For program point L469(lines 469 473) no Hoare annotation was computed. [2019-12-07 14:44:47,583 INFO L242 CegarLoopResult]: At program point L1130(lines 1119 1160) the Hoare annotation is: (let ((.cse53 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse55 (= ~req_tt_a~0 0)) (.cse56 (= ~a_t~0 0)) (.cse58 (<= 52 ULTIMATE.start_s_run_~req_d~1)) (.cse59 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse33 (<= 52 ~c_req_d~0)) (.cse35 (<= ~c_req_d~0 52)) (.cse61 (<= ULTIMATE.start_s_run_~req_d~1 52)) (.cse24 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse26 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse41 (<= 51 ~c_req_d~0)) (.cse46 (<= ~c_req_d~0 51)) (.cse31 (<= 2 ~c_req_a~0)) (.cse60 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse64 (= ~req_tt_a~0 2)) (.cse66 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse62 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ~c_req_a~0 2)) (.cse12 (= ~req_tt_a~0 1)) (.cse67 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (= ~s_memory1~0 51)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse65 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (<= ~c_req_a~0 1)) (.cse16 (<= 1 ~c_req_a~0)) (.cse17 (= ~s_memory2~0 52)) (.cse22 (= ~a_t~0 1)) (.cse30 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse36 (<= 2 ~a_t~0)) (.cse39 (<= ~a_t~0 1)) (.cse44 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse45 (<= 1 ~a_t~0)) (.cse42 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 3 ~m_run_pc~0)) (.cse15 (= ~m_run_pc~0 6)) (.cse23 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse50 (= 0 ~s_run_pc~0)) (.cse48 (<= ~c_req_a~0 0)) (.cse49 (<= 0 ~c_req_a~0)) (.cse51 (= ULTIMATE.start_m_run_~a~0 0)) (.cse68 (<= ~m_run_pc~0 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse54 (= 0 ~c_req_a~0)) (.cse69 (<= ~c_m_lock~0 0)) (.cse57 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse70 (<= 0 ~a_t~0)) (.cse71 (<= ~a_t~0 0)) (.cse40 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse11 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse43 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse72 (<= ~c_req_d~0 50)) (.cse73 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse38 (<= 2 ~s_run_st~0)) (.cse32 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse34 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse52 (= ~m_run_st~0 0)) (.cse20 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse47 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse63 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse3 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse9 .cse26 .cse27 .cse28 .cse29 .cse2 .cse30 .cse4 .cse31 .cse18 .cse32 .cse33 .cse19 .cse34 .cse35 .cse20 .cse36 .cse3 .cse37) (and .cse38 (not .cse20) .cse1 .cse3 .cse4) (and .cse18 .cse38 .cse2 .cse20 .cse3 .cse4) (and .cse0 .cse18 .cse38 .cse30 .cse20 .cse36 .cse3 .cse4 .cse15) (and .cse23 .cse39 .cse25 .cse40 .cse41 .cse2 .cse11 .cse4 .cse14 .cse42 .cse43 .cse16 .cse18 .cse44 .cse45 .cse32 .cse46 .cse19 .cse34 .cse20 .cse3 .cse47) (and .cse48 .cse49 .cse23 .cse38 .cse50 .cse2 .cse3 .cse4) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse11 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse51 .cse38 (= 50 ~c_rsp_d~0) .cse19 .cse52 .cse20 .cse5 .cse7 .cse9 .cse10 .cse13 .cse15 .cse53 .cse54 .cse17 .cse18 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse55 .cse56 .cse3) (and .cse57 .cse58 .cse8 .cse9 .cse10 .cse4 .cse53 .cse15 .cse54 .cse59 .cse60 .cse18 .cse55 .cse32 .cse19 .cse56 .cse34 .cse61 .cse20 .cse62 .cse3 .cse21 .cse63) (and .cse5 .cse64 .cse7 .cse8 .cse9 .cse10 .cse28 .cse29 .cse30 .cse13 .cse65 .cse4 .cse15 .cse17 .cse31 .cse66 .cse18 .cse19 .cse20 .cse36 .cse3 .cse21 .cse37 .cse67) (and .cse58 .cse9 .cse10 .cse2 .cse30 .cse59 .cse0 .cse60 .cse18 .cse38 .cse33 .cse32 .cse19 .cse34 .cse35 .cse61 .cse52 .cse20 .cse36 .cse62 .cse3) (and .cse24 .cse39 .cse9 .cse26 .cse27 .cse28 .cse29 .cse41 .cse2 .cse42 .cse0 .cse18 .cse44 .cse45 .cse38 .cse32 .cse46 .cse19 .cse34 .cse52 .cse20 .cse3) (and .cse48 .cse49 .cse0 .cse68 .cse38 .cse50 .cse69 .cse52 .cse3 .cse4) (and (= 52 ~c_rsp_d~0) .cse8 (<= ULTIMATE.start_s_memory_read_~i 2) .cse30 .cse31 .cse0 (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse60 .cse38 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse19 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse52 .cse20 .cse5 .cse64 .cse7 .cse9 .cse10 .cse13 .cse15 .cse17 .cse66 .cse18 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse36 .cse62 .cse3 .cse37) (and .cse57 .cse23 .cse70 .cse25 .cse71 .cse2 .cse4 .cse72 .cse48 .cse73 .cse49 .cse18 .cse19 .cse20 .cse3 .cse63) (and .cse54 .cse0 .cse70 .cse68 .cse18 .cse8 .cse71 .cse50 .cse69 .cse4 .cse3) (and .cse8 .cse12 .cse42 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse44 .cse38 (= 51 ~c_rsp_d~0) .cse19 .cse52 .cse20 .cse67 .cse5 .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 .cse10 .cse28 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse29 .cse65 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse22) (and (or (and .cse18 .cse38 .cse19 .cse30 .cse20 .cse36 .cse3 .cse21 .cse4) (and .cse18 .cse39 .cse38 .cse44 .cse45 .cse19 .cse20 .cse3 .cse21 .cse4 .cse42) (and .cse57 .cse18 .cse70 .cse38 .cse71 .cse19 .cse20 .cse3 .cse21 .cse4 .cse63)) .cse15) (and .cse23 .cse70 .cse25 .cse50 .cse71 .cse2 .cse4 .cse72 .cse48 .cse73 .cse49 .cse51 .cse18 .cse19 .cse3) (and .cse68 .cse70 .cse8 .cse71 .cse1 .cse4 .cse54 .cse0 .cse18 .cse38 .cse69 .cse52 .cse3) (and .cse57 .cse70 .cse71 .cse40 .cse2 .cse11 .cse43 .cse72 .cse73 .cse0 .cse18 .cse38 .cse32 .cse19 .cse34 .cse52 .cse20 .cse3 .cse47 .cse63))) [2019-12-07 14:44:47,583 INFO L242 CegarLoopResult]: At program point L1064(lines 1057 1083) the Hoare annotation is: (let ((.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse1 (= 1 ~c_write_rsp_ev~0)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse2 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse3 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~a~0 1) .cse0 .cse1 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 51 ~c_rsp_d~0) .cse3 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse9 (<= ~c_req_a~0 1) .cse10 (<= 1 ~c_req_a~0) .cse11 .cse12 (= ~a_t~0 1)) (and .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse0 .cse7 .cse8 .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse11 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse3 (= ~a_t~0 0) .cse4))) [2019-12-07 14:44:47,583 INFO L246 CegarLoopResult]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2019-12-07 14:44:47,583 INFO L242 CegarLoopResult]: At program point L1197(lines 1190 1234) 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 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse2 .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 14:44:47,583 INFO L246 CegarLoopResult]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-12-07 14:44:47,583 INFO L246 CegarLoopResult]: For program point L867(lines 867 871) no Hoare annotation was computed. [2019-12-07 14:44:47,584 INFO L242 CegarLoopResult]: At program point L735(lines 728 745) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.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 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,584 INFO L242 CegarLoopResult]: At program point L603(lines 596 613) the Hoare annotation is: (let ((.cse2 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse6 (<= 2 ~s_run_st~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= ~s_memory0~0 50)) (.cse4 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse5 (= ~s_memory1~0 51)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory2~0 52)) (.cse0 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (or (and (<= ~m_run_pc~0 0) .cse0 .cse1) (and (= ~m_run_pc~0 3) .cse1 .cse0)) .cse2 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse7 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse8 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (and .cse6 (not .cse8) (<= 2 ~s_run_pc~0) .cse1 .cse0) (and .cse2 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~c_req_a~0) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 (<= ULTIMATE.start_s_memory_read_~i 1) .cse9 .cse10 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 .cse12 .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) .cse0 (= ~a_t~0 1) (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse6 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse0))) [2019-12-07 14:44:47,584 INFO L242 CegarLoopResult]: At program point L339(lines 332 376) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse0 (= ~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) .cse1 .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7 .cse8 .cse9 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse9 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse10) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 14:44:47,584 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2019-12-07 14:44:47,584 INFO L242 CegarLoopResult]: At program point L207(lines 177 208) the Hoare annotation is: (let ((.cse18 (= 0 ~s_run_pc~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse1 (= 2 ~s_run_pc~0)) (.cse9 (= ~m_run_pc~0 3)) (.cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse22 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= 0 ~a_t~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (<= ~m_run_pc~0 0)) (.cse16 (= 0 ~c_req_type~0)) (.cse17 (<= ~a_t~0 0)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse19 (= 0 ~c_req_a~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse23 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4) (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse3 .cse0 .cse5 .cse6 .cse7 .cse8 .cse1 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse9 (<= ULTIMATE.start_m_run_~req_a~0 2) .cse10 (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse11 .cse4) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 (= ULTIMATE.start_m_run_~a~0 0) .cse10 .cse6 .cse7 .cse8 .cse20 .cse4 .cse21) (and .cse22 .cse14 .cse15 .cse0 .cse18 .cse8 .cse4 .cse3 .cse23 .cse21) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= 1 ULTIMATE.start_m_run_~a~0) .cse0 (<= ULTIMATE.start_m_run_~a~0 1) .cse5 .cse6 .cse7 .cse8 .cse1 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 .cse9 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse10 .cse11 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse12 .cse22 .cse13 .cse15 .cse14 .cse16 .cse17 .cse2 .cse3 .cse19 .cse10 .cse0 .cse6 .cse7 .cse8 .cse20 .cse4 .cse21 .cse23))) [2019-12-07 14:44:47,584 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L242 CegarLoopResult]: At program point L934(lines 927 962) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse26 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse24 (= ~m_run_pc~0 3)) (.cse8 (<= ~c_req_a~0 1)) (.cse10 (<= 1 ~c_req_a~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.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 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse28 (<= 2 ~c_req_a~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse29 (<= 2 ~a_t~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (<= ~c_req_a~0 2))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~a_t~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse11 .cse12 .cse19 .cse13 (= ~req_tt_a~0 0) .cse15 (= ~a_t~0 0) .cse16 .cse17) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse19 (<= 0 ~a_t~0) .cse13 (let ((.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse12 .cse22 .cse23 (= 0 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6) (and .cse20 .cse21 .cse12 .cse22 .cse23 (<= 2 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6))) .cse25 (<= ~a_t~0 0) .cse15 .cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse25 .cse3 .cse4 .cse24 .cse27 .cse6 .cse26 .cse28 (<= ULTIMATE.start_s_memory_write_~v 51) .cse12 .cse13 .cse23 (<= 52 ~c_req_d~0) .cse15 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse16 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse29 .cse17 .cse30) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse22 .cse25 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 .cse12 .cse14 .cse23 .cse15 .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse3 (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse24 .cse8 .cse10 .cse13 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse17) (and .cse0 (= ~req_tt_a~0 2) .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse6 .cse9 .cse11 .cse28 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse13 .cse15 .cse16 .cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse17 .cse30 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 14:44:47,585 INFO L242 CegarLoopResult]: At program point L868(lines 860 1111) the Hoare annotation is: (let ((.cse4 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= 2 ~c_req_a~0)) (.cse10 (<= 2 ~a_t~0)) (.cse13 (<= ~c_req_a~0 2)) (.cse19 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse1 (<= ~c_req_type~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse20 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse15 (= 0 ~c_req_type~0)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (= ~s_memory1~0 51)) (.cse16 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse21 (<= ~c_req_a~0 1)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse17 (= ~m_run_pc~0 6)) (.cse23 (<= 1 ~c_req_a~0)) (.cse18 (= ~s_memory2~0 52)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse24 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_memory_write_~v 51) .cse8 (<= 52 ~c_req_d~0) .cse9 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) .cse10 .cse11 .cse12 .cse13) (and (= ~c_empty_req~0 1) (<= 2 ~s_run_pc~0) .cse5 .cse12 .cse6) (and .cse14 (= ~req_tt_a~0 2) .cse15 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse16 .cse6 .cse17 .cse18 .cse7 .cse8 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse11 .cse10 .cse12 .cse13 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse14 .cse19 .cse15 .cse2 .cse3 .cse16 .cse6 .cse17 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse18 (= 0 ~c_req_a~0) .cse8 (= ~req_tt_a~0 0) .cse9 (= ~a_t~0 0) .cse11 .cse12 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse0 (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse5 .cse6 .cse21 .cse22 .cse23 .cse8 .cse24 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse9 .cse11 .cse12) (and .cse19 .cse0 (<= 0 ~a_t~0) .cse1 (<= ~a_t~0 0) .cse5 .cse6 (<= ~c_req_d~0 50) (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) (<= 50 ~c_req_d~0) .cse8 .cse9 .cse11 .cse12 .cse20) (and .cse14 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse15 .cse2 .cse3 (= ~req_tt_a~0 1) .cse16 .cse6 .cse21 .cse22 .cse17 .cse23 .cse18 .cse8 .cse24 .cse9 .cse11 .cse12 (= ~a_t~0 1)))) [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point L736(lines 728 745) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point L604(lines 485 837) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point L406(lines 406 459) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point L76(lines 76 79) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,585 INFO L246 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L1001-1(lines 876 1106) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L737(lines 737 741) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L605(lines 605 609) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L242 CegarLoopResult]: At program point L275(lines 268 285) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse4 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= 1 ~c_req_type~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (= 0 ~s_run_pc~0)) (.cse1 (not .cse13)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2 .cse3) (and (<= ULTIMATE.start_m_run_~req_d~0 50) .cse4 .cse5 (<= 0 ~a_t~0) .cse6 (<= ~c_req_type~0 1) (<= ~a_t~0 0) .cse7 .cse1 .cse3 (<= ~c_req_d~0 50) .cse8 (<= 50 ~c_req_d~0) .cse9 (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) .cse10 (<= 50 ULTIMATE.start_m_run_~req_d~0) .cse2 .cse11 .cse12) (and .cse0 .cse13 .cse3 .cse2) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse3 .cse8 .cse9 .cse0 .cse10 .cse2 .cse11 .cse12)))) [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L246 CegarLoopResult]: For program point L936(lines 936 940) no Hoare annotation was computed. [2019-12-07 14:44:47,586 INFO L242 CegarLoopResult]: At program point L11-3(lines 1 1376) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse13 (<= ~c_req_a~0 2)) (and .cse5 (<= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse0 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 (= 0 ~c_req_a~0) .cse2 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse3 (= ULTIMATE.start_s_memory_read_~i 0) .cse4 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) .cse10 (<= 1 ~c_req_a~0) .cse11 .cse12 .cse13 (= ~a_t~0 1)))) [2019-12-07 14:44:47,587 INFO L242 CegarLoopResult]: At program point L11-4(lines 70 82) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse12 (<= 0 ~a_t~0)) (.cse13 (<= ~a_t~0 0)) (.cse14 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ~c_req_d~0 50)) (.cse18 (<= 50 ~c_req_d~0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse4 (= ~c_empty_req~0 1)) (.cse1 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse10 (= 2 ~s_run_pc~0)) (.cse7 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 .cse8 .cse9 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse10 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse11) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse0 (= ~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) .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_m_run_~a~0) .cse4 .cse5 .cse6 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse7 (<= ~c_req_d~0 51) .cse8 .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse16 .cse17 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 ULTIMATE.start_m_run_~a~0) .cse19) (and (<= 1 ~c_req_type~0) .cse12 (<= ~c_req_type~0 1) .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse18 (= ULTIMATE.start_m_run_~a~0 0) .cse5 .cse6 (let ((.cse20 (not .cse10))) (or (and .cse4 .cse20 (= 0 ~s_run_pc~0) .cse1 .cse11 .cse2) (and .cse4 .cse20 (<= 2 ~s_run_pc~0) .cse1 .cse11 .cse2))) .cse7 .cse8 .cse9 .cse19))) [2019-12-07 14:44:47,587 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 14:44:47,587 INFO L246 CegarLoopResult]: For program point L276(lines 268 285) no Hoare annotation was computed. [2019-12-07 14:44:47,587 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1007) no Hoare annotation was computed. [2019-12-07 14:44:47,587 INFO L246 CegarLoopResult]: For program point L277(lines 277 281) no Hoare annotation was computed. [2019-12-07 14:44:47,587 INFO L242 CegarLoopResult]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse14 (<= 2 ~s_run_pc~0)) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse9 (<= 0 ~a_t~0)) (.cse18 (= 0 ~c_req_type~0)) (.cse0 (<= ~a_t~0 0)) (.cse19 (= 0 ~c_req_a~0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse5 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ~m_run_pc~0 0)) (.cse16 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse23 (= 0 ~s_run_pc~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse6 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse7 (<= ~c_m_lock~0 0)) (.cse13 (<= 2 ~c_write_rsp_ev~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse0 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 .cse2 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 (<= 51 ULTIMATE.start_m_run_~req_d~0) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 50 ~c_req_d~0) .cse11 .cse12 .cse13 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse3 (not .cse8) .cse14 .cse13 .cse1) (and .cse15 .cse16 .cse9 .cse17 .cse18 .cse0 .cse14 .cse1 .cse19 .cse2 .cse20 .cse11 .cse3 .cse5 .cse6 .cse21 .cse7 .cse13 .cse22) (and .cse15 .cse16 .cse9 .cse17 .cse18 .cse0 .cse23 .cse1 .cse19 .cse2 .cse20 .cse11 .cse5 .cse6 .cse21 .cse7 .cse13 .cse22) (and (<= 2 ULTIMATE.start_m_run_~req_a~0) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 52 ULTIMATE.start_m_run_~req_d~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 51 ~c_req_d~0) .cse10 (<= ULTIMATE.start_m_run_~req_a~0 2) .cse11 (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse12 .cse13) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse17 .cse16 .cse23 .cse1 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse2 .cse3 .cse6 .cse7 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0) .cse22))) [2019-12-07 14:44:47,587 INFO L246 CegarLoopResult]: For program point L674(lines 674 727) no Hoare annotation was computed. [2019-12-07 14:44:47,587 INFO L246 CegarLoopResult]: For program point L146(lines 145 173) no Hoare annotation was computed. [2019-12-07 14:44:47,587 INFO L246 CegarLoopResult]: For program point L675(lines 675 679) no Hoare annotation was computed. [2019-12-07 14:44:47,588 INFO L242 CegarLoopResult]: At program point L1270(lines 1263 1316) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse10 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_a~0 1)) (.cse14 (<= 1 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ~s_memory2~0 52)) (.cse25 (<= 2 ~c_req_a~0)) (.cse29 (<= ~c_req_a~0 2)) (.cse41 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse33 (<= ~m_run_pc~0 0)) (.cse7 (= 0 ~c_req_type~0)) (.cse35 (<= ~c_m_lock~0 0)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~a_t~0)) (.cse36 (<= ~a_t~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse39 (<= 1 ~a_t~0)) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse40 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 2 ~s_run_st~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse19 (<= 3 ~m_run_pc~0)) (.cse42 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse20 (<= 1 ~c_req_type~0)) (.cse43 (<= 0 ~a_t~0)) (.cse21 (<= ~c_req_type~0 1)) (.cse34 (= 0 ~s_run_pc~0)) (.cse44 (<= ~a_t~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse45 (<= ~c_req_d~0 50)) (.cse31 (<= ~c_req_a~0 0)) (.cse46 (<= 50 ~c_req_d~0)) (.cse32 (<= 0 ~c_req_a~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 .cse10 (= ~req_tt_a~0 1) .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 (= ~a_t~0 1)) (and .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse21 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse23 .cse2 .cse24 .cse4 .cse25 .cse16 .cse26 (<= 52 ~c_req_d~0) .cse17 .cse27 (<= ~c_req_d~0 52) .cse18 .cse28 .cse3 .cse29) (and .cse30 (not .cse18) .cse1 .cse3 .cse4) (and .cse31 .cse32 .cse0 .cse33 .cse30 .cse34 .cse35 .cse3 .cse4) (and .cse16 .cse30 .cse2 .cse18 .cse3 .cse4) (and .cse0 .cse16 .cse30 .cse24 .cse18 .cse28 .cse3 .cse4 .cse13) (and .cse20 .cse36 .cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse2 .cse10 .cse4 .cse12 .cse37 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse16 .cse38 .cse39 .cse26 (<= ~c_req_d~0 51) .cse17 .cse27 .cse18 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse31 .cse32 .cse20 .cse30 .cse34 .cse2 .cse3 .cse4) (and .cse40 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse41 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 (= ~req_tt_a~0 0) .cse26 .cse17 (= ~a_t~0 0) .cse27 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3 .cse19 .cse42) (and .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse4 .cse13 .cse15 .cse25 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse28 .cse3 .cse19 .cse29 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse40 .cse20 .cse43 .cse21 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 .cse16 .cse17 .cse18 .cse3 .cse42) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse30 .cse7 .cse44 .cse18 .cse35 .cse4 .cse3) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse7 .cse44 .cse34 .cse35 .cse4 .cse3) (and (or (and .cse16 .cse30 .cse17 .cse24 .cse18 .cse28 .cse3 .cse19 .cse4) (and .cse16 .cse36 .cse30 .cse38 .cse39 .cse17 .cse18 .cse3 .cse19 .cse4 .cse37) (and .cse40 .cse16 .cse43 .cse30 .cse44 .cse17 .cse18 .cse3 .cse19 .cse4 .cse42)) .cse13) (and .cse20 .cse43 .cse21 .cse34 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse3))) [2019-12-07 14:44:47,588 INFO L246 CegarLoopResult]: For program point L147(lines 147 151) no Hoare annotation was computed. [2019-12-07 14:44:47,588 INFO L242 CegarLoopResult]: At program point L1072(lines 1065 1082) the Hoare annotation is: (let ((.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= 0 ~c_req_type~0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse1 (= 1 ~c_write_rsp_ev~0)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse2 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (= 2 ~s_run_pc~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 .cse1 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse3 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~a~0 1) .cse0 .cse1 (= ~req_tt_a~0 1) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 51 ~c_rsp_d~0) .cse3 .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse9 (<= ~c_req_a~0 1) .cse10 (<= 1 ~c_req_a~0) .cse11 .cse12 (= ~a_t~0 1)) (and .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse6 .cse0 .cse7 .cse8 .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse11 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse3 (= ~a_t~0 0) .cse4))) [2019-12-07 14:44:47,588 INFO L246 CegarLoopResult]: For program point L214(lines 214 267) no Hoare annotation was computed. [2019-12-07 14:44:47,588 INFO L242 CegarLoopResult]: At program point L1205(lines 1198 1233) 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 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse2 .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 14:44:47,588 INFO L246 CegarLoopResult]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2019-12-07 14:44:47,588 INFO L242 CegarLoopResult]: At program point L413(lines 406 459) the Hoare annotation is: (let ((.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= ~c_m_lock~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3 .cse4) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 (= ~s_memory1~0 51) .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) .cse4 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 .cse9 (<= 52 ~c_req_d~0) .cse10 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse1 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse1 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse5 (= ~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) .cse6 .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse2 .cse1 .cse3))) [2019-12-07 14:44:47,588 INFO L242 CegarLoopResult]: At program point L347(lines 340 375) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse0 (= ~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) .cse1 .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7 .cse8 .cse9 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse9 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse10) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 14:44:47,588 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2019-12-07 14:44:47,589 INFO L246 CegarLoopResult]: For program point L1338-1(lines 1170 1349) no Hoare annotation was computed. [2019-12-07 14:44:47,589 INFO L246 CegarLoopResult]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2019-12-07 14:44:47,589 INFO L246 CegarLoopResult]: For program point L215(lines 215 219) no Hoare annotation was computed. [2019-12-07 14:44:47,589 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2019-12-07 14:44:47,589 INFO L242 CegarLoopResult]: At program point L942(lines 935 961) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse26 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse24 (= ~m_run_pc~0 3)) (.cse8 (<= ~c_req_a~0 1)) (.cse10 (<= 1 ~c_req_a~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.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 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse28 (<= 2 ~c_req_a~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse29 (<= 2 ~a_t~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (<= ~c_req_a~0 2))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~a_t~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse11 .cse12 .cse19 .cse13 (= ~req_tt_a~0 0) .cse15 (= ~a_t~0 0) .cse16 .cse17) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse19 (<= 0 ~a_t~0) .cse13 (let ((.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse12 .cse22 .cse23 (= 0 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6) (and .cse20 .cse21 .cse12 .cse22 .cse23 (<= 2 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6))) .cse25 (<= ~a_t~0 0) .cse15 .cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse25 .cse3 .cse4 .cse24 .cse27 .cse6 .cse26 .cse28 (<= ULTIMATE.start_s_memory_write_~v 51) .cse12 .cse13 .cse23 (<= 52 ~c_req_d~0) .cse15 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse16 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse29 .cse17 .cse30) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse22 .cse25 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 .cse12 .cse14 .cse23 .cse15 .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse3 (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse24 .cse8 .cse10 .cse13 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse17) (and .cse0 (= ~req_tt_a~0 2) .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse6 .cse9 .cse11 .cse28 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse13 .cse15 .cse16 .cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse17 .cse30 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 14:44:47,589 INFO L242 CegarLoopResult]: At program point L876-1(lines 860 1111) the Hoare annotation is: (let ((.cse19 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse8 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse27 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse28 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (= ~s_memory1~0 51)) (.cse31 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse32 (= ~m_run_pc~0 6)) (.cse33 (= ~s_memory2~0 52)) (.cse14 (<= 2 ~a_t~0)) (.cse15 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (= 0 ~c_req_type~0)) (.cse5 (= ~s_memory0~0 50)) (.cse29 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse30 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse24 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse25 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse10 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse13 (= ~m_run_st~0 0)) (.cse20 (<= ~c_req_d~0 50)) (.cse26 (= 2 ~s_run_pc~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse34 (<= ~c_req_a~0 0)) (.cse35 (<= 0 ~c_req_a~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse16 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= 50 ~c_req_d~0)) (.cse17 (<= 0 ~a_t~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= ~a_t~0 0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse22 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 .cse2 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse8 .cse9 .cse10 (<= 52 ~c_req_d~0) .cse11 .cse12 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse13 .cse14 .cse15 .cse3) (and .cse16 .cse17 .cse18 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse19 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse20 .cse21 .cse0 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse22) (and .cse23 (= ~req_tt_a~0 1) .cse24 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse25 (= 51 ~c_rsp_d~0) .cse11 .cse13 .cse26 (<= ULTIMATE.start_s_memory_read_~i 1) .cse27 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse28 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse29 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse30 .cse31 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) .cse32 (<= 1 ~c_req_a~0) .cse33 .cse9 .cse3 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse23 .cse19 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse0 (= 50 ~c_rsp_d~0) .cse11 .cse13 .cse26 .cse22 .cse27 .cse16 .cse28 .cse5 .cse6 .cse31 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse32 .cse33 (= 0 ~c_req_a~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse3) (and (= 52 ~c_rsp_d~0) .cse23 (<= ULTIMATE.start_s_memory_read_~i 2) .cse7 (<= 2 ~c_req_a~0) .cse0 (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse8 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse11 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse13 .cse26 .cse27 (= ~req_tt_a~0 2) .cse28 .cse5 .cse6 .cse31 .cse32 .cse33 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse15 .cse3 (<= ~c_req_a~0 2)) (and .cse34 .cse35 .cse0 .cse9 .cse17 (<= ~m_run_pc~0 0) .cse23 .cse18 (<= ~c_m_lock~0 0) .cse3 .cse4) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse29 .cse30 (<= 51 ~c_req_d~0) .cse2 .cse24 .cse0 .cse9 .cse25 (<= 1 ~a_t~0) .cse10 (<= ~c_req_d~0 51) .cse11 .cse12 .cse13 .cse3) (and .cse20 (let ((.cse36 (<= 1 ~c_req_type~0))) (or (and .cse34 .cse35 .cse36 (not .cse26) .cse1 .cse2 .cse3 .cse4) (and .cse34 .cse35 .cse36 (= 0 ~s_run_pc~0) .cse2 .cse3 .cse4))) .cse16 .cse21 .cse17 .cse9 (<= ~c_req_type~0 1) .cse18 .cse11 .cse22))) [2019-12-07 14:44:47,589 INFO L246 CegarLoopResult]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2019-12-07 14:44:47,589 INFO L246 CegarLoopResult]: For program point L811(lines 811 815) no Hoare annotation was computed. [2019-12-07 14:44:47,590 INFO L242 CegarLoopResult]: At program point L481(lines 133 482) 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 (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 50) (<= 3 ULTIMATE.start_m_run_~a~0) (= ~s_memory1~0 51) (= ~m_run_pc~0 3) .cse0 (= ~c_empty_req~0 1) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= 2 ~c_write_req_ev~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse1 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse3 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse4) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 14:44:47,590 INFO L246 CegarLoopResult]: For program point L415(lines 415 419) no Hoare annotation was computed. [2019-12-07 14:44:47,590 INFO L246 CegarLoopResult]: For program point L349(lines 349 353) no Hoare annotation was computed. [2019-12-07 14:44:47,590 INFO L246 CegarLoopResult]: For program point L944(lines 944 948) no Hoare annotation was computed. [2019-12-07 14:44:47,590 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:44:47,590 INFO L246 CegarLoopResult]: For program point L879-1(lines 876 1106) no Hoare annotation was computed. [2019-12-07 14:44:47,590 INFO L246 CegarLoopResult]: For program point L747(lines 747 753) no Hoare annotation was computed. [2019-12-07 14:44:47,590 INFO L242 CegarLoopResult]: At program point L747-1(lines 747 753) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (= ~s_memory1~0 51)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse10 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse13 (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 (= 50 ~c_rsp_d~0) .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) .cse5 (<= ULTIMATE.start_m_run_~a~0 0) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 (= 0 ~c_req_a~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse13) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse5 .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse9 (<= ~c_req_a~0 1) .cse10 (<= 1 ~c_req_a~0) .cse11 .cse12 .cse13 (= ~a_t~0 1)))) [2019-12-07 14:44:47,590 INFO L242 CegarLoopResult]: At program point L681(lines 674 727) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.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 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,590 INFO L246 CegarLoopResult]: For program point L880(lines 879 903) no Hoare annotation was computed. [2019-12-07 14:44:47,591 INFO L242 CegarLoopResult]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse55 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse57 (= ~req_tt_a~0 0)) (.cse58 (= ~a_t~0 0)) (.cse60 (<= 52 ULTIMATE.start_s_run_~req_d~1)) (.cse61 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1)) (.cse33 (<= 52 ~c_req_d~0)) (.cse35 (<= ~c_req_d~0 52)) (.cse63 (<= ULTIMATE.start_s_run_~req_d~1 52)) (.cse24 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse26 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse46 (<= 51 ~c_req_d~0)) (.cse51 (<= ~c_req_d~0 51)) (.cse31 (<= 2 ~c_req_a~0)) (.cse62 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse66 (= ~req_tt_a~0 2)) (.cse68 (= 2 ULTIMATE.start_m_run_~req_a___0~0)) (.cse64 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse37 (<= ~c_req_a~0 2)) (.cse56 (= 0 ~c_req_a~0)) (.cse41 (<= ~m_run_pc~0 0)) (.cse43 (<= ~c_m_lock~0 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse12 (= ~req_tt_a~0 1)) (.cse69 (<= ULTIMATE.start_s_memory_read_~i 1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (= ~s_memory1~0 51)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse29 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse67 (<= 1 ULTIMATE.start_s_memory_read_~i)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse14 (<= ~c_req_a~0 1)) (.cse16 (<= 1 ~c_req_a~0)) (.cse17 (= ~s_memory2~0 52)) (.cse22 (= ~a_t~0 1)) (.cse30 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse36 (<= 2 ~a_t~0)) (.cse44 (<= ~a_t~0 1)) (.cse49 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse50 (<= 1 ~a_t~0)) (.cse47 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 3 ~m_run_pc~0)) (.cse15 (= ~m_run_pc~0 6)) (.cse23 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse42 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse39 (<= ~c_req_a~0 0)) (.cse40 (<= 0 ~c_req_a~0)) (.cse53 (= ULTIMATE.start_m_run_~a~0 0)) (.cse59 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse70 (<= 0 ~a_t~0)) (.cse71 (<= ~a_t~0 0)) (.cse45 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse11 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse48 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse72 (<= ~c_req_d~0 50)) (.cse73 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse38 (<= 2 ~s_run_st~0)) (.cse32 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse34 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse54 (= ~m_run_st~0 0)) (.cse20 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse52 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse65 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse3 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse9 .cse26 .cse27 .cse28 .cse29 .cse2 .cse30 .cse4 .cse31 .cse18 .cse32 .cse33 .cse19 .cse34 .cse35 .cse20 .cse36 .cse3 .cse37) (and .cse38 (not .cse20) .cse1 .cse3 .cse4) (and .cse18 .cse38 .cse2 .cse20 .cse3 .cse4) (and .cse39 .cse40 .cse0 .cse41 .cse38 .cse42 .cse43 .cse3 .cse4) (and .cse0 .cse18 .cse38 .cse30 .cse20 .cse36 .cse3 .cse4 .cse15) (and .cse23 .cse44 .cse25 .cse45 .cse46 .cse2 .cse11 .cse4 .cse14 .cse47 .cse48 .cse16 .cse18 .cse49 .cse50 .cse32 .cse51 .cse19 .cse34 .cse20 .cse3 .cse52) (and .cse39 .cse40 .cse23 .cse38 .cse42 .cse2 .cse3 .cse4) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse11 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse53 .cse38 (= 50 ~c_rsp_d~0) .cse19 .cse54 .cse20 .cse5 .cse7 .cse9 .cse10 .cse13 .cse15 .cse55 .cse56 .cse17 .cse18 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse57 .cse58 .cse3) (and .cse59 .cse60 .cse8 .cse9 .cse10 .cse4 .cse55 .cse15 .cse56 .cse61 .cse62 .cse18 .cse57 .cse32 .cse19 .cse58 .cse34 .cse63 .cse20 .cse64 .cse3 .cse21 .cse65) (and .cse5 .cse66 .cse7 .cse8 .cse9 .cse10 .cse28 .cse29 .cse30 .cse13 .cse67 .cse4 .cse15 .cse17 .cse31 .cse68 .cse18 .cse19 .cse20 .cse36 .cse3 .cse21 .cse37 .cse69) (and .cse60 .cse9 .cse10 .cse2 .cse30 .cse61 .cse0 .cse62 .cse18 .cse38 .cse33 .cse32 .cse19 .cse34 .cse35 .cse63 .cse54 .cse20 .cse36 .cse64 .cse3) (and .cse24 .cse44 .cse9 .cse26 .cse27 .cse28 .cse29 .cse46 .cse2 .cse47 .cse0 .cse18 .cse49 .cse50 .cse38 .cse32 .cse51 .cse19 .cse34 .cse54 .cse20 .cse3) (and (= 52 ~c_rsp_d~0) .cse8 (<= ULTIMATE.start_s_memory_read_~i 2) .cse30 .cse31 .cse0 (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse62 .cse38 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse19 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse54 .cse20 .cse5 .cse66 .cse7 .cse9 .cse10 .cse13 .cse15 .cse17 .cse68 .cse18 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse36 .cse64 .cse3 .cse37) (and .cse59 .cse23 .cse70 .cse25 .cse71 .cse2 .cse4 .cse72 .cse39 .cse73 .cse40 .cse18 .cse19 .cse20 .cse3 .cse65) (and .cse56 .cse0 .cse70 .cse41 .cse18 .cse38 .cse8 .cse71 .cse20 .cse43 .cse4 .cse3) (and .cse56 .cse0 .cse70 .cse41 .cse18 .cse8 .cse71 .cse42 .cse43 .cse4 .cse3) (and .cse8 .cse12 .cse47 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse49 .cse38 (= 51 ~c_rsp_d~0) .cse19 .cse54 .cse20 .cse69 .cse5 .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 .cse10 .cse28 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse29 .cse67 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse22) (and (or (and .cse18 .cse38 .cse19 .cse30 .cse20 .cse36 .cse3 .cse21 .cse4) (and .cse18 .cse44 .cse38 .cse49 .cse50 .cse19 .cse20 .cse3 .cse21 .cse4 .cse47) (and .cse59 .cse18 .cse70 .cse38 .cse71 .cse19 .cse20 .cse3 .cse21 .cse4 .cse65)) .cse15) (and .cse23 .cse70 .cse25 .cse42 .cse71 .cse2 .cse4 .cse72 .cse39 .cse73 .cse40 .cse53 .cse18 .cse19 .cse3) (and .cse59 .cse70 .cse71 .cse45 .cse2 .cse11 .cse48 .cse72 .cse73 .cse0 .cse18 .cse38 .cse32 .cse19 .cse34 .cse54 .cse20 .cse3 .cse52 .cse65))) [2019-12-07 14:44:47,591 INFO L246 CegarLoopResult]: For program point L881(lines 881 885) no Hoare annotation was computed. [2019-12-07 14:44:47,591 INFO L246 CegarLoopResult]: For program point L683(lines 683 687) no Hoare annotation was computed. [2019-12-07 14:44:47,591 INFO L242 CegarLoopResult]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse0 (= 0 ~c_req_type~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse13 (= ~s_memory2~0 52)) (.cse18 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= 3 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= 2 ~a_t~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse3 (<= 2 ~s_run_st~0)) (.cse16 (not .cse5)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 2) (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse10 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 .cse14 .cse15 (= ~a_t~0 1)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse16 .cse17 .cse4 .cse15 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 .cse18 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse14 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse3 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse4 .cse5 .cse19 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse15) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse13 .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15) (and .cse14 .cse3 .cse20 .cse18 .cse5 .cse4 .cse19 .cse15 .cse1) (and .cse2 .cse14 .cse3 .cse20 .cse4 .cse5 .cse19 .cse15 .cse1 .cse12) (and .cse3 .cse16 .cse17 .cse4 .cse15 (<= 3 ~m_run_pc~0) .cse1)))) [2019-12-07 14:44:47,592 INFO L242 CegarLoopResult]: At program point L1278(lines 1271 1315) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse10 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_a~0 1)) (.cse14 (<= 1 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ~s_memory2~0 52)) (.cse25 (<= 2 ~c_req_a~0)) (.cse29 (<= ~c_req_a~0 2)) (.cse41 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse33 (<= ~m_run_pc~0 0)) (.cse7 (= 0 ~c_req_type~0)) (.cse35 (<= ~c_m_lock~0 0)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~a_t~0)) (.cse36 (<= ~a_t~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse39 (<= 1 ~a_t~0)) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse40 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 2 ~s_run_st~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse19 (<= 3 ~m_run_pc~0)) (.cse42 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse20 (<= 1 ~c_req_type~0)) (.cse43 (<= 0 ~a_t~0)) (.cse21 (<= ~c_req_type~0 1)) (.cse34 (= 0 ~s_run_pc~0)) (.cse44 (<= ~a_t~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse45 (<= ~c_req_d~0 50)) (.cse31 (<= ~c_req_a~0 0)) (.cse46 (<= 50 ~c_req_d~0)) (.cse32 (<= 0 ~c_req_a~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 .cse10 (= ~req_tt_a~0 1) .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 (= ~a_t~0 1)) (and .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse21 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse23 .cse2 .cse24 .cse4 .cse25 .cse16 .cse26 (<= 52 ~c_req_d~0) .cse17 .cse27 (<= ~c_req_d~0 52) .cse18 .cse28 .cse3 .cse29) (and .cse30 (not .cse18) .cse1 .cse3 .cse4) (and .cse31 .cse32 .cse0 .cse33 .cse30 .cse34 .cse35 .cse3 .cse4) (and .cse16 .cse30 .cse2 .cse18 .cse3 .cse4) (and .cse0 .cse16 .cse30 .cse24 .cse18 .cse28 .cse3 .cse4 .cse13) (and .cse20 .cse36 .cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse2 .cse10 .cse4 .cse12 .cse37 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse16 .cse38 .cse39 .cse26 (<= ~c_req_d~0 51) .cse17 .cse27 .cse18 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse31 .cse32 .cse20 .cse30 .cse34 .cse2 .cse3 .cse4) (and .cse40 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse41 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 (= ~req_tt_a~0 0) .cse26 .cse17 (= ~a_t~0 0) .cse27 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3 .cse19 .cse42) (and .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse4 .cse13 .cse15 .cse25 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse28 .cse3 .cse19 .cse29 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse40 .cse20 .cse43 .cse21 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 .cse16 .cse17 .cse18 .cse3 .cse42) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse30 .cse7 .cse44 .cse18 .cse35 .cse4 .cse3) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse7 .cse44 .cse34 .cse35 .cse4 .cse3) (and (or (and .cse16 .cse30 .cse17 .cse24 .cse18 .cse28 .cse3 .cse19 .cse4) (and .cse16 .cse36 .cse30 .cse38 .cse39 .cse17 .cse18 .cse3 .cse19 .cse4 .cse37) (and .cse40 .cse16 .cse43 .cse30 .cse44 .cse17 .cse18 .cse3 .cse19 .cse4 .cse42)) .cse13) (and .cse20 .cse43 .cse21 .cse34 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse3))) [2019-12-07 14:44:47,592 INFO L242 CegarLoopResult]: At program point L221(lines 214 267) the Hoare annotation is: (let ((.cse15 (= 0 ~s_run_pc~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse12 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (<= ~m_run_pc~0 0)) (.cse23 (<= ~c_req_d~0 50)) (.cse16 (<= ~c_req_a~0 0)) (.cse24 (<= 50 ~c_req_d~0)) (.cse17 (<= 0 ~c_req_a~0)) (.cse25 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse1 (<= ~c_req_type~0 1)) (.cse22 (<= ~a_t~0 0)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~s_run_st~0)) (.cse5 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse21 (<= 0 ~a_t~0)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse1 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse2 (<= 2 ULTIMATE.start_m_run_~a~0) .cse3 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 2 ~c_req_a~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_req_d~0 52) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse9 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= 52 ~c_req_d~0) .cse10 .cse11 (<= ~c_req_a~0 2)) (and .cse12 .cse0 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse4 .cse8 .cse11 .cse18 .cse19) (and .cse20 .cse0 .cse21 .cse13 .cse14 .cse1 .cse22 .cse15 .cse3 .cse23 .cse16 .cse17 .cse24 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse25 .cse11 .cse19) (and .cse4 (not (= 2 ~s_run_pc~0)) .cse2 .cse3 .cse11) (and .cse20 .cse12 .cse0 .cse21 .cse13 .cse14 .cse1 .cse22 .cse2 .cse3 .cse23 .cse16 .cse24 .cse17 .cse4 .cse6 .cse7 .cse8 .cse25 .cse11 .cse19 .cse18) (and .cse0 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse1 .cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 (<= ULTIMATE.start_m_run_~a~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse21 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) .cse9 (<= ~c_req_a~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= ~c_req_d~0 51) .cse10 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 14:44:47,592 INFO L246 CegarLoopResult]: For program point L486(lines 485 837) no Hoare annotation was computed. [2019-12-07 14:44:47,592 INFO L249 CegarLoopResult]: At program point L1345(lines 1167 1350) the Hoare annotation is: true [2019-12-07 14:44:47,592 INFO L242 CegarLoopResult]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse18 (= 2 ~s_run_pc~0))) (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse22 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= 52 ~c_req_d~0)) (.cse24 (<= ~c_req_d~0 52)) (.cse27 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (= ~s_memory0~0 50)) (.cse29 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse2 (= ~m_run_pc~0 3)) (.cse0 (= ~c_empty_req~0 1)) (.cse31 (<= 1 ~a_t~0)) (.cse32 (<= ~a_t~0 1)) (.cse8 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse33 (<= 51 ~c_req_d~0)) (.cse9 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse34 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse35 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse36 (<= ~c_req_d~0 51)) (.cse15 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse14 (<= 2 ~s_run_st~0)) (.cse37 (= 0 ~s_run_pc~0)) (.cse25 (not .cse18)) (.cse5 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse26 (<= 1 ~c_req_type~0)) (.cse6 (<= 0 ~a_t~0)) (.cse28 (<= ~c_req_type~0 1)) (.cse7 (<= ~a_t~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse11 (<= ~c_req_d~0 50)) (.cse38 (<= ~c_req_a~0 0)) (.cse12 (<= 50 ~c_req_d~0)) (.cse39 (<= 0 ~c_req_a~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse19 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 .cse20) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~i 2) .cse21 (= ~s_memory1~0 51) .cse2 .cse22 .cse0 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse24 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ~a_t~0) .cse3) (and .cse14 .cse25 .cse1 .cse3 .cse4) (and .cse26 .cse27 .cse28 .cse21 .cse29 .cse30 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse22 .cse4 (<= 2 ~c_req_a~0) .cse13 .cse31 .cse15 .cse23 .cse16 .cse17 .cse24 .cse18 .cse3 (<= ~c_req_a~0 2)) (and .cse27 .cse32 .cse21 .cse29 .cse30 .cse33 .cse2 .cse34 .cse0 (= ULTIMATE.start_s_memory_write_~i 1) .cse13 .cse14 .cse35 .cse31 .cse15 .cse36 .cse16 .cse17 .cse18 .cse3) (and .cse26 .cse6 .cse32 .cse28 .cse8 .cse33 .cse9 .cse4 (<= ~c_req_a~0 1) .cse34 .cse10 (<= 1 ~c_req_a~0) .cse13 .cse35 .cse36 .cse15 .cse16 .cse17 .cse18 .cse3 .cse20) (and .cse13 .cse14 .cse18 .cse4 .cse3) (and .cse5 .cse26 .cse6 .cse28 .cse7 .cse37 .cse25 .cse4 .cse11 .cse38 .cse39 .cse12 .cse13 .cse16 .cse3 .cse19) (and .cse38 .cse39 .cse26 .cse14 .cse37 .cse25 .cse3 .cse4) (and .cse5 .cse26 .cse6 .cse28 .cse7 .cse4 .cse11 .cse38 .cse12 .cse39 .cse13 .cse16 .cse18 .cse3 .cse19)))) [2019-12-07 14:44:47,592 INFO L242 CegarLoopResult]: At program point L1213(lines 1206 1232) 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 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse2 .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 14:44:47,593 INFO L242 CegarLoopResult]: At program point L817(lines 810 827) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) (<= 2 ULTIMATE.start_s_memory_read_~i) .cse4 .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,593 INFO L246 CegarLoopResult]: For program point L619(lines 619 623) no Hoare annotation was computed. [2019-12-07 14:44:47,593 INFO L246 CegarLoopResult]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-12-07 14:44:47,593 INFO L242 CegarLoopResult]: At program point L421(lines 414 458) the Hoare annotation is: (let ((.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= ~c_m_lock~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3 .cse4) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 (= ~s_memory1~0 51) .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) .cse4 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 .cse9 (<= 52 ~c_req_d~0) .cse10 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse1 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse1 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse5 (= ~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) .cse6 .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse2 .cse1 .cse3))) [2019-12-07 14:44:47,593 INFO L242 CegarLoopResult]: At program point L355(lines 348 374) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse0 (= ~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) .cse1 .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7 .cse8 .cse9 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse9 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse10) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 14:44:47,593 INFO L246 CegarLoopResult]: For program point L289(lines 288 316) no Hoare annotation was computed. [2019-12-07 14:44:47,593 INFO L246 CegarLoopResult]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2019-12-07 14:44:47,593 INFO L246 CegarLoopResult]: For program point L223(lines 223 227) no Hoare annotation was computed. [2019-12-07 14:44:47,593 INFO L242 CegarLoopResult]: At program point L950(lines 943 960) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse22 (<= 1 ~c_req_type~0)) (.cse25 (<= ~c_req_type~0 1)) (.cse26 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse14 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse24 (= ~m_run_pc~0 3)) (.cse8 (<= ~c_req_a~0 1)) (.cse10 (<= 1 ~c_req_a~0)) (.cse0 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.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 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 6)) (.cse11 (= ~s_memory2~0 52)) (.cse28 (<= 2 ~c_req_a~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= 2 ~s_run_pc~0)) (.cse29 (<= 2 ~a_t~0)) (.cse17 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (<= ~c_req_a~0 2))) (or (and .cse0 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ~req_tt_a~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~a_t~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse11 .cse12 .cse19 .cse13 (= ~req_tt_a~0 0) .cse15 (= ~a_t~0 0) .cse16 .cse17) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse19 (<= 0 ~a_t~0) .cse13 (let ((.cse20 (<= ~c_req_a~0 0)) (.cse21 (<= 0 ~c_req_a~0))) (or (and .cse20 .cse21 .cse12 .cse22 .cse23 (= 0 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6) (and .cse20 .cse21 .cse12 .cse22 .cse23 (<= 2 ~s_run_pc~0) .cse24 .cse18 .cse17 .cse6))) .cse25 (<= ~a_t~0 0) .cse15 .cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse25 .cse3 .cse4 .cse24 .cse27 .cse6 .cse26 .cse28 (<= ULTIMATE.start_s_memory_write_~v 51) .cse12 .cse13 .cse23 (<= 52 ~c_req_d~0) .cse15 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse16 (= 2 ULTIMATE.start_s_run_~req_a~1) .cse29 .cse17 .cse30) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse22 .cse25 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse26 .cse7 .cse12 .cse14 .cse23 .cse15 .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_memory_write_~v 50) (<= ~a_t~0 1) .cse3 (= 1 ULTIMATE.start_s_run_~req_a~1) (<= 51 ~c_req_d~0) .cse24 .cse8 .cse10 .cse13 (<= 1 ~a_t~0) (<= ~c_req_d~0 51) .cse17) (and .cse0 (= ~req_tt_a~0 2) .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse6 .cse9 .cse11 .cse28 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse13 .cse15 .cse16 .cse29 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse17 .cse30 (<= ULTIMATE.start_s_memory_read_~i 1)))) [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L818(lines 810 827) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L290(lines 290 294) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L819(lines 819 823) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L423(lines 423 427) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point L952(lines 952 956) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 14:44:47,594 INFO L242 CegarLoopResult]: At program point L689(lines 682 726) the Hoare annotation is: (let ((.cse0 (= 0 ~c_req_type~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.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 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse11 (= ~m_run_pc~0 6)) (.cse12 (= ~s_memory2~0 52)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0))) (or (and (= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse0 (= ~req_tt_a~0 1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_m_run_~a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse10 (<= ~c_req_a~0 1) .cse11 (<= 1 ~c_req_a~0) .cse12 .cse13 .cse14 (= ~a_t~0 1)) (and (= 52 ~c_rsp_d~0) .cse0 (<= ULTIMATE.start_s_memory_read_~i 2) (<= 2 ULTIMATE.start_m_run_~a~0) .cse1 (<= 2 ~c_req_a~0) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 2) (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse3 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse4 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse5 .cse6 (= ~req_tt_a~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse13 (= 52 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~rsp_d___0~0 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse14 (<= ~c_req_a~0 2)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse0 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse12 .cse13 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse14))) [2019-12-07 14:44:47,595 INFO L242 CegarLoopResult]: At program point L557(lines 527 558) the Hoare annotation is: (let ((.cse4 (= 2 ~s_run_pc~0))) (let ((.cse0 (= 0 ~c_req_type~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse5 (<= 3 ~m_run_pc~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse10 (= ~s_memory1~0 51)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory2~0 52)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse18 (not .cse4)) (.cse19 (<= 2 ~s_run_pc~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (= 51 ~c_rsp_d~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 .cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse14 (<= ULTIMATE.start_m_run_~a~0 2) .cse15 (= ~a_t~0 1)) (and .cse16 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 .cse10 (= ~m_run_pc~0 3) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse14 .cse2 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) .cse3 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse4 .cse15 .cse17) (and .cse2 .cse18 .cse19 .cse1 .cse15 .cse5) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_m_run_~a~0 1) .cse2 (= 50 ~c_rsp_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~c_req_a~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse14 (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15) (and .cse16 .cse2 .cse18 .cse19 .cse1 .cse15 .cse17)))) [2019-12-07 14:44:47,595 INFO L246 CegarLoopResult]: For program point L756(lines 756 809) no Hoare annotation was computed. [2019-12-07 14:44:47,595 INFO L246 CegarLoopResult]: For program point L757(lines 757 761) no Hoare annotation was computed. [2019-12-07 14:44:47,595 INFO L246 CegarLoopResult]: For program point L691(lines 691 695) no Hoare annotation was computed. [2019-12-07 14:44:47,595 INFO L242 CegarLoopResult]: At program point L625(lines 618 635) the Hoare annotation is: (let ((.cse0 (<= 0 ~a_t~0)) (.cse6 (<= 1 ~a_t~0)) (.cse1 (<= 2 ~s_run_st~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (or (and (<= ~a_t~0 1) .cse6 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_m_run_~a~0 1) .cse1 (<= ~a_t~0 0) .cse2 .cse3 .cse4 .cse5)) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse5 .cse4) (and .cse6 .cse1 .cse2 (<= 2 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5))) [2019-12-07 14:44:47,596 INFO L242 CegarLoopResult]: At program point L1286(lines 1279 1314) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse10 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= ~c_req_a~0 1)) (.cse14 (<= 1 ~c_req_a~0)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ~s_memory1~0 51)) (.cse22 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse15 (= ~s_memory2~0 52)) (.cse25 (<= 2 ~c_req_a~0)) (.cse29 (<= ~c_req_a~0 2)) (.cse41 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse33 (<= ~m_run_pc~0 0)) (.cse7 (= 0 ~c_req_type~0)) (.cse35 (<= ~c_m_lock~0 0)) (.cse24 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 2 ~a_t~0)) (.cse36 (<= ~a_t~0 1)) (.cse38 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse39 (<= 1 ~a_t~0)) (.cse37 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse40 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 2 ~s_run_st~0)) (.cse18 (= 2 ~s_run_pc~0)) (.cse19 (<= 3 ~m_run_pc~0)) (.cse42 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse20 (<= 1 ~c_req_type~0)) (.cse43 (<= 0 ~a_t~0)) (.cse21 (<= ~c_req_type~0 1)) (.cse34 (= 0 ~s_run_pc~0)) (.cse44 (<= ~a_t~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse45 (<= ~c_req_d~0 50)) (.cse31 (<= ~c_req_a~0 0)) (.cse46 (<= 50 ~c_req_d~0)) (.cse32 (<= 0 ~c_req_a~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 .cse10 (= ~req_tt_a~0 1) .cse11 .cse4 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19 (= ~a_t~0 1)) (and .cse20 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse21 .cse8 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse23 .cse2 .cse24 .cse4 .cse25 .cse16 .cse26 (<= 52 ~c_req_d~0) .cse17 .cse27 (<= ~c_req_d~0 52) .cse18 .cse28 .cse3 .cse29) (and .cse30 (not .cse18) .cse1 .cse3 .cse4) (and .cse31 .cse32 .cse0 .cse33 .cse30 .cse34 .cse35 .cse3 .cse4) (and .cse16 .cse30 .cse2 .cse18 .cse3 .cse4) (and .cse0 .cse16 .cse30 .cse24 .cse18 .cse28 .cse3 .cse4 .cse13) (and .cse20 .cse36 .cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 51 ~c_req_d~0) .cse2 .cse10 .cse4 .cse12 .cse37 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse16 .cse38 .cse39 .cse26 (<= ~c_req_d~0 51) .cse17 .cse27 .cse18 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse31 .cse32 .cse20 .cse30 .cse34 .cse2 .cse3 .cse4) (and .cse40 (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 .cse9 .cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse41 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_a~1 2) .cse16 (= ~req_tt_a~0 0) .cse26 .cse17 (= ~a_t~0 0) .cse27 (<= ULTIMATE.start_s_run_~req_d~1 52) .cse18 (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3 .cse19 .cse42) (and .cse5 (= ~req_tt_a~0 2) .cse6 .cse7 .cse8 .cse9 .cse22 .cse23 .cse24 .cse11 (<= 1 ULTIMATE.start_s_memory_read_~i) .cse4 .cse13 .cse15 .cse25 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse28 .cse3 .cse19 .cse29 (<= ULTIMATE.start_s_memory_read_~i 1)) (and .cse40 .cse20 .cse43 .cse21 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 .cse16 .cse17 .cse18 .cse3 .cse42) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse30 .cse7 .cse44 .cse18 .cse35 .cse4 .cse3) (and .cse41 .cse0 .cse43 .cse33 .cse16 .cse7 .cse44 .cse34 .cse35 .cse4 .cse3) (and (or (and .cse16 .cse30 .cse17 .cse24 .cse18 .cse28 .cse3 .cse19 .cse4) (and .cse16 .cse36 .cse30 .cse38 .cse39 .cse17 .cse18 .cse3 .cse19 .cse4 .cse37) (and .cse40 .cse16 .cse43 .cse30 .cse44 .cse17 .cse18 .cse3 .cse19 .cse4 .cse42)) .cse13) (and .cse20 .cse43 .cse21 .cse34 .cse44 .cse2 .cse4 .cse45 .cse31 .cse46 .cse32 (= ULTIMATE.start_m_run_~a~0 0) .cse16 .cse17 .cse3))) [2019-12-07 14:44:47,596 INFO L242 CegarLoopResult]: At program point L229(lines 222 266) the Hoare annotation is: (let ((.cse3 (= 0 ~s_run_pc~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse12 (<= 0 ~a_t~0)) (.cse14 (<= ~a_t~0 0)) (.cse15 (<= ~c_req_d~0 50)) (.cse5 (<= ~c_req_a~0 0)) (.cse6 (<= 0 ~c_req_a~0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= 2 ~s_run_st~0)) (.cse21 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse22 (= 2 ~s_run_pc~0)) (.cse23 (= ~m_run_pc~0 3)) (.cse24 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 2 ~c_write_rsp_ev~0))) (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 .cse0 .cse12 .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse0 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse13 .cse14 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse21 .cse18 .cse19 .cse8 .cse22 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse12 (<= 51 ~c_req_d~0) .cse23 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_a~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 1) (<= ~c_req_d~0 51) .cse24 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse7 (not .cse22) (<= 2 ~s_run_pc~0) .cse4 .cse9) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse14 .cse4 .cse15 .cse5 .cse6 .cse16 .cse17 .cse7 .cse18 .cse19 .cse8 .cse20 .cse22 .cse9 .cse10) (and .cse0 (<= 2 ULTIMATE.start_m_run_~req_a~0) .cse13 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 2 ULTIMATE.start_m_run_~a~0) .cse4 (<= 52 ULTIMATE.start_m_run_~req_d~0) (<= 2 ~c_req_a~0) .cse7 .cse21 .cse18 .cse19 .cse8 (<= ~c_req_d~0 52) .cse22 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 52) (<= 1 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse23 (<= ULTIMATE.start_m_run_~req_a~0 2) (<= ULTIMATE.start_m_run_~a~0 2) (<= 1 ~a_t~0) (<= 52 ~c_req_d~0) .cse24 .cse9 (<= ~c_req_a~0 2)))) [2019-12-07 14:44:47,596 INFO L246 CegarLoopResult]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2019-12-07 14:44:47,596 INFO L246 CegarLoopResult]: For program point L626(lines 618 635) no Hoare annotation was computed. [2019-12-07 14:44:47,596 INFO L242 CegarLoopResult]: At program point L1221(lines 1214 1231) 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 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) (<= ~a_t~0 0) .cse2 .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 14:44:47,596 INFO L246 CegarLoopResult]: For program point L627(lines 627 631) no Hoare annotation was computed. [2019-12-07 14:44:47,597 INFO L242 CegarLoopResult]: At program point L429(lines 422 457) the Hoare annotation is: (let ((.cse5 (= ~s_memory0~0 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= ~c_m_lock~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3 .cse4) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse5 (= ~s_memory1~0 51) .cse6 (<= 2 ULTIMATE.start_m_run_~a~0) .cse4 .cse7 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse0 .cse9 (<= 52 ~c_req_d~0) .cse10 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse2 .cse1 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse3) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse6 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse7 .cse8 .cse0 .cse9 .cse10 .cse2 .cse1 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse5 (= ~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) .cse6 .cse4 (<= 1 ULTIMATE.start_m_run_~a~0) .cse7 .cse8 .cse0 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse2 .cse1 .cse3))) [2019-12-07 14:44:47,597 INFO L242 CegarLoopResult]: At program point L495-2(lines 495 523) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse0 (= 0 ~c_req_type~0)) (.cse6 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse12 (= ~m_run_pc~0 6)) (.cse13 (= ~s_memory2~0 52)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse10 (= ~s_memory1~0 51)) (.cse2 (= ~c_empty_req~0 1)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse3 (<= 2 ~s_run_st~0)) (.cse16 (not .cse5)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 2 ULTIMATE.start_m_run_~a~0) (= ~req_tt_a~0 1) .cse1 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_read_~i 1) .cse6 .cse7 .cse8 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 .cse10 (<= 1 ULTIMATE.start_s_run_~req_a~1) (= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ULTIMATE.start_s_run_~req_a~1 1) (<= 1 ULTIMATE.start_s_memory_read_~i) .cse11 (<= ~c_req_a~0 1) .cse12 (<= 1 ~c_req_a~0) .cse13 .cse14 (= 2 ULTIMATE.start_m_run_~req_a___0~0) (<= ULTIMATE.start_m_run_~a~0 2) .cse15 (= ~a_t~0 1)) (and (= 50 |ULTIMATE.start_s_memory_read_#res|) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 (<= ULTIMATE.start_m_run_~a~0 1) (= 50 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ~c_req_a~0) .cse13 .cse14 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= ~a_t~0 0) .cse15) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse9 .cse10 (= ~m_run_pc~0 3) .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse2 (= ULTIMATE.start_m_run_~a~0 0) (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse14 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse3 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 52 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse5 .cse4 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse15) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse16 .cse17 .cse4 .cse15 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse3 .cse16 .cse17 .cse15 (<= 3 ~m_run_pc~0) .cse1)))) [2019-12-07 14:44:47,597 INFO L242 CegarLoopResult]: At program point L363(lines 356 373) the Hoare annotation is: (let ((.cse0 (= ~s_memory0~0 50)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse6 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) .cse0 (= ~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) .cse1 .cse2 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_m_run_~a~0 1) (<= 1 ~a_t~0) .cse6 (<= ~c_req_d~0 51) .cse7 .cse8 .cse9 .cse10) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse0 (= ~s_memory1~0 51) .cse1 (<= 2 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_s_run_~req_a~1 2) .cse5 .cse6 (<= 52 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse9 (<= 2 ~a_t~0) (<= 2 ULTIMATE.start_s_run_~req_a~1) .cse10) (and (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~a_t~0) (<= ~a_t~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= 0 ULTIMATE.start_s_run_~req_a~1) .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 14:44:47,597 INFO L246 CegarLoopResult]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2019-12-07 14:44:47,597 INFO L246 CegarLoopResult]: For program point L231(lines 231 235) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L246 CegarLoopResult]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L246 CegarLoopResult]: For program point L496(lines 495 523) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L246 CegarLoopResult]: For program point L364(lines 134 480) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L246 CegarLoopResult]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L246 CegarLoopResult]: For program point L497(lines 497 501) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L246 CegarLoopResult]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-12-07 14:44:47,598 INFO L242 CegarLoopResult]: At program point L1026(lines 1000 1027) the Hoare annotation is: (let ((.cse21 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse22 (<= ULTIMATE.start_s_run_~req_a~1 2)) (.cse23 (<= 2 ~a_t~0)) (.cse24 (<= 2 ULTIMATE.start_s_run_~req_a~1)) (.cse0 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (= ~m_run_pc~0 3)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (<= ~a_t~0 0)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (= 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)) (.cse12 (= 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)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (= 0 ~c_req_type~0)) (.cse27 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse28 (<= ULTIMATE.start_m_run_~a~0 1)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse15 (= 2 ~s_run_pc~0)) (.cse30 (<= 52 ULTIMATE.start_s_memory_write_~v)) (.cse31 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (= ~s_memory0~0 50)) (.cse20 (= ~s_memory1~0 51)) (.cse25 (<= 1 ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 52)) (.cse33 (= ~m_run_pc~0 6)) (.cse34 (= ~s_memory2~0 52)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (<= 52 ULTIMATE.start_s_run_~req_d~1) .cse19 .cse20 .cse4 .cse21 .cse6 (= ~s_memory2~0 ULTIMATE.start_s_run_~req_d~1) .cse10 .cse11 .cse22 .cse12 (<= 52 ~c_req_d~0) .cse13 .cse14 (<= ~c_req_d~0 52) (<= ULTIMATE.start_s_run_~req_d~1 52) .cse15 .cse23 .cse24 .cse16) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= ~a_t~0 1) (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse19 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse25 (<= 51 ~c_req_d~0) .cse26 .cse4 .cse6 .cse27 .cse10 .cse11 (<= 1 ~a_t~0) .cse28 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse29 (<= ULTIMATE.start_s_memory_read_~i 2) .cse21 .cse6 (<= 2 ~c_req_a~0) .cse10 (= 52 ULTIMATE.start_s_memory_read_~x~0) .cse22 (= 52 |ULTIMATE.start_s_memory_read_#res|) .cse13 (<= 2 ULTIMATE.start_s_memory_read_~i) .cse15 .cse30 (= ~req_tt_a~0 2) .cse31 .cse19 .cse20 .cse32 .cse33 .cse34 (= 2 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (= 52 ULTIMATE.start_s_run_~rsp_d~1) .cse23 .cse24 .cse16 (<= ~c_req_a~0 2)) (and .cse30 .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse31 .cse29 .cse19 .cse20 .cse32 .cse5 .cse6 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse33 .cse34 (= 0 ~c_req_a~0) .cse10 .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) .cse13 (= ~a_t~0 0) .cse15 .cse16 .cse18) (and .cse0 (let ((.cse35 (not .cse15))) (or (and .cse10 .cse35 (= 0 ~s_run_pc~0) .cse4 .cse16) (and .cse10 .cse35 (<= 2 ~s_run_pc~0) .cse4 .cse16))) (<= 1 ~c_req_type~0) .cse1 (<= ~c_req_type~0 1) .cse2 .cse3 .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 .cse8 .cse9 .cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse12 .cse13 .cse14 .cse17 .cse18) (and .cse29 (= ~req_tt_a~0 1) .cse27 .cse6 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse10 .cse28 .cse13 .cse15 (<= ULTIMATE.start_s_memory_read_~i 1) .cse30 (= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse31 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse19 .cse20 .cse25 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse26 .cse32 (<= 1 ULTIMATE.start_s_memory_read_~i) (<= ~c_req_a~0 1) .cse33 (<= 1 ~c_req_a~0) .cse34 .cse11 .cse16 (= ~a_t~0 1)))) [2019-12-07 14:44:47,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:44:47 BoogieIcfgContainer [2019-12-07 14:44:47,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:44:47,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:44:47,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:44:47,791 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:44:47,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:27" (3/4) ... [2019-12-07 14:44:47,793 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:44:47,809 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 14:44:47,810 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 14:44:47,831 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((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) && 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)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 52 <= c_req_d) && i == req_a) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && m_run_st == 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && 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)) || ((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a) [2019-12-07 14:44:47,831 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((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) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 52 <= c_req_d) && i == req_a) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && m_run_st == 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && 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)) || (((((((((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)) || ((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev)) || ((((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a) [2019-12-07 14:44:47,832 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && m_run_st == 0) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && i == req_a) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a)) || ((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a) && 52 <= v) && a <= 0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((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))) && a <= 0) && 50 <= c_req_d) && 0 <= a_t) && 2 <= c_write_req_ev) && c_req_type <= 1) && a_t <= 0) && 1 <= c_m_lock) && 0 <= a) [2019-12-07 14:44:47,832 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a) || (((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && s_memory2 == req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= a_t) && a <= 1) && c_req_d <= 51) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((0 == c_req_type && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((52 <= v && a <= 0) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((a <= 0 && (((((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) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) [2019-12-07 14:44:47,833 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && a == 2) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((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)) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && a == 0) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 3 <= a) && m_run_pc == 3) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 3 <= a) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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 14:44:47,833 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((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)) || ((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1)) || (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 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 14:44:47,833 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && c_empty_req == 1) && a == 0) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= a_t) && 2 <= req_a) && 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)) || (((((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 14:44:47,833 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) || (((((((((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && c_empty_req == 1) && a == 0) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && 1 <= a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((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 14:44:47,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a <= 0 && ((((c_empty_req == 1 && 0 == s_run_pc) && !(2 == s_run_pc)) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3))) && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= a) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a)) || (((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 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) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && req_d <= 50) && 0 <= a)) || (((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && 1 == c_write_rsp_ev) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc)) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) [2019-12-07 14:44:47,834 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) || (((((((((((((((((((((((a <= 0 && 52 <= req_d) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((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)) || (((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a <= 0 && ((((c_empty_req == 1 && 0 == s_run_pc) && !(2 == s_run_pc)) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3))) && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= a) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a)) || (((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 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) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && req_d <= 50) && 0 <= a)) || (((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && 1 == c_write_rsp_ev) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc)) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) [2019-12-07 14:44:47,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 3 <= m_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((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)) || (((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && 1 <= a) && c_empty_rsp == 1) && 50 == rsp_d) && a <= 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 3 <= m_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 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 14:44:47,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) [2019-12-07 14:44:47,834 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && m_run_st == 0) && 2 == s_run_pc) || (((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && ((((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3) && m_run_st == 0) || (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && m_run_st == 0))) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a)) || ((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && ((((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3) && m_run_st == 0) || (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && m_run_st == 0))) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || (((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 1 == c_write_rsp_ev) && 51 <= c_req_d) && 1 <= a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && ((((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3) && m_run_st == 0) || (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && m_run_st == 0))) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d)) || ((((((((((((((((((((((((((((0 == c_req_type && 1 == c_write_rsp_ev) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 1 == c_write_rsp_ev) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) [2019-12-07 14:44:47,835 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) [2019-12-07 14:44:47,835 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) [2019-12-07 14:44:47,835 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || (((((((2 <= c_write_req_ev && 1 <= a_t) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) && c_req_a <= 2)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((52 <= v && s_memory2 == 52) && (((((((((((1 == req_a___0 && 1 <= c_req_a) && ((((((((0 <= a_t && 2 <= c_write_req_ev) && a <= 1) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((2 <= c_write_req_ev && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 0 == req_a) && c_req_a <= 1) && m_run_pc == 6) || ((((((((((1 == req_a___0 && 1 <= c_req_a) && ((((((((0 <= a_t && 2 <= c_write_req_ev) && a <= 1) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((2 <= c_write_req_ev && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && c_req_a <= 1) && m_run_pc == 6))) && v <= 52) && 1 <= a)) || ((((((((((0 <= a_t && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((2 <= c_write_req_ev && a_t <= 1) && 1 <= a_t) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) && 1 <= a)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && a_t <= 0) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && 52 <= v) && a <= 0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((((a <= 0 && 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)) || (((((((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a == 2) && i <= 1) && c_req_a <= 2) && a_t == 1)) || (((((((((((((((((((a <= 0 && 52 <= req_d) && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 0 <= a) [2019-12-07 14:44:47,835 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,835 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) || ((((((((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 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)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) [2019-12-07 14:44:47,836 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 == c_req_type && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && i == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,836 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) || ((((((((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) [2019-12-07 14:44:47,836 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((52 <= req_d && 0 <= a_t) && (((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))) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) [2019-12-07 14:44:47,836 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((52 <= req_d && 0 <= a_t) && (((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))) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) [2019-12-07 14:44:47,836 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((52 <= req_d && 0 <= a_t) && (((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))) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,837 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) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,837 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) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,837 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) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,837 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) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,837 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) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,837 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) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,837 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 2 == s_run_pc) && 0 <= a) && 52 <= v) && a <= 0) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) [2019-12-07 14:44:47,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) [2019-12-07 14:44:47,838 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 <= a) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((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 14:44:47,916 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_19803041-e84e-4455-a57f-d7a6f27cdf35/bin/uautomizer/witness.graphml [2019-12-07 14:44:47,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:44:47,917 INFO L168 Benchmark]: Toolchain (without parser) took 200897.11 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 939.3 MB in the beginning and 809.2 MB in the end (delta: 130.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 14:44:47,917 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:44:47,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:47,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.45 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:47,918 INFO L168 Benchmark]: Boogie Preprocessor took 30.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:47,918 INFO L168 Benchmark]: RCFGBuilder took 583.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.7 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:47,918 INFO L168 Benchmark]: TraceAbstraction took 199815.35 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 857.3 MB in the end (delta: 144.7 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 14:44:47,918 INFO L168 Benchmark]: Witness Printer took 125.70 ms. Allocated memory is still 2.7 GB. Free memory was 857.3 MB in the beginning and 809.2 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:44:47,920 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.45 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.58 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 583.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.7 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 199815.35 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 857.3 MB in the end (delta: 144.7 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 125.70 ms. Allocated memory is still 2.7 GB. Free memory was 857.3 MB in the beginning and 809.2 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 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: 1167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) - InvariantResult [Line: 1236]: Loop Invariant Derived loop invariant: ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && 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: 101]: 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: 1214]: Loop Invariant Derived loop invariant: ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && 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: 101]: 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) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && 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: 911]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 0 <= a_t) && 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)) || (((((((((((((((((((((((52 <= req_d && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && req_type <= 1) && 2 <= c_req_a) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 == req_a) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((((((((((((((((50 <= v && 1 <= c_req_type) && c_req_type <= 1) && req_d <= 51) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= req_type) && 1 <= c_m_lock) && 2 == s_run_pc) && 51 <= req_d) && v <= 50) && a_t <= 1) && s_memory0 == 50) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && c_req_d <= 51) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && c_empty_req == 1) && 2 == req_a___0) && req_a <= 2) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 1119]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((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) && m_run_pc == 3) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 52 <= c_req_d) && i == req_a) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && m_run_st == 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && 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)) || (((((((((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)) || ((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev)) || ((((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 101]: 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: 674]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 0 <= a_t) && 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)) || (((((((((((((((((((((((52 <= req_d && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && req_type <= 1) && 2 <= c_req_a) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 == req_a) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((((((((((((((((50 <= v && 1 <= c_req_type) && c_req_type <= 1) && req_d <= 51) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= req_type) && 1 <= c_m_lock) && 2 == s_run_pc) && 51 <= req_d) && v <= 50) && a_t <= 1) && s_memory0 == 50) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && c_req_d <= 51) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && c_empty_req == 1) && 2 == req_a___0) && req_a <= 2) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_req_a) && v <= 51) && 2 <= c_write_req_ev) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && 2 <= a_t) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || (((((((((c_req_d <= 50 && a <= 0) && 50 <= c_req_d) && 0 <= a_t) && 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) && a_t <= 0) && 1 <= c_m_lock) && 0 <= a)) || (((((((((((((((((((52 <= v && req_tt_a == 2) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 <= c_write_req_ev) && 2 == req_a___0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1)) || (((((((((((((((((52 <= v && a <= 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && s_memory2 == 52) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((50 <= v && 1 <= c_req_type) && v <= 50) && a_t <= 1) && c_req_type <= 1) && s_memory0 == 50) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((52 <= v && 1 == req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && m_run_st == 0) && 2 == s_run_pc) || (((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && ((((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3) && m_run_st == 0) || (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && m_run_st == 0))) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a)) || ((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 2 <= a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && ((((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3) && m_run_st == 0) || (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && m_run_st == 0))) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a)) || (((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 1 == c_write_rsp_ev) && 51 <= c_req_d) && 1 <= a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && ((((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3) && m_run_st == 0) || (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && m_run_st == 0))) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d)) || ((((((((((((((((((((((((((((0 == c_req_type && 1 == c_write_rsp_ev) && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 1 == c_write_rsp_ev) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) - InvariantResult [Line: 564]: 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) || ((((((((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 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)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_req_a) && v <= 51) && 2 <= c_write_req_ev) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && 2 <= a_t) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((52 <= v && req_tt_a == 2) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 <= c_write_req_ev) && 2 == req_a___0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1)) || (((((((((((((((((52 <= v && a <= 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && s_memory2 == 52) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((50 <= v && 1 <= c_req_type) && v <= 50) && a_t <= 1) && c_req_type <= 1) && s_memory0 == 50) && 51 <= c_req_d) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && c_req_d <= 51) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((52 <= v && 1 == req_a___0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) - InvariantResult [Line: 572]: 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) || ((((((((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 3 <= m_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((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)) || (((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && 1 <= a) && c_empty_rsp == 1) && 50 == rsp_d) && a <= 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 3 <= m_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 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: 494]: 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) || (((((((((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && c_empty_req == 1) && a == 0) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && 1 <= a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((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: 214]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((1 <= c_req_type && 2 <= req_a) && c_req_type <= 1) && s_memory1 == req_d) && req_d <= 51) && 2 <= s_run_pc) && 2 <= a) && c_empty_rsp == 1) && 52 <= req_d) && 2 <= c_req_a) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && c_req_d <= 52) && 51 <= req_d) && a_t <= 1) && s_memory0 == 50) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && req_a <= 2) && a <= 2) && 1 <= a_t) && 52 <= c_req_d) && v == req_d) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((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)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && a_t <= 0) && 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) && 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)) || (((((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && 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) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a)) || (((((((((((((((((((((((((((1 <= c_req_type && 1 <= req_a) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 2 <= s_run_pc) && 0 == req_a) && 1 <= a) && c_empty_rsp == 1) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && req_d <= 51) && 0 <= a_t) && 51 <= c_req_d) && 51 <= req_d) && m_run_pc == 3) && c_req_a <= 1) && 50 <= req_d) && 1 <= c_req_a) && req_a <= 1) && c_req_d <= 51) && v == req_d) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 1263]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 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)) || (((((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_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 747]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 2 == s_run_pc) && 0 <= a) && 52 <= v) && a <= 0) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) - InvariantResult [Line: 1271]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 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)) || (((((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_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 0 <= a_t) && 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)) || (((((((((((((((((((((((52 <= req_d && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && req_type <= 1) && 2 <= c_req_a) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 == req_a) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((((((((((((((((50 <= v && 1 <= c_req_type) && c_req_type <= 1) && req_d <= 51) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= req_type) && 1 <= c_m_lock) && 2 == s_run_pc) && 51 <= req_d) && v <= 50) && a_t <= 1) && s_memory0 == 50) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && c_req_d <= 51) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && c_empty_req == 1) && 2 == req_a___0) && req_a <= 2) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0 == c_req_type && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && i == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 177]: 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) || ((((((((((((((((((((((((((2 <= req_a && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && 52 <= req_d) && c_empty_rsp == 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 1) && s_memory0 == 50) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && req_a <= 2) && 2 <= c_write_req_ev) && a <= 2) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 2 <= c_write_rsp_ev)) || ((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && 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)) || ((((((((((((((((((((((((1 <= req_a && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && m_run_pc == 3) && 51 <= req_d) && 50 <= req_d) && req_a <= 1) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && v == req_d) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((((((((((((((((req_d <= 50 && a <= 0) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 222]: 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) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((((((((((((((1 <= c_req_type && 1 <= req_a) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && 51 <= c_req_d) && m_run_pc == 3) && 51 <= req_d) && c_req_a <= 1) && 50 <= req_d) && 1 <= c_req_a) && req_a <= 1) && c_req_d <= 51) && v == req_d) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((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) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((((((((((((((((1 <= c_req_type && 2 <= req_a) && c_req_type <= 1) && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && c_empty_rsp == 1) && 52 <= req_d) && 2 <= c_req_a) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && c_req_d <= 52) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 1) && s_memory0 == 50) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && req_a <= 2) && a <= 2) && 1 <= a_t) && 52 <= c_req_d) && v == req_d) && 2 <= c_write_rsp_ev) && c_req_a <= 2) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 0 <= a_t) && 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)) || (((((((((((((((((((((((52 <= req_d && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && req_type <= 1) && 2 <= c_req_a) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 == req_a) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((((((((((((((((50 <= v && 1 <= c_req_type) && c_req_type <= 1) && req_d <= 51) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= req_type) && 1 <= c_m_lock) && 2 == s_run_pc) && 51 <= req_d) && v <= 50) && a_t <= 1) && s_memory0 == 50) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && c_req_d <= 51) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && c_empty_req == 1) && 2 == req_a___0) && req_a <= 2) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && a == 2) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((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)) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && a == 0) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 3 <= a) && m_run_pc == 3) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 3 <= a) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((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: 397]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 2 <= s_run_pc) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && v == req_d) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((((((((((((((((52 <= req_d && s_memory0 == 50) && 2 <= s_run_pc) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= s_run_pc) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 860]: 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) || ((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && m_run_st == 0) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && i == req_a) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a)) || ((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 0 <= a) && 52 <= v) && a <= 0) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((((((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))) && a <= 0) && 50 <= c_req_d) && 0 <= a_t) && 2 <= c_write_req_ev) && c_req_type <= 1) && a_t <= 0) && 1 <= c_m_lock) && 0 <= a) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((52 <= req_d && 0 <= a_t) && (((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))) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) - InvariantResult [Line: 1351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: ((((((((((((((((((((52 <= req_d && 0 <= a_t) && (((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))) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && a == 2) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && m_run_pc == 3) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && req_a___0 + 50 == rsp_d___0) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && req_a___0 + 50 == rsp_d___0) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((2 <= c_write_req_ev && 2 <= s_run_st) && m_run_pc == 3) && 2 <= a) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((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: 1279]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 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)) || (((((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_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((((((((((((((((((req_d <= 50 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) || ((((((((((((((((((req_d <= 50 && a <= 0) && req_a <= 0) && m_run_pc <= 0) && 0 <= a_t) && 0 == c_req_type) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((1 <= req_a && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= req_type) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && m_run_pc == 3) && 51 <= req_d) && 50 <= req_d) && c_req_d <= 50) && req_a <= 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && v == req_d) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((((((((((((((((((((((((2 <= req_a && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && 52 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= req_type) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 1) && s_memory0 == 50) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && req_a <= 2) && 2 <= c_write_req_ev) && a <= 2) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 2 <= c_write_rsp_ev)) || ((((((((((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) - InvariantResult [Line: 1287]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((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) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 1 <= a_t) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((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)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 0 <= a_t) && 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)) || (((((((((((((((((((((((52 <= req_d && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && req_type <= 1) && 2 <= c_req_a) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 == req_a) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((((((((((((((((50 <= v && 1 <= c_req_type) && c_req_type <= 1) && req_d <= 51) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= req_type) && 1 <= c_m_lock) && 2 == s_run_pc) && 51 <= req_d) && v <= 50) && a_t <= 1) && s_memory0 == 50) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && c_req_d <= 51) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && c_empty_req == 1) && 2 == req_a___0) && req_a <= 2) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && req_type <= 1) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && 1 <= req_type) && 52 <= c_req_d) && i == req_a) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && req_type <= 1) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && a <= 1) && 1 <= a_t) && 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 && 0 <= a_t) && a_t <= 0) && 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) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && ((((((c_empty_req == 1 && !(2 == s_run_pc)) && 0 == 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))) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && 1 <= a) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((((((c_req_d <= 50 && 50 <= c_req_d) && a == 0) && 0 <= a_t) && 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)) || (((((((((((((((((((((((52 <= req_d && 1 <= c_req_type) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && req_type <= 1) && 2 <= c_req_a) && v <= 51) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 52 <= c_req_d) && 1 <= c_m_lock) && 51 <= v) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 == req_a) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((((((((((((((((((((((50 <= v && 1 <= c_req_type) && c_req_type <= 1) && req_d <= 51) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= req_type) && 1 <= c_m_lock) && 2 == s_run_pc) && 51 <= req_d) && v <= 50) && a_t <= 1) && s_memory0 == 50) && 1 == req_a) && 51 <= c_req_d) && m_run_pc == 3) && c_req_a <= 1) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && c_req_d <= 51) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && c_empty_req == 1) && 2 == req_a___0) && req_a <= 2) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0 == c_req_type && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((52 <= v && a <= 0) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && a_t == 0) && 1 <= c_m_lock) && i == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((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) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((a <= 0 && 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) || ((((((((a_t <= 1 && 1 <= 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_t && a <= 1) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) && 1 <= a)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((1 <= a_t && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 230]: 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) || ((((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 && 1 <= req_a) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && 1 <= a) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && (((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))) && 51 <= c_req_d) && 51 <= req_d) && c_req_a <= 1) && 50 <= req_d) && 1 <= c_req_a) && req_a <= 1) && c_req_d <= 51) && v == req_d) && req_d <= 50)) || (((((((((((((((((((((((((((1 <= c_req_type && 2 <= req_a) && c_req_type <= 1) && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && 52 <= req_d) && 2 <= c_req_a) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && c_req_d <= 52) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 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) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && req_a <= 2) && a <= 2) && 1 <= a_t) && 52 <= c_req_d) && v == req_d) && c_req_a <= 2)) || ((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && 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) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && 0 <= a_t) && 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))) && a_t <= 0) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((((((((((((((((((52 <= req_d && 0 <= a_t) && (((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))) && 0 == c_req_type) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && s_memory2 == req_d) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && 2 <= c_req_a) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1) && c_req_a <= 2)) || ((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1119]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((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) && 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)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 52 <= c_req_d) && i == req_a) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && m_run_st == 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && 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)) || ((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && m_run_st == 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && m_run_st == 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1317]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 <= a_t) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) || ((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 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)) || (((((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 && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 246]: 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) || ((((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 && 1 <= req_a) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && 1 <= a) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && (((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))) && 51 <= c_req_d) && 51 <= req_d) && c_req_a <= 1) && 50 <= req_d) && 1 <= c_req_a) && req_a <= 1) && c_req_d <= 51) && v == req_d) && req_d <= 50)) || (((((((((((((((((((((((((((1 <= c_req_type && 2 <= req_a) && c_req_type <= 1) && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && 52 <= req_d) && 2 <= c_req_a) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && c_req_d <= 52) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 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) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && req_a <= 2) && a <= 2) && 1 <= a_t) && 52 <= c_req_d) && v == req_d) && c_req_a <= 2)) || ((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && 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) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && 0 <= a_t) && 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))) && a_t <= 0) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) - InvariantResult [Line: 1295]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((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) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 1 <= a_t) && a <= 1) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((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)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 268]: 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) || ((((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && c_req_type <= 1) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || (((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: 728]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 238]: 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) || ((((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 && 1 <= req_a) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && 1 <= a) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && (((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))) && 51 <= c_req_d) && 51 <= req_d) && c_req_a <= 1) && 50 <= req_d) && 1 <= c_req_a) && req_a <= 1) && c_req_d <= 51) && v == req_d) && req_d <= 50)) || (((((((((((((((((((((((((((1 <= c_req_type && 2 <= req_a) && c_req_type <= 1) && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && 52 <= req_d) && 2 <= c_req_a) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && c_req_d <= 52) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 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) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && req_a <= 2) && a <= 2) && 1 <= a_t) && 52 <= c_req_d) && v == req_d) && c_req_a <= 2)) || ((((((((((((((((((req_d <= 50 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && 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) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && req_a <= 0) && 0 <= a_t) && 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))) && a_t <= 0) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && 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: 414]: Loop Invariant Derived loop invariant: (((((((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) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((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)) || ((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2) && i <= 1)) || (((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((52 <= v && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((((((((((((52 <= req_d && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 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: 528]: 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) || (((((((((((((((((((((((a <= 0 && 52 <= req_d) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && s_memory2 == req_d) && c_empty_req == 1) && req_a <= 2) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((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)) || (((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && 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: 422]: Loop Invariant Derived loop invariant: (((((((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) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 == c_req_type && 2 <= a) && req_tt_a == 1) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && req_type___0 == 0) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && a <= 2) && 2 <= c_write_rsp_ev) && a_t == 1) || (((((((((((((((((((((((((((50 == \result && 1 <= req_a___0) && 0 == c_req_type) && req_a___0 <= 1) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_type == 0) && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((52 <= req_d && s_memory0 == 50) && req_type___0 == 0) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && 0 == req_a___0) && c_empty_req == 1) && a == 0) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= a_t) && 2 <= req_a) && 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)) || (((((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: 378]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 101]: 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: 1113]: 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) || ((((((((((((((((((((52 <= v && 1 == req_a___0) && req_type == 0) && a == 1) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && v <= 52) && c_empty_rsp == 1) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && a_t == 1)) || (((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 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)) || (((((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_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((1 <= c_req_type && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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)) || ((((((((((((((((((((((a <= 0 && 52 <= req_d) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && m_run_pc == 6) && 0 == c_req_a) && s_memory2 == req_d) && req_a <= 2) && 2 <= c_write_req_ev) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && a_t == 0) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 0 <= a)) || (((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && v <= 52) && 1 <= i) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_req_a <= 2) && i <= 1)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && 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 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((2 <= c_write_req_ev && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((((((((((2 <= c_write_req_ev && a_t <= 1) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 1 <= a)) || ((((((((((a <= 0 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) && 0 <= a)) && m_run_pc == 6)) || ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && a_t <= 0) && 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) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 101]: 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: 638]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || (((((((2 <= c_write_req_ev && 1 <= a_t) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 <= a) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((52 <= v && req_tt_a == 2) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && i <= 1) && c_req_a <= 2)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((52 <= v && s_memory2 == 52) && (((((((((((1 == req_a___0 && 1 <= c_req_a) && ((((((((0 <= a_t && 2 <= c_write_req_ev) && a <= 1) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((2 <= c_write_req_ev && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && a_t == 0) && 0 == req_a) && c_req_a <= 1) && m_run_pc == 6) || ((((((((((1 == req_a___0 && 1 <= c_req_a) && ((((((((0 <= a_t && 2 <= c_write_req_ev) && a <= 1) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((2 <= c_write_req_ev && a_t <= 1) && a <= 1) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 0 == req_a) && req_tt_a == 1) && c_req_a <= 1) && m_run_pc == 6))) && v <= 52) && 1 <= a)) || ((((((((((0 <= a_t && 2 <= c_write_req_ev) && a <= 1) && 2 <= s_run_st) && a_t <= 0) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((2 <= c_write_req_ev && a_t <= 1) && 1 <= a_t) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) && 1 <= a)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= a) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && a_t <= 0) && 0 == req_a) && 50 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) && 52 <= v) && a <= 0) && 0 <= a_t) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a___0) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || ((((((((a <= 0 && 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)) || (((((((((((((((((((((((52 <= v && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && 1 <= i) && v <= 52) && c_empty_rsp == 1) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_req_a) && 2 == req_a___0) && 2 <= c_write_req_ev) && 1 <= a_t) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && a == 2) && i <= 1) && c_req_a <= 2) && a_t == 1)) || (((((((((((((((((((a <= 0 && 52 <= req_d) && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 52) && 2 == s_run_pc) && 2 <= req_a) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 810]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 2 <= s_run_st) && 52 == \result) && 2 <= i) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && rsp_d___0 == 52) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2) || ((((((((((((((((((((((((((((((rsp_d___0 == 51 && 0 == c_req_type) && req_tt_a == 1) && c_empty_rsp == 1) && 1 <= a) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && 51 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && i <= 1) && 1 == req_a___0) && 52 <= v) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1)) || (((((((((((((((((((((((((50 == \result && 0 == c_req_type) && 0 == req_a) && c_empty_rsp == 1) && 50 == rsp_d) && c_empty_req == 1) && a == 0) && 2 <= s_run_st) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 52 <= v) && rsp_d___0 == 50) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && a_t == 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1033]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a <= 0 && ((((c_empty_req == 1 && 0 == s_run_pc) && !(2 == s_run_pc)) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3))) && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= a) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a)) || (((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 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) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && req_d <= 50) && 0 <= a)) || (((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && 1 == c_write_rsp_ev) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc)) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((1 <= req_a && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && 1 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= s_run_st) && a <= 1) && i == req_a) && req_type <= 1) && 1 <= req_type) && c_m_lock <= 0) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && 51 <= req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && req_a <= 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && v == req_d) && 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)) || ((((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((((((((((((((2 <= req_a && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && 52 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= req_type) && c_m_lock <= 0) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 1) && s_memory0 == 50) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && req_a <= 2) && 2 <= c_write_req_ev) && a <= 2) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 2 <= c_write_rsp_ev)) || (((((((((((((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: 101]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 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)) || (((((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)) || ((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 <= a_t) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((((((((0 <= a_t && a_t <= 0) && 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) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((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 && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((2 <= req_a && s_memory1 == req_d) && req_d <= 51) && 2 <= a) && c_empty_rsp == 1) && 52 <= req_d) && c_empty_req == 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && 51 <= req_d) && a_t <= 1) && s_memory0 == 50) && req_d <= 52) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && req_a <= 2) && 2 <= c_write_req_ev) && a <= 2) && 1 <= a_t) && c_req_d <= 51) && v == req_d) && 2 <= c_write_rsp_ev) || ((((((((((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)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((((((((1 <= req_a && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && 1 <= a) && c_empty_req == 1) && a <= 1) && 2 <= s_run_st) && i == req_a) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 2 == s_run_pc) && req_d <= 51) && 0 <= a_t) && 51 <= req_d) && m_run_pc == 3) && 50 <= req_d) && c_req_d <= 50) && req_a <= 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && v == req_d) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((((((req_d <= 50 && a <= 0) && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && 1 <= c_m_lock) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) && 0 <= a) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((a <= 0 && ((((c_empty_req == 1 && 0 == s_run_pc) && !(2 == s_run_pc)) && m_run_pc == 3) || (((c_empty_req == 1 && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3))) && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a) || ((((((((((((((((((((((((((52 == c_rsp_d && 0 == c_req_type) && 1 == c_write_rsp_ev) && i <= 2) && 2 <= a) && 2 <= c_req_a) && c_empty_req == 1) && req_a <= 2) && 52 == x) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 == req_a___0) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && c_req_a <= 2)) || ((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= a) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a)) || (((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && s_memory0 == req_d) && 1 == c_write_rsp_ev) && 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) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && req_d <= 50) && 0 <= a)) || (((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && 1 == c_write_rsp_ev) && req_a <= 1) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc)) || ((((((((((((((((((((((((((a == 1 && 0 == c_req_type) && 1 == c_write_rsp_ev) && req_tt_a == 1) && 51 == rsp_d) && c_empty_req == 1) && 51 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && s_memory0 == 50) && 51 == x) && s_memory1 == 51) && 1 <= req_a) && req_a <= 1) && 51 == \result) && 1 <= i) && v <= 52) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && a_t == 1)) || ((((((((((((((((((((((52 <= v && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && 1 == c_write_rsp_ev) && 0 == req_a) && v <= 52) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && s_memory2 == 52) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) && 0 <= a) || (((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && s_memory2 == req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_a <= 2) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && 1 <= a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= a_t) && a <= 1) && c_req_d <= 51) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((((((((0 == c_req_type && i <= 2) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && c_empty_req == 1) && 52 == x) && req_a <= 2) && 52 == \result) && 1 <= c_m_lock) && 2 <= i) && 2 == s_run_pc) && 52 <= v) && req_tt_a == 2) && req_type == 0) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && m_run_pc == 6) && s_memory2 == 52) && 2 == req_a___0) && 2 <= c_write_req_ev) && 52 == rsp_d) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((((((52 <= v && a <= 0) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && s_memory1 == 51) && v <= 52) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && s_memory2 == 52) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 1 <= c_m_lock) && a_t == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((a <= 0 && (((((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) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && req_d <= 50) && 0 <= a)) || (((((((((((((((((((((((((((0 == c_req_type && req_tt_a == 1) && 1 <= a) && c_empty_rsp == 1) && 51 == rsp_d) && c_empty_req == 1) && a <= 1) && 1 <= c_m_lock) && 2 == s_run_pc) && i <= 1) && 52 <= v) && 1 == req_a___0) && req_type == 0) && 51 == x) && s_memory0 == 50) && s_memory1 == 51) && 1 <= req_a) && 51 == \result) && req_a <= 1) && v <= 52) && 1 <= i) && c_req_a <= 1) && m_run_pc == 6) && 1 <= c_req_a) && s_memory2 == 52) && 2 <= c_write_req_ev) && 2 <= c_write_rsp_ev) && a_t == 1) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && 3 <= a) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 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: 1198]: Loop Invariant Derived loop invariant: ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && 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: 430]: Loop Invariant Derived loop invariant: (((((((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) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 288]: 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) || ((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((((((((((((52 <= req_d && i == 2) && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && req_d <= 52) && 2 == s_run_pc) && 2 <= a_t) && 2 <= c_write_rsp_ev)) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((1 <= c_req_type && 51 <= req_d) && c_req_type <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 2 <= a) && c_empty_rsp == 1) && 2 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= a_t) && i == req_a) && 52 <= c_req_d) && 1 <= c_m_lock) && v == req_d) && c_req_d <= 52) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_req_a <= 2)) || (((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 51 <= c_req_d) && m_run_pc == 3) && 1 <= a) && c_empty_req == 1) && i == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && a_t <= 1) && c_req_type <= 1) && s_memory0 == req_d) && 51 <= c_req_d) && 0 == req_a) && c_empty_rsp == 1) && c_req_a <= 1) && 1 <= a) && 50 <= req_d) && 1 <= c_req_a) && 2 <= c_write_req_ev) && a <= 1) && c_req_d <= 51) && i == req_a) && 1 <= c_m_lock) && 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) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 0 == s_run_pc) && !(2 == s_run_pc)) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 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) && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((a <= 0 && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && a_t <= 0) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: (((((((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) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && 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: 438]: Loop Invariant Derived loop invariant: (((((((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) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && s_memory1 == 51) && m_run_pc == 3) && 2 <= a) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((((((((((a <= 0 && 0 <= a_t) && a_t <= 0) && 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) && 2 <= c_write_req_ev) && 2 <= s_run_st) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && 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) && a <= 1) && 1 <= a_t) && i == req_a) && c_req_d <= 51) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && a_t <= 0) && 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) && c_m_lock <= 0) && 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)) || ((((((((((((((((((((52 <= req_d && s_memory0 == 50) && 3 <= a) && s_memory1 == 51) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory2 == req_d) && 2 <= c_write_req_ev) && req_a <= 2) && 2 <= s_run_st) && i == req_a) && 52 <= c_req_d) && v == req_d) && c_req_d <= 52) && req_d <= 52) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= a_t) && 2 <= req_a) && 2 <= c_write_rsp_ev)) || (((((((((((0 == c_req_a && a == 0) && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && a_t <= 0) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 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)) || (((((((((((((((((((((51 <= req_d && a_t <= 1) && s_memory0 == 50) && s_memory1 == req_d) && req_d <= 51) && 1 <= req_a) && req_a <= 1) && 51 <= c_req_d) && 2 <= a) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_req_ev) && a <= 2) && 1 <= a_t) && 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)) || (((((((((((((((((((0 <= a_t && a_t <= 0) && 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) && a <= 1) && 2 <= s_run_st) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 274 locations, 5 error locations. Result: SAFE, OverallTime: 30.9s, OverallIterations: 31, TraceHistogramMax: 12, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 168.6s, HoareTripleCheckerStatistics: 20172 SDtfs, 37274 SDslu, 87927 SDs, 0 SdLazy, 7393 SolverSat, 920 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3636 GetRequests, 3184 SyntacticMatches, 14 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4952 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9473occurred 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: 5.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 78338 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1227 NumberOfFragments, 31385 HoareAnnotationTreeSize, 98 FomulaSimplifications, 1328014589 FormulaSimplificationTreeSizeReduction, 28.2s HoareSimplificationTime, 98 FomulaSimplificationsInter, 206718509 FormulaSimplificationTreeSizeReductionInter, 140.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 9526 NumberOfCodeBlocks, 9526 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 9488 ConstructedInterpolants, 0 QuantifiedInterpolants, 15443576 SizeOfPredicates, 94 NumberOfNonLiveVariables, 8483 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 6137/10826 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...