./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.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_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/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 fbecaa911234564619645b897eed5716f7c8acd9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:31:33,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:31:33,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:31:33,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:31:33,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:31:33,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:31:33,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:31:33,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:31:33,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:31:33,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:31:33,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:31:33,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:31:33,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:31:33,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:31:33,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:31:33,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:31:33,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:31:33,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:31:33,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:31:33,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:31:33,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:31:33,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:31:33,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:31:33,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:31:33,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:31:33,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:31:33,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:31:33,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:31:33,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:31:33,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:31:33,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:31:33,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:31:33,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:31:33,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:31:33,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:31:33,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:31:33,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:31:33,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:31:33,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:31:33,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:31:33,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:31:33,266 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:31:33,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:31:33,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:31:33,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:31:33,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:31:33,280 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:31:33,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:31:33,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:31:33,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:31:33,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:31:33,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:31:33,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:31:33,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:31:33,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:31:33,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:31:33,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:31:33,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:31:33,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:31:33,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:31:33,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:31:33,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:31:33,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:31:33,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:31:33,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:31:33,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:31:33,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:31:33,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:31:33,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:31:33,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:31:33,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:31:33,284 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_d86de3ad-8733-4d62-bbbf-47c5322013b5/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 -> fbecaa911234564619645b897eed5716f7c8acd9 [2019-12-07 17:31:33,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:31:33,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:31:33,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:31:33,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:31:33,405 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:31:33,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2019-12-07 17:31:33,445 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/data/c64e5199f/6f56e39f52c84929a0b671bf5f747f4e/FLAGe1c25aec2 [2019-12-07 17:31:33,802 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:31:33,803 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2019-12-07 17:31:33,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/data/c64e5199f/6f56e39f52c84929a0b671bf5f747f4e/FLAGe1c25aec2 [2019-12-07 17:31:33,820 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/data/c64e5199f/6f56e39f52c84929a0b671bf5f747f4e [2019-12-07 17:31:33,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:31:33,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:31:33,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:31:33,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:31:33,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:31:33,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:31:33" (1/1) ... [2019-12-07 17:31:33,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e22ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:33, skipping insertion in model container [2019-12-07 17:31:33,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:31:33" (1/1) ... [2019-12-07 17:31:33,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:31:33,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:31:34,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:31:34,055 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:31:34,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:31:34,128 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:31:34,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34 WrapperNode [2019-12-07 17:31:34,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:31:34,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:31:34,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:31:34,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:31:34,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:31:34,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:31:34,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:31:34,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:31:34,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... [2019-12-07 17:31:34,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:31:34,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:31:34,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:31:34,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:31:34,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/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 17:31:34,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:31:34,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:31:34,771 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:31:34,771 INFO L287 CfgBuilder]: Removed 39 assume(true) statements. [2019-12-07 17:31:34,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:31:34 BoogieIcfgContainer [2019-12-07 17:31:34,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:31:34,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:31:34,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:31:34,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:31:34,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:31:33" (1/3) ... [2019-12-07 17:31:34,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3852787f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:31:34, skipping insertion in model container [2019-12-07 17:31:34,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:31:34" (2/3) ... [2019-12-07 17:31:34,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3852787f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:31:34, skipping insertion in model container [2019-12-07 17:31:34,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:31:34" (3/3) ... [2019-12-07 17:31:34,777 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2019-12-07 17:31:34,783 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:31:34,788 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-12-07 17:31:34,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:31:34,812 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:31:34,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:31:34,813 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:31:34,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:31:34,813 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:31:34,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:31:34,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:31:34,813 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:31:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2019-12-07 17:31:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:31:34,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:34,836 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] [2019-12-07 17:31:34,836 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 17:31:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash 991682984, now seen corresponding path program 1 times [2019-12-07 17:31:34,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:34,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299649827] [2019-12-07 17:31:34,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:34,954 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 17:31:34,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299649827] [2019-12-07 17:31:34,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:34,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:34,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334312052] [2019-12-07 17:31:34,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:34,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:34,972 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 3 states. [2019-12-07 17:31:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:35,227 INFO L93 Difference]: Finished difference Result 719 states and 1304 transitions. [2019-12-07 17:31:35,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:35,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 17:31:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:35,239 INFO L225 Difference]: With dead ends: 719 [2019-12-07 17:31:35,239 INFO L226 Difference]: Without dead ends: 446 [2019-12-07 17:31:35,242 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 17:31:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-07 17:31:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 430. [2019-12-07 17:31:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-12-07 17:31:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 673 transitions. [2019-12-07 17:31:35,292 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 673 transitions. Word has length 27 [2019-12-07 17:31:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:35,292 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 673 transitions. [2019-12-07 17:31:35,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 673 transitions. [2019-12-07 17:31:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:31:35,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:35,294 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] [2019-12-07 17:31:35,295 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 17:31:35,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:35,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2034129844, now seen corresponding path program 1 times [2019-12-07 17:31:35,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:35,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487297616] [2019-12-07 17:31:35,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:35,331 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 17:31:35,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487297616] [2019-12-07 17:31:35,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:35,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:35,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059908650] [2019-12-07 17:31:35,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:35,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:35,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:35,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:35,334 INFO L87 Difference]: Start difference. First operand 430 states and 673 transitions. Second operand 3 states. [2019-12-07 17:31:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:35,428 INFO L93 Difference]: Finished difference Result 1123 states and 1781 transitions. [2019-12-07 17:31:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:35,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 17:31:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:35,432 INFO L225 Difference]: With dead ends: 1123 [2019-12-07 17:31:35,432 INFO L226 Difference]: Without dead ends: 707 [2019-12-07 17:31:35,434 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 17:31:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-07 17:31:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 691. [2019-12-07 17:31:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-07 17:31:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1112 transitions. [2019-12-07 17:31:35,462 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1112 transitions. Word has length 36 [2019-12-07 17:31:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:35,462 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1112 transitions. [2019-12-07 17:31:35,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1112 transitions. [2019-12-07 17:31:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:31:35,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:35,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:35,464 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 17:31:35,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash -838577631, now seen corresponding path program 1 times [2019-12-07 17:31:35,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:35,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927885905] [2019-12-07 17:31:35,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:35,497 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 17:31:35,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927885905] [2019-12-07 17:31:35,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:35,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:35,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866719903] [2019-12-07 17:31:35,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:35,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:35,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:35,499 INFO L87 Difference]: Start difference. First operand 691 states and 1112 transitions. Second operand 3 states. [2019-12-07 17:31:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:35,540 INFO L93 Difference]: Finished difference Result 1749 states and 2817 transitions. [2019-12-07 17:31:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:35,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 17:31:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:35,546 INFO L225 Difference]: With dead ends: 1749 [2019-12-07 17:31:35,546 INFO L226 Difference]: Without dead ends: 1083 [2019-12-07 17:31:35,548 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 17:31:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-12-07 17:31:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1071. [2019-12-07 17:31:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-12-07 17:31:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1722 transitions. [2019-12-07 17:31:35,582 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1722 transitions. Word has length 37 [2019-12-07 17:31:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:35,582 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 1722 transitions. [2019-12-07 17:31:35,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1722 transitions. [2019-12-07 17:31:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:31:35,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:35,585 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 17:31:35,585 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 17:31:35,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:35,585 INFO L82 PathProgramCache]: Analyzing trace with hash -981805896, now seen corresponding path program 1 times [2019-12-07 17:31:35,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:35,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649826568] [2019-12-07 17:31:35,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:35,629 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 17:31:35,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649826568] [2019-12-07 17:31:35,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:35,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:35,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171306837] [2019-12-07 17:31:35,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:35,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:35,631 INFO L87 Difference]: Start difference. First operand 1071 states and 1722 transitions. Second operand 3 states. [2019-12-07 17:31:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:35,697 INFO L93 Difference]: Finished difference Result 2861 states and 4598 transitions. [2019-12-07 17:31:35,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:35,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 17:31:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:35,708 INFO L225 Difference]: With dead ends: 2861 [2019-12-07 17:31:35,708 INFO L226 Difference]: Without dead ends: 1815 [2019-12-07 17:31:35,710 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 17:31:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-12-07 17:31:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1669. [2019-12-07 17:31:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-12-07 17:31:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2644 transitions. [2019-12-07 17:31:35,770 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2644 transitions. Word has length 46 [2019-12-07 17:31:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:35,770 INFO L462 AbstractCegarLoop]: Abstraction has 1669 states and 2644 transitions. [2019-12-07 17:31:35,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2644 transitions. [2019-12-07 17:31:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:31:35,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:35,772 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 17:31:35,772 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 17:31:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-12-07 17:31:35,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:35,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736759249] [2019-12-07 17:31:35,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:35,803 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 17:31:35,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736759249] [2019-12-07 17:31:35,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:35,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:35,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257397622] [2019-12-07 17:31:35,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:35,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:35,804 INFO L87 Difference]: Start difference. First operand 1669 states and 2644 transitions. Second operand 3 states. [2019-12-07 17:31:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:35,943 INFO L93 Difference]: Finished difference Result 4653 states and 7348 transitions. [2019-12-07 17:31:35,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:35,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:31:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:35,955 INFO L225 Difference]: With dead ends: 4653 [2019-12-07 17:31:35,955 INFO L226 Difference]: Without dead ends: 3003 [2019-12-07 17:31:35,958 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 17:31:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2019-12-07 17:31:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2937. [2019-12-07 17:31:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-12-07 17:31:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4575 transitions. [2019-12-07 17:31:36,034 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 4575 transitions. Word has length 52 [2019-12-07 17:31:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:36,034 INFO L462 AbstractCegarLoop]: Abstraction has 2937 states and 4575 transitions. [2019-12-07 17:31:36,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 4575 transitions. [2019-12-07 17:31:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:31:36,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:36,035 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 17:31:36,035 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 17:31:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-12-07 17:31:36,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:36,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374393032] [2019-12-07 17:31:36,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:36,059 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 17:31:36,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374393032] [2019-12-07 17:31:36,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:36,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:36,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201823566] [2019-12-07 17:31:36,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:36,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:36,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:36,060 INFO L87 Difference]: Start difference. First operand 2937 states and 4575 transitions. Second operand 3 states. [2019-12-07 17:31:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:36,166 INFO L93 Difference]: Finished difference Result 6903 states and 10702 transitions. [2019-12-07 17:31:36,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:36,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:31:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:36,182 INFO L225 Difference]: With dead ends: 6903 [2019-12-07 17:31:36,183 INFO L226 Difference]: Without dead ends: 3989 [2019-12-07 17:31:36,186 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 17:31:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2019-12-07 17:31:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3805. [2019-12-07 17:31:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2019-12-07 17:31:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 5841 transitions. [2019-12-07 17:31:36,290 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 5841 transitions. Word has length 52 [2019-12-07 17:31:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:36,290 INFO L462 AbstractCegarLoop]: Abstraction has 3805 states and 5841 transitions. [2019-12-07 17:31:36,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 5841 transitions. [2019-12-07 17:31:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:31:36,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:36,292 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] [2019-12-07 17:31:36,292 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 17:31:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:36,293 INFO L82 PathProgramCache]: Analyzing trace with hash -471765361, now seen corresponding path program 1 times [2019-12-07 17:31:36,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:36,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185926014] [2019-12-07 17:31:36,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:36,321 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 17:31:36,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185926014] [2019-12-07 17:31:36,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:36,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:36,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43286289] [2019-12-07 17:31:36,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:36,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:36,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:36,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:36,322 INFO L87 Difference]: Start difference. First operand 3805 states and 5841 transitions. Second operand 3 states. [2019-12-07 17:31:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:36,676 INFO L93 Difference]: Finished difference Result 9149 states and 14130 transitions. [2019-12-07 17:31:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:36,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 17:31:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:36,704 INFO L225 Difference]: With dead ends: 9149 [2019-12-07 17:31:36,704 INFO L226 Difference]: Without dead ends: 5367 [2019-12-07 17:31:36,709 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 17:31:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2019-12-07 17:31:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5277. [2019-12-07 17:31:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5277 states. [2019-12-07 17:31:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 8009 transitions. [2019-12-07 17:31:36,849 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 8009 transitions. Word has length 56 [2019-12-07 17:31:36,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:36,849 INFO L462 AbstractCegarLoop]: Abstraction has 5277 states and 8009 transitions. [2019-12-07 17:31:36,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 8009 transitions. [2019-12-07 17:31:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:31:36,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:36,850 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 17:31:36,850 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 17:31:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:36,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1405970949, now seen corresponding path program 1 times [2019-12-07 17:31:36,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:36,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20335595] [2019-12-07 17:31:36,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:36,877 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 17:31:36,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20335595] [2019-12-07 17:31:36,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:36,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:36,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211380593] [2019-12-07 17:31:36,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:36,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:36,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:36,878 INFO L87 Difference]: Start difference. First operand 5277 states and 8009 transitions. Second operand 3 states. [2019-12-07 17:31:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:37,025 INFO L93 Difference]: Finished difference Result 10531 states and 15988 transitions. [2019-12-07 17:31:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:37,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 17:31:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:37,045 INFO L225 Difference]: With dead ends: 10531 [2019-12-07 17:31:37,046 INFO L226 Difference]: Without dead ends: 5277 [2019-12-07 17:31:37,051 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 17:31:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2019-12-07 17:31:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 5277. [2019-12-07 17:31:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5277 states. [2019-12-07 17:31:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7873 transitions. [2019-12-07 17:31:37,231 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7873 transitions. Word has length 58 [2019-12-07 17:31:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:37,231 INFO L462 AbstractCegarLoop]: Abstraction has 5277 states and 7873 transitions. [2019-12-07 17:31:37,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7873 transitions. [2019-12-07 17:31:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:31:37,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:37,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:37,233 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 17:31:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:37,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1783171650, now seen corresponding path program 1 times [2019-12-07 17:31:37,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:37,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051290386] [2019-12-07 17:31:37,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:37,255 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 17:31:37,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051290386] [2019-12-07 17:31:37,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:37,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:37,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590297814] [2019-12-07 17:31:37,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:37,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:37,257 INFO L87 Difference]: Start difference. First operand 5277 states and 7873 transitions. Second operand 3 states. [2019-12-07 17:31:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:37,529 INFO L93 Difference]: Finished difference Result 11891 states and 17776 transitions. [2019-12-07 17:31:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:37,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 17:31:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:37,551 INFO L225 Difference]: With dead ends: 11891 [2019-12-07 17:31:37,551 INFO L226 Difference]: Without dead ends: 6637 [2019-12-07 17:31:37,557 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 17:31:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2019-12-07 17:31:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 5907. [2019-12-07 17:31:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5907 states. [2019-12-07 17:31:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5907 states to 5907 states and 8635 transitions. [2019-12-07 17:31:37,679 INFO L78 Accepts]: Start accepts. Automaton has 5907 states and 8635 transitions. Word has length 59 [2019-12-07 17:31:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:37,679 INFO L462 AbstractCegarLoop]: Abstraction has 5907 states and 8635 transitions. [2019-12-07 17:31:37,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5907 states and 8635 transitions. [2019-12-07 17:31:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 17:31:37,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:37,681 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 17:31:37,681 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 17:31:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash -920667186, now seen corresponding path program 1 times [2019-12-07 17:31:37,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:37,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769143446] [2019-12-07 17:31:37,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:37,714 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 17:31:37,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769143446] [2019-12-07 17:31:37,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:37,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:31:37,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054021566] [2019-12-07 17:31:37,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:31:37,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:37,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:31:37,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:31:37,716 INFO L87 Difference]: Start difference. First operand 5907 states and 8635 transitions. Second operand 5 states. [2019-12-07 17:31:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:38,208 INFO L93 Difference]: Finished difference Result 30963 states and 45372 transitions. [2019-12-07 17:31:38,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:31:38,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-07 17:31:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:38,249 INFO L225 Difference]: With dead ends: 30963 [2019-12-07 17:31:38,249 INFO L226 Difference]: Without dead ends: 25079 [2019-12-07 17:31:38,259 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 17:31:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25079 states. [2019-12-07 17:31:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25079 to 8255. [2019-12-07 17:31:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8255 states. [2019-12-07 17:31:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 12088 transitions. [2019-12-07 17:31:38,579 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 12088 transitions. Word has length 61 [2019-12-07 17:31:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:38,579 INFO L462 AbstractCegarLoop]: Abstraction has 8255 states and 12088 transitions. [2019-12-07 17:31:38,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:31:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 12088 transitions. [2019-12-07 17:31:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:31:38,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:38,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:38,581 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 17:31:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:38,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1524549323, now seen corresponding path program 1 times [2019-12-07 17:31:38,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:38,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629604315] [2019-12-07 17:31:38,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:38,655 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 17:31:38,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629604315] [2019-12-07 17:31:38,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:38,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:31:38,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940264029] [2019-12-07 17:31:38,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:31:38,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:31:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:31:38,656 INFO L87 Difference]: Start difference. First operand 8255 states and 12088 transitions. Second operand 7 states. [2019-12-07 17:31:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:39,912 INFO L93 Difference]: Finished difference Result 41073 states and 60227 transitions. [2019-12-07 17:31:39,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 17:31:39,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 17:31:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:39,943 INFO L225 Difference]: With dead ends: 41073 [2019-12-07 17:31:39,943 INFO L226 Difference]: Without dead ends: 32841 [2019-12-07 17:31:39,954 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 17:31:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32841 states. [2019-12-07 17:31:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32841 to 5497. [2019-12-07 17:31:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2019-12-07 17:31:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 7945 transitions. [2019-12-07 17:31:40,357 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 7945 transitions. Word has length 62 [2019-12-07 17:31:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:40,358 INFO L462 AbstractCegarLoop]: Abstraction has 5497 states and 7945 transitions. [2019-12-07 17:31:40,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:31:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 7945 transitions. [2019-12-07 17:31:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 17:31:40,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:40,359 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 17:31:40,359 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 17:31:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1908319894, now seen corresponding path program 1 times [2019-12-07 17:31:40,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:40,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186988018] [2019-12-07 17:31:40,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:40,380 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 17:31:40,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186988018] [2019-12-07 17:31:40,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:40,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:40,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331929771] [2019-12-07 17:31:40,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:40,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:40,382 INFO L87 Difference]: Start difference. First operand 5497 states and 7945 transitions. Second operand 3 states. [2019-12-07 17:31:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:40,641 INFO L93 Difference]: Finished difference Result 11578 states and 16683 transitions. [2019-12-07 17:31:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:40,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-12-07 17:31:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:40,647 INFO L225 Difference]: With dead ends: 11578 [2019-12-07 17:31:40,647 INFO L226 Difference]: Without dead ends: 6102 [2019-12-07 17:31:40,653 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 17:31:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-12-07 17:31:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 6010. [2019-12-07 17:31:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6010 states. [2019-12-07 17:31:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 8641 transitions. [2019-12-07 17:31:40,860 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 8641 transitions. Word has length 77 [2019-12-07 17:31:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:40,860 INFO L462 AbstractCegarLoop]: Abstraction has 6010 states and 8641 transitions. [2019-12-07 17:31:40,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 8641 transitions. [2019-12-07 17:31:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:31:40,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:40,862 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 17:31:40,862 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 17:31:40,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:40,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1154888105, now seen corresponding path program 1 times [2019-12-07 17:31:40,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:40,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499572002] [2019-12-07 17:31:40,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:40,884 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 17:31:40,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499572002] [2019-12-07 17:31:40,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:40,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:40,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506423719] [2019-12-07 17:31:40,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:40,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:40,886 INFO L87 Difference]: Start difference. First operand 6010 states and 8641 transitions. Second operand 3 states. [2019-12-07 17:31:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:41,253 INFO L93 Difference]: Finished difference Result 15494 states and 22182 transitions. [2019-12-07 17:31:41,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:41,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-12-07 17:31:41,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:41,260 INFO L225 Difference]: With dead ends: 15494 [2019-12-07 17:31:41,260 INFO L226 Difference]: Without dead ends: 9373 [2019-12-07 17:31:41,265 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 17:31:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9373 states. [2019-12-07 17:31:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9373 to 9345. [2019-12-07 17:31:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9345 states. [2019-12-07 17:31:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9345 states to 9345 states and 13259 transitions. [2019-12-07 17:31:41,590 INFO L78 Accepts]: Start accepts. Automaton has 9345 states and 13259 transitions. Word has length 88 [2019-12-07 17:31:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:41,591 INFO L462 AbstractCegarLoop]: Abstraction has 9345 states and 13259 transitions. [2019-12-07 17:31:41,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 9345 states and 13259 transitions. [2019-12-07 17:31:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:31:41,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:41,593 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 17:31:41,593 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 17:31:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:41,593 INFO L82 PathProgramCache]: Analyzing trace with hash -258076045, now seen corresponding path program 1 times [2019-12-07 17:31:41,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:41,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714670240] [2019-12-07 17:31:41,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:41,624 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 17:31:41,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714670240] [2019-12-07 17:31:41,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:41,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:41,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591452797] [2019-12-07 17:31:41,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:41,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:41,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:41,626 INFO L87 Difference]: Start difference. First operand 9345 states and 13259 transitions. Second operand 3 states. [2019-12-07 17:31:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:41,975 INFO L93 Difference]: Finished difference Result 17198 states and 24332 transitions. [2019-12-07 17:31:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:41,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-07 17:31:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:41,981 INFO L225 Difference]: With dead ends: 17198 [2019-12-07 17:31:41,981 INFO L226 Difference]: Without dead ends: 6890 [2019-12-07 17:31:41,990 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 17:31:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2019-12-07 17:31:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6477. [2019-12-07 17:31:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6477 states. [2019-12-07 17:31:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6477 states to 6477 states and 8769 transitions. [2019-12-07 17:31:42,314 INFO L78 Accepts]: Start accepts. Automaton has 6477 states and 8769 transitions. Word has length 95 [2019-12-07 17:31:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:42,314 INFO L462 AbstractCegarLoop]: Abstraction has 6477 states and 8769 transitions. [2019-12-07 17:31:42,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6477 states and 8769 transitions. [2019-12-07 17:31:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:31:42,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:42,315 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 17:31:42,316 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 17:31:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash 642962762, now seen corresponding path program 1 times [2019-12-07 17:31:42,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:42,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954853537] [2019-12-07 17:31:42,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:42,337 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 17:31:42,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954853537] [2019-12-07 17:31:42,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:42,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:42,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073489370] [2019-12-07 17:31:42,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:42,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:42,338 INFO L87 Difference]: Start difference. First operand 6477 states and 8769 transitions. Second operand 3 states. [2019-12-07 17:31:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:42,515 INFO L93 Difference]: Finished difference Result 10474 states and 14252 transitions. [2019-12-07 17:31:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:42,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 17:31:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:42,518 INFO L225 Difference]: With dead ends: 10474 [2019-12-07 17:31:42,518 INFO L226 Difference]: Without dead ends: 4111 [2019-12-07 17:31:42,523 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 17:31:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-12-07 17:31:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4093. [2019-12-07 17:31:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4093 states. [2019-12-07 17:31:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 5426 transitions. [2019-12-07 17:31:42,668 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 5426 transitions. Word has length 98 [2019-12-07 17:31:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:42,668 INFO L462 AbstractCegarLoop]: Abstraction has 4093 states and 5426 transitions. [2019-12-07 17:31:42,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 5426 transitions. [2019-12-07 17:31:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:31:42,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:42,669 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 17:31:42,669 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 17:31:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 635068147, now seen corresponding path program 1 times [2019-12-07 17:31:42,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:42,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578281600] [2019-12-07 17:31:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:42,698 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 17:31:42,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578281600] [2019-12-07 17:31:42,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:42,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:42,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901417019] [2019-12-07 17:31:42,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:42,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:42,700 INFO L87 Difference]: Start difference. First operand 4093 states and 5426 transitions. Second operand 3 states. [2019-12-07 17:31:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:42,843 INFO L93 Difference]: Finished difference Result 7248 states and 9640 transitions. [2019-12-07 17:31:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:42,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 17:31:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:42,846 INFO L225 Difference]: With dead ends: 7248 [2019-12-07 17:31:42,846 INFO L226 Difference]: Without dead ends: 3230 [2019-12-07 17:31:42,849 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 17:31:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-12-07 17:31:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 2928. [2019-12-07 17:31:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-07 17:31:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3791 transitions. [2019-12-07 17:31:42,963 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3791 transitions. Word has length 98 [2019-12-07 17:31:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:42,963 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 3791 transitions. [2019-12-07 17:31:42,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3791 transitions. [2019-12-07 17:31:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:31:42,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:42,964 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 17:31:42,964 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 17:31:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1785938939, now seen corresponding path program 1 times [2019-12-07 17:31:42,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:42,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50054998] [2019-12-07 17:31:42,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:42,997 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 17:31:42,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50054998] [2019-12-07 17:31:42,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:42,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:42,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264619009] [2019-12-07 17:31:42,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:42,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:42,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:42,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:42,998 INFO L87 Difference]: Start difference. First operand 2928 states and 3791 transitions. Second operand 3 states. [2019-12-07 17:31:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:43,166 INFO L93 Difference]: Finished difference Result 3246 states and 4167 transitions. [2019-12-07 17:31:43,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:43,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 17:31:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:43,168 INFO L225 Difference]: With dead ends: 3246 [2019-12-07 17:31:43,168 INFO L226 Difference]: Without dead ends: 3242 [2019-12-07 17:31:43,169 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 17:31:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2019-12-07 17:31:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3217. [2019-12-07 17:31:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-12-07 17:31:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4120 transitions. [2019-12-07 17:31:43,295 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4120 transitions. Word has length 99 [2019-12-07 17:31:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:43,295 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4120 transitions. [2019-12-07 17:31:43,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4120 transitions. [2019-12-07 17:31:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 17:31:43,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:43,297 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] [2019-12-07 17:31:43,297 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 17:31:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1770134526, now seen corresponding path program 1 times [2019-12-07 17:31:43,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:43,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311685265] [2019-12-07 17:31:43,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:31:43,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311685265] [2019-12-07 17:31:43,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:43,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:31:43,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085217105] [2019-12-07 17:31:43,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:31:43,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:31:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:31:43,345 INFO L87 Difference]: Start difference. First operand 3217 states and 4120 transitions. Second operand 5 states. [2019-12-07 17:31:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:43,530 INFO L93 Difference]: Finished difference Result 6362 states and 8192 transitions. [2019-12-07 17:31:43,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:31:43,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-12-07 17:31:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:43,532 INFO L225 Difference]: With dead ends: 6362 [2019-12-07 17:31:43,533 INFO L226 Difference]: Without dead ends: 3353 [2019-12-07 17:31:43,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:31:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2019-12-07 17:31:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2976. [2019-12-07 17:31:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-12-07 17:31:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3815 transitions. [2019-12-07 17:31:43,665 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3815 transitions. Word has length 156 [2019-12-07 17:31:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:43,665 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3815 transitions. [2019-12-07 17:31:43,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:31:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3815 transitions. [2019-12-07 17:31:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 17:31:43,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:43,667 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:43,667 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 17:31:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash -301012961, now seen corresponding path program 1 times [2019-12-07 17:31:43,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:43,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436313518] [2019-12-07 17:31:43,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:31:43,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436313518] [2019-12-07 17:31:43,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:43,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:43,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764624015] [2019-12-07 17:31:43,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:43,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:43,702 INFO L87 Difference]: Start difference. First operand 2976 states and 3815 transitions. Second operand 3 states. [2019-12-07 17:31:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:44,024 INFO L93 Difference]: Finished difference Result 6619 states and 8530 transitions. [2019-12-07 17:31:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:44,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-12-07 17:31:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:44,027 INFO L225 Difference]: With dead ends: 6619 [2019-12-07 17:31:44,027 INFO L226 Difference]: Without dead ends: 3857 [2019-12-07 17:31:44,029 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 17:31:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2019-12-07 17:31:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3788. [2019-12-07 17:31:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2019-12-07 17:31:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 4739 transitions. [2019-12-07 17:31:44,191 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 4739 transitions. Word has length 156 [2019-12-07 17:31:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:44,191 INFO L462 AbstractCegarLoop]: Abstraction has 3788 states and 4739 transitions. [2019-12-07 17:31:44,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 4739 transitions. [2019-12-07 17:31:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 17:31:44,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:44,192 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:44,192 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 17:31:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1930765297, now seen corresponding path program 1 times [2019-12-07 17:31:44,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:44,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131154213] [2019-12-07 17:31:44,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:31:44,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131154213] [2019-12-07 17:31:44,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:44,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:31:44,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895904500] [2019-12-07 17:31:44,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:31:44,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:44,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:31:44,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:31:44,229 INFO L87 Difference]: Start difference. First operand 3788 states and 4739 transitions. Second operand 3 states. [2019-12-07 17:31:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:44,339 INFO L93 Difference]: Finished difference Result 4299 states and 5310 transitions. [2019-12-07 17:31:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:31:44,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-12-07 17:31:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:44,340 INFO L225 Difference]: With dead ends: 4299 [2019-12-07 17:31:44,340 INFO L226 Difference]: Without dead ends: 613 [2019-12-07 17:31:44,342 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 17:31:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-12-07 17:31:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2019-12-07 17:31:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-12-07 17:31:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 670 transitions. [2019-12-07 17:31:44,378 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 670 transitions. Word has length 157 [2019-12-07 17:31:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:44,379 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 670 transitions. [2019-12-07 17:31:44,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:31:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 670 transitions. [2019-12-07 17:31:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 17:31:44,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:44,380 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:44,380 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 17:31:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1961852785, now seen corresponding path program 1 times [2019-12-07 17:31:44,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:44,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457826194] [2019-12-07 17:31:44,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:31:44,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457826194] [2019-12-07 17:31:44,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:44,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:31:44,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250668466] [2019-12-07 17:31:44,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:31:44,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:31:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:31:44,481 INFO L87 Difference]: Start difference. First operand 610 states and 670 transitions. Second operand 5 states. [2019-12-07 17:31:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:44,625 INFO L93 Difference]: Finished difference Result 1255 states and 1370 transitions. [2019-12-07 17:31:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:31:44,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-12-07 17:31:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:44,626 INFO L225 Difference]: With dead ends: 1255 [2019-12-07 17:31:44,626 INFO L226 Difference]: Without dead ends: 931 [2019-12-07 17:31:44,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 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 17:31:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-07 17:31:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 610. [2019-12-07 17:31:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-12-07 17:31:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 666 transitions. [2019-12-07 17:31:44,670 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 666 transitions. Word has length 158 [2019-12-07 17:31:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:44,670 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 666 transitions. [2019-12-07 17:31:44,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:31:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 666 transitions. [2019-12-07 17:31:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:31:44,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:44,671 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:31:44,671 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 17:31:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1495401652, now seen corresponding path program 1 times [2019-12-07 17:31:44,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:44,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500527296] [2019-12-07 17:31:44,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:31:44,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500527296] [2019-12-07 17:31:44,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:44,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:31:44,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237185120] [2019-12-07 17:31:44,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:31:44,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:44,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:31:44,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:31:44,758 INFO L87 Difference]: Start difference. First operand 610 states and 666 transitions. Second operand 7 states. [2019-12-07 17:31:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:44,903 INFO L93 Difference]: Finished difference Result 1131 states and 1238 transitions. [2019-12-07 17:31:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:31:44,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-12-07 17:31:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:44,904 INFO L225 Difference]: With dead ends: 1131 [2019-12-07 17:31:44,904 INFO L226 Difference]: Without dead ends: 1129 [2019-12-07 17:31:44,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:31:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-07 17:31:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 608. [2019-12-07 17:31:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-07 17:31:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 663 transitions. [2019-12-07 17:31:44,937 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 663 transitions. Word has length 160 [2019-12-07 17:31:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:44,937 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 663 transitions. [2019-12-07 17:31:44,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:31:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 663 transitions. [2019-12-07 17:31:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 17:31:44,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:44,938 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:31:44,938 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 17:31:44,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash 887650061, now seen corresponding path program 1 times [2019-12-07 17:31:44,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:44,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227623290] [2019-12-07 17:31:44,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:31:44,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227623290] [2019-12-07 17:31:44,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:31:44,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:31:44,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417954734] [2019-12-07 17:31:44,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:31:44,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:44,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:31:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:31:44,976 INFO L87 Difference]: Start difference. First operand 608 states and 663 transitions. Second operand 5 states. [2019-12-07 17:31:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:45,049 INFO L93 Difference]: Finished difference Result 838 states and 911 transitions. [2019-12-07 17:31:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:31:45,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-12-07 17:31:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:45,050 INFO L225 Difference]: With dead ends: 838 [2019-12-07 17:31:45,050 INFO L226 Difference]: Without dead ends: 734 [2019-12-07 17:31:45,050 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 17:31:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-12-07 17:31:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 600. [2019-12-07 17:31:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-07 17:31:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 650 transitions. [2019-12-07 17:31:45,082 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 650 transitions. Word has length 161 [2019-12-07 17:31:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:45,082 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 650 transitions. [2019-12-07 17:31:45,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:31:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 650 transitions. [2019-12-07 17:31:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 17:31:45,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:31:45,083 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:31:45,083 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 17:31:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:31:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1388250693, now seen corresponding path program 1 times [2019-12-07 17:31:45,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:31:45,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204929421] [2019-12-07 17:31:45,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:31:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:31:45,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204929421] [2019-12-07 17:31:45,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872108508] [2019-12-07 17:31:45,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/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 17:31:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:31:45,480 INFO L264 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 17:31:45,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:31:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:31:45,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:31:45,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-12-07 17:31:45,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568907295] [2019-12-07 17:31:45,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 17:31:45,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:31:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 17:31:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:31:45,767 INFO L87 Difference]: Start difference. First operand 600 states and 650 transitions. Second operand 29 states. [2019-12-07 17:31:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:31:46,671 INFO L93 Difference]: Finished difference Result 959 states and 1046 transitions. [2019-12-07 17:31:46,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 17:31:46,671 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 220 [2019-12-07 17:31:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:31:46,672 INFO L225 Difference]: With dead ends: 959 [2019-12-07 17:31:46,672 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:31:46,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=459, Invalid=2511, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 17:31:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:31:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:31:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:31:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:31:46,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2019-12-07 17:31:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:31:46,674 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:31:46,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 17:31:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:31:46,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:31:46,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:31:46,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:31:46,996 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 136 [2019-12-07 17:31:47,182 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 165 [2019-12-07 17:31:47,824 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 276 [2019-12-07 17:31:48,438 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-12-07 17:31:49,027 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-12-07 17:31:50,338 WARN L192 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 769 DAG size of output: 374 [2019-12-07 17:31:50,818 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-12-07 17:31:52,471 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 976 DAG size of output: 477 [2019-12-07 17:31:52,810 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 193 [2019-12-07 17:31:53,005 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-12-07 17:31:53,108 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 120 [2019-12-07 17:31:53,218 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 179 [2019-12-07 17:31:53,385 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-12-07 17:31:53,706 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 206 [2019-12-07 17:31:54,467 WARN L192 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-12-07 17:31:54,575 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 167 [2019-12-07 17:31:54,846 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-12-07 17:31:55,015 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-12-07 17:31:56,348 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 902 DAG size of output: 439 [2019-12-07 17:31:56,611 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 163 [2019-12-07 17:31:56,813 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-12-07 17:31:57,457 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-12-07 17:31:57,980 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-12-07 17:31:58,648 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-12-07 17:31:58,866 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 62 [2019-12-07 17:31:59,063 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-12-07 17:31:59,297 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-12-07 17:32:00,790 WARN L192 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 265 DAG size of output: 89 [2019-12-07 17:32:01,013 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-12-07 17:32:01,231 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-12-07 17:32:02,744 WARN L192 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-12-07 17:32:03,090 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 45 [2019-12-07 17:32:05,412 WARN L192 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-12-07 17:32:06,027 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-12-07 17:32:06,975 WARN L192 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-12-07 17:32:07,082 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-12-07 17:32:07,210 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2019-12-07 17:32:07,445 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-12-07 17:32:07,716 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-12-07 17:32:07,915 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2019-12-07 17:32:10,948 WARN L192 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 358 DAG size of output: 107 [2019-12-07 17:32:13,996 WARN L192 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-12-07 17:32:14,172 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-12-07 17:32:14,896 WARN L192 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-12-07 17:32:15,142 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-07 17:32:15,334 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2019-12-07 17:32:15,848 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 60 [2019-12-07 17:32:15,969 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 17:32:16,252 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-12-07 17:32:19,741 WARN L192 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 462 DAG size of output: 104 [2019-12-07 17:32:19,945 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 60 [2019-12-07 17:32:20,297 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 61 [2019-12-07 17:32:20,405 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-12-07 17:32:20,636 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-12-07 17:32:21,606 WARN L192 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 77 [2019-12-07 17:32:23,014 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-12-07 17:32:23,596 WARN L192 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-12-07 17:32:24,430 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 49 [2019-12-07 17:32:25,634 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-12-07 17:32:25,936 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 48 [2019-12-07 17:32:26,574 WARN L192 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-12-07 17:32:28,431 WARN L192 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 196 DAG size of output: 76 [2019-12-07 17:32:28,691 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-12-07 17:32:29,900 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-12-07 17:32:30,048 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-12-07 17:32:30,403 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-12-07 17:32:30,670 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-12-07 17:32:33,342 WARN L192 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-12-07 17:32:34,676 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 166 DAG size of output: 70 [2019-12-07 17:32:34,921 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-12-07 17:32:35,199 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-12-07 17:32:36,070 WARN L192 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-12-07 17:32:36,607 WARN L192 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-12-07 17:32:36,857 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-12-07 17:32:37,396 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-12-07 17:32:39,370 WARN L192 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 423 DAG size of output: 106 [2019-12-07 17:32:39,901 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-12-07 17:32:40,323 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 53 [2019-12-07 17:32:40,837 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 70 [2019-12-07 17:32:40,981 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-07 17:32:41,823 WARN L192 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-12-07 17:32:41,939 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 50 [2019-12-07 17:32:42,110 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 58 [2019-12-07 17:32:42,389 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-12-07 17:32:45,018 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-12-07 17:32:45,244 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-12-07 17:32:45,453 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-07 17:32:47,238 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-12-07 17:32:47,852 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-12-07 17:32:48,335 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 54 [2019-12-07 17:32:48,341 INFO L242 CegarLoopResult]: At program point L894(lines 868 895) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse0 .cse1 (let ((.cse2 (<= ~c_req_a~0 0)) (.cse3 (<= 0 ~c_req_a~0)) (.cse4 (<= 1 ~c_req_type~0)) (.cse5 (= ~m_run_pc~0 3))) (or (and .cse2 .cse3 .cse4 (= 0 ~s_run_pc~0) .cse5 .cse6 .cse7) (and .cse2 .cse3 .cse4 (<= 2 ~s_run_pc~0) .cse5 .cse6 .cse7))) (<= ~c_req_type~0 1) .cse8 .cse9) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse1 (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse7 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse0 (= ~req_tt_a~0 0) .cse8 (= 2 ~s_run_pc~0) .cse6 .cse9))) [2019-12-07 17:32:48,341 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,341 INFO L246 CegarLoopResult]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-12-07 17:32:48,342 INFO L242 CegarLoopResult]: At program point L102(lines 91 833) the Hoare annotation is: (let ((.cse13 (= ~c_empty_req~0 1)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (<= ~c_req_type~0 1)) (.cse5 (<= ~c_req_d~0 50)) (.cse7 (<= 50 ~c_req_d~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse11 (= 2 ~s_run_pc~0)) (.cse15 (<= 2 ~s_run_pc~0)) (.cse6 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse14 (<= 2 ~s_run_st~0)) (.cse16 (= 0 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse12 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse7 .cse13 .cse9 .cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= 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) .cse11 .cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse13 .cse15 .cse3 .cse12 .cse4) (and .cse9 .cse14 .cse15 .cse3 .cse12 .cse4) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse14 (not .cse11) .cse15 .cse3 .cse12 .cse4) (and .cse6 .cse8 .cse0 .cse14 .cse16 .cse3 .cse12 .cse4))) [2019-12-07 17:32:48,342 INFO L242 CegarLoopResult]: At program point L168-2(lines 168 196) the Hoare annotation is: (let ((.cse11 (<= 2 ~s_run_st~0)) (.cse5 (<= 2 ~s_run_pc~0)) (.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse18 (= 0 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= 0 ~c_req_a~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse2 .cse3 .cse11 .cse18 .cse14 .cse16 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17) (and .cse11 (not (= 2 ~s_run_pc~0)) .cse5 .cse6 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-12-07 17:32:48,343 INFO L246 CegarLoopResult]: For program point L763(lines 763 767) no Hoare annotation was computed. [2019-12-07 17:32:48,343 INFO L246 CegarLoopResult]: For program point L697(lines 697 701) no Hoare annotation was computed. [2019-12-07 17:32:48,343 INFO L242 CegarLoopResult]: At program point L1292(lines 1285 1302) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse5 .cse10 .cse11 .cse3 .cse4) (and .cse12 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse15 .cse10 .cse11 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse5 .cse15 .cse6 .cse11 .cse4 .cse3) (and .cse7 .cse8 .cse16 .cse5 .cse10 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse13 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse12 .cse14 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse7 .cse8 .cse32 .cse12 .cse26 .cse6 .cse3 .cse28) (and .cse14 .cse12 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and .cse16 .cse14 .cse30 .cse10 .cse2 .cse4 .cse31 .cse7 .cse32 .cse8 .cse12 .cse26 .cse3 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse6 .cse3 .cse28) (and .cse16 .cse14 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse12 .cse5 .cse23 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29))) [2019-12-07 17:32:48,344 INFO L242 CegarLoopResult]: At program point L235(lines 228 254) the Hoare annotation is: (let ((.cse24 (= 2 ~s_run_pc~0))) (let ((.cse22 (<= ~m_run_pc~0 0)) (.cse11 (not .cse24)) (.cse23 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse5 (or (and .cse22 .cse11 .cse13 .cse12) (and .cse11 .cse23 .cse12 .cse13))) (.cse7 (= 0 ~s_run_pc~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (<= 1 ~c_req_type~0)) (.cse15 (<= 0 ~a_t~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= ~c_req_type~0 1)) (.cse17 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse18 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse19 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse20 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse4 .cse5 .cse16 .cse7 .cse17 .cse0 .cse18 .cse2 .cse19 .cse20 .cse8 .cse21 .cse9 .cse10) (and .cse14 .cse1 .cse3 .cse15 .cse4 .cse16 (or (and .cse22 .cse13 .cse12) (and .cse23 .cse12 .cse13)) .cse17 .cse0 .cse18 .cse2 .cse6 .cse19 .cse20 .cse8 .cse21 .cse24 .cse10 .cse9))))) [2019-12-07 17:32:48,344 INFO L246 CegarLoopResult]: For program point L169(lines 168 196) no Hoare annotation was computed. [2019-12-07 17:32:48,344 INFO L242 CegarLoopResult]: At program point L962(lines 955 972) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse1 .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse4 .cse0 (let ((.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3))) (or (and .cse8 .cse9 .cse3 .cse10 .cse11 (= 0 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2) (and .cse8 .cse9 .cse3 .cse10 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2))) (<= ~c_req_type~0 1) .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,344 INFO L246 CegarLoopResult]: For program point L1293(lines 1245 1334) no Hoare annotation was computed. [2019-12-07 17:32:48,344 INFO L246 CegarLoopResult]: For program point L1227(lines 1227 1231) no Hoare annotation was computed. [2019-12-07 17:32:48,344 INFO L246 CegarLoopResult]: For program point L170(lines 170 174) no Hoare annotation was computed. [2019-12-07 17:32:48,345 INFO L246 CegarLoopResult]: For program point L104(lines 104 116) no Hoare annotation was computed. [2019-12-07 17:32:48,345 INFO L246 CegarLoopResult]: For program point L963(lines 955 972) no Hoare annotation was computed. [2019-12-07 17:32:48,345 INFO L242 CegarLoopResult]: At program point L435(lines 428 445) 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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse0 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 17:32:48,345 INFO L246 CegarLoopResult]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-12-07 17:32:48,345 INFO L246 CegarLoopResult]: For program point L1294(lines 1294 1298) no Hoare annotation was computed. [2019-12-07 17:32:48,345 INFO L246 CegarLoopResult]: For program point L237(lines 237 241) no Hoare annotation was computed. [2019-12-07 17:32:48,345 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1166) no Hoare annotation was computed. [2019-12-07 17:32:48,346 INFO L242 CegarLoopResult]: At program point L105(lines 91 833) 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 17:32:48,346 INFO L246 CegarLoopResult]: For program point L1162-2(lines 1160 1339) no Hoare annotation was computed. [2019-12-07 17:32:48,346 INFO L242 CegarLoopResult]: At program point L1030(lines 1023 1076) the Hoare annotation is: (let ((.cse4 (<= 1 ~c_req_type~0)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (let ((.cse1 (not .cse3))) (or (and .cse0 (= 0 ~s_run_pc~0) .cse1 .cse2) (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse8 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse16 .cse3 .cse18) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3 .cse18 .cse19))) [2019-12-07 17:32:48,346 INFO L246 CegarLoopResult]: For program point L964(lines 964 968) no Hoare annotation was computed. [2019-12-07 17:32:48,346 INFO L246 CegarLoopResult]: For program point L436(lines 124 470) no Hoare annotation was computed. [2019-12-07 17:32:48,347 INFO L242 CegarLoopResult]: At program point L569(lines 562 606) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_st~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 (not .cse2) (<= 2 ~s_run_pc~0) .cse0 .cse3))) [2019-12-07 17:32:48,347 INFO L246 CegarLoopResult]: For program point L437(lines 437 441) no Hoare annotation was computed. [2019-12-07 17:32:48,347 INFO L246 CegarLoopResult]: For program point L107(lines 107 115) no Hoare annotation was computed. [2019-12-07 17:32:48,347 INFO L246 CegarLoopResult]: For program point L1032(lines 1032 1036) no Hoare annotation was computed. [2019-12-07 17:32:48,347 INFO L242 CegarLoopResult]: At program point L108(lines 91 833) 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 17:32:48,347 INFO L246 CegarLoopResult]: For program point L901(lines 901 954) no Hoare annotation was computed. [2019-12-07 17:32:48,347 INFO L242 CegarLoopResult]: At program point L769(lines 762 797) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= ~c_m_lock~0 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,348 INFO L242 CegarLoopResult]: At program point L703(lines 696 713) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,348 INFO L246 CegarLoopResult]: For program point L571(lines 571 575) no Hoare annotation was computed. [2019-12-07 17:32:48,348 INFO L249 CegarLoopResult]: At program point L1364(lines 1341 1366) the Hoare annotation is: true [2019-12-07 17:32:48,348 INFO L242 CegarLoopResult]: At program point L307(lines 277 308) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,348 INFO L246 CegarLoopResult]: For program point L902(lines 902 906) no Hoare annotation was computed. [2019-12-07 17:32:48,348 INFO L246 CegarLoopResult]: For program point L704(lines 475 827) no Hoare annotation was computed. [2019-12-07 17:32:48,349 INFO L242 CegarLoopResult]: At program point L1233(lines 1226 1243) 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 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 17:32:48,349 INFO L246 CegarLoopResult]: For program point L1167-1(lines 1160 1339) no Hoare annotation was computed. [2019-12-07 17:32:48,349 INFO L246 CegarLoopResult]: For program point L110(lines 110 114) no Hoare annotation was computed. [2019-12-07 17:32:48,349 INFO L246 CegarLoopResult]: For program point L771(lines 771 775) no Hoare annotation was computed. [2019-12-07 17:32:48,349 INFO L246 CegarLoopResult]: For program point L705(lines 705 709) no Hoare annotation was computed. [2019-12-07 17:32:48,349 INFO L242 CegarLoopResult]: At program point L375(lines 368 385) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,350 INFO L242 CegarLoopResult]: At program point L243(lines 236 253) the Hoare annotation is: (let ((.cse24 (= 2 ~s_run_pc~0))) (let ((.cse22 (<= ~m_run_pc~0 0)) (.cse11 (not .cse24)) (.cse23 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse5 (or (and .cse22 .cse11 .cse13 .cse12) (and .cse11 .cse23 .cse12 .cse13))) (.cse7 (= 0 ~s_run_pc~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (<= 1 ~c_req_type~0)) (.cse15 (<= 0 ~a_t~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= ~c_req_type~0 1)) (.cse17 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse18 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse19 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse20 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse4 .cse5 .cse16 .cse7 .cse17 .cse0 .cse18 .cse2 .cse19 .cse20 .cse8 .cse21 .cse9 .cse10) (and .cse14 .cse1 .cse3 .cse15 .cse4 .cse16 (or (and .cse22 .cse13 .cse12) (and .cse23 .cse12 .cse13)) .cse17 .cse0 .cse18 .cse2 .cse6 .cse19 .cse20 .cse8 .cse21 .cse24 .cse10 .cse9))))) [2019-12-07 17:32:48,350 INFO L242 CegarLoopResult]: At program point L111(lines 91 833) the Hoare annotation is: (let ((.cse0 (<= 0 ~a_t~0)) (.cse1 (= 0 ~c_req_type~0)) (.cse2 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse4 (= ~m_run_pc~0 6)) (.cse5 (= 0 ~c_req_a~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (= ~req_tt_a~0 0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse12 (<= 2 ~s_run_st~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse6 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse7 (= 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) .cse9 .cse10 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse11 .cse6 .cse0 .cse12 .cse9 .cse10 .cse3 .cse4) (and .cse0 .cse6 .cse12 .cse8 .cse9 .cse10 .cse3 .cse4) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 (= ~s_memory0~0 50) .cse2 .cse4 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse12 .cse7 (= 50 ~c_rsp_d~0) .cse8 .cse9 .cse10) (and .cse12 (not .cse9) (<= 2 ~s_run_pc~0) .cse10 (<= 3 ~m_run_pc~0) .cse3))) [2019-12-07 17:32:48,350 INFO L246 CegarLoopResult]: For program point L376(lines 368 385) no Hoare annotation was computed. [2019-12-07 17:32:48,350 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,350 INFO L246 CegarLoopResult]: For program point L244(lines 124 470) no Hoare annotation was computed. [2019-12-07 17:32:48,350 INFO L246 CegarLoopResult]: For program point L1235(lines 1235 1239) no Hoare annotation was computed. [2019-12-07 17:32:48,351 INFO L246 CegarLoopResult]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-12-07 17:32:48,351 INFO L246 CegarLoopResult]: For program point L245(lines 245 249) no Hoare annotation was computed. [2019-12-07 17:32:48,351 INFO L242 CegarLoopResult]: At program point L1038(lines 1031 1075) the Hoare annotation is: (let ((.cse4 (<= 1 ~c_req_type~0)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (let ((.cse1 (not .cse3))) (or (and .cse0 (= 0 ~s_run_pc~0) .cse1 .cse2) (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse8 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse16 .cse3 .cse18) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3 .cse18 .cse19))) [2019-12-07 17:32:48,351 INFO L242 CegarLoopResult]: At program point L577(lines 570 605) the Hoare annotation is: (let ((.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= 2 ~s_run_pc~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3) (and (<= 0 ~a_t~0) (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,351 INFO L246 CegarLoopResult]: For program point L1040(lines 1040 1044) no Hoare annotation was computed. [2019-12-07 17:32:48,352 INFO L242 CegarLoopResult]: At program point L908(lines 901 954) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse1 .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse4 .cse0 (let ((.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3))) (or (and .cse8 .cse9 .cse3 .cse10 .cse11 (= 0 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2) (and .cse8 .cse9 .cse3 .cse10 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2))) (<= ~c_req_type~0 1) .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,352 INFO L246 CegarLoopResult]: For program point L314(lines 314 367) no Hoare annotation was computed. [2019-12-07 17:32:48,352 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1177) no Hoare annotation was computed. [2019-12-07 17:32:48,352 INFO L246 CegarLoopResult]: For program point L975(lines 975 989) no Hoare annotation was computed. [2019-12-07 17:32:48,352 INFO L242 CegarLoopResult]: At program point L777(lines 770 796) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= ~c_m_lock~0 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,352 INFO L246 CegarLoopResult]: For program point L579(lines 579 583) no Hoare annotation was computed. [2019-12-07 17:32:48,353 INFO L246 CegarLoopResult]: For program point L315(lines 315 319) no Hoare annotation was computed. [2019-12-07 17:32:48,353 INFO L246 CegarLoopResult]: For program point L910(lines 910 914) no Hoare annotation was computed. [2019-12-07 17:32:48,353 INFO L242 CegarLoopResult]: At program point L514(lines 484 515) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (not .cse5)) (.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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-12-07 17:32:48,353 INFO L246 CegarLoopResult]: For program point L779(lines 779 783) no Hoare annotation was computed. [2019-12-07 17:32:48,353 INFO L246 CegarLoopResult]: For program point L1308(lines 1308 1312) no Hoare annotation was computed. [2019-12-07 17:32:48,353 INFO L246 CegarLoopResult]: For program point L1110(lines 1109 1150) no Hoare annotation was computed. [2019-12-07 17:32:48,353 INFO L246 CegarLoopResult]: For program point L451(lines 451 455) no Hoare annotation was computed. [2019-12-07 17:32:48,354 INFO L242 CegarLoopResult]: At program point L121(lines 91 833) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse8 (= 0 ~c_req_a~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse9 (<= 0 ~a_t~0)) (.cse5 (<= ~m_run_pc~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (= 0 ~c_req_type~0)) (.cse6 (= 0 ~s_run_pc~0)) (.cse7 (<= ~c_m_lock~0 0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3) (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse4 .cse5 .cse0 .cse6 .cse7 .cse2 .cse3) (and .cse8 .cse4 .cse5 .cse9 .cse10 .cse0 .cse11 .cse1 .cse7 .cse3 .cse2) (and .cse8 .cse4 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7 .cse3 .cse2))) [2019-12-07 17:32:48,354 INFO L242 CegarLoopResult]: At program point L1046(lines 1039 1074) the Hoare annotation is: (let ((.cse4 (<= 1 ~c_req_type~0)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (let ((.cse1 (not .cse3))) (or (and .cse0 (= 0 ~s_run_pc~0) .cse1 .cse2) (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse8 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse16 .cse3 .cse18) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3 .cse18 .cse19))) [2019-12-07 17:32:48,354 INFO L242 CegarLoopResult]: At program point L518-2(lines 518 546) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (not .cse5)) (.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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse3 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-12-07 17:32:48,355 INFO L242 CegarLoopResult]: At program point L1179(lines 1172 1225) 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 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 17:32:48,355 INFO L246 CegarLoopResult]: For program point L56(lines 56 59) no Hoare annotation was computed. [2019-12-07 17:32:48,355 INFO L246 CegarLoopResult]: For program point L981(lines 981 988) no Hoare annotation was computed. [2019-12-07 17:32:48,355 INFO L242 CegarLoopResult]: At program point L585(lines 578 604) the Hoare annotation is: (let ((.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= 2 ~s_run_pc~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3) (and (<= 0 ~a_t~0) (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,355 INFO L246 CegarLoopResult]: For program point L519(lines 518 546) no Hoare annotation was computed. [2019-12-07 17:32:48,355 INFO L246 CegarLoopResult]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-12-07 17:32:48,356 INFO L242 CegarLoopResult]: At program point L387-1(lines 387 393) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,356 INFO L242 CegarLoopResult]: At program point L321(lines 314 367) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,356 INFO L246 CegarLoopResult]: For program point L1246(line 1246) no Hoare annotation was computed. [2019-12-07 17:32:48,356 INFO L246 CegarLoopResult]: For program point L1114(lines 1114 1118) no Hoare annotation was computed. [2019-12-07 17:32:48,356 INFO L246 CegarLoopResult]: For program point L1114-1(lines 1109 1150) no Hoare annotation was computed. [2019-12-07 17:32:48,356 INFO L246 CegarLoopResult]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2019-12-07 17:32:48,357 INFO L242 CegarLoopResult]: At program point L916(lines 909 953) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse1 .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse4 .cse0 (let ((.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3))) (or (and .cse8 .cse9 .cse3 .cse10 .cse11 (= 0 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2) (and .cse8 .cse9 .cse3 .cse10 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2))) (<= ~c_req_type~0 1) .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,357 INFO L246 CegarLoopResult]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-12-07 17:32:48,357 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:32:48,357 INFO L246 CegarLoopResult]: For program point L1181(lines 1181 1185) no Hoare annotation was computed. [2019-12-07 17:32:48,357 INFO L242 CegarLoopResult]: At program point L124-2(lines 124 470) the Hoare annotation is: (let ((.cse16 (= 2 ~s_run_pc~0))) (let ((.cse12 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (not .cse16)) (.cse8 (<= 2 ~s_run_pc~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse0 (= 0 ~c_req_a~0)) (.cse1 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (<= ~m_run_pc~0 0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse7 (= 0 ~c_req_type~0)) (.cse15 (= 0 ~s_run_pc~0)) (.cse9 (<= ~c_m_lock~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse6 .cse13 .cse8 .cse11 .cse10 .cse14) (and (<= ~c_req_a~0 0) .cse12 (<= 0 ~c_req_a~0) .cse2 .cse4 .cse6 .cse15 .cse9 .cse11 .cse10 .cse14) (and .cse6 .cse13 .cse8 .cse9 .cse11 .cse10) (and (<= 1 ~c_req_type~0) .cse3 (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse10 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 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) .cse2 .cse5 .cse6 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse9 .cse16 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse9 .cse10 .cse11)))) [2019-12-07 17:32:48,357 INFO L246 CegarLoopResult]: For program point L851(lines 851 863) no Hoare annotation was computed. [2019-12-07 17:32:48,357 INFO L242 CegarLoopResult]: At program point L785(lines 778 795) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= ~c_m_lock~0 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,358 INFO L246 CegarLoopResult]: For program point L719(lines 719 723) no Hoare annotation was computed. [2019-12-07 17:32:48,358 INFO L246 CegarLoopResult]: For program point L587(lines 587 591) no Hoare annotation was computed. [2019-12-07 17:32:48,358 INFO L246 CegarLoopResult]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-12-07 17:32:48,358 INFO L242 CegarLoopResult]: At program point L1314(lines 1307 1324) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse5 .cse10 .cse11 .cse3 .cse4) (and .cse12 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse15 .cse10 .cse11 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse5 .cse15 .cse6 .cse11 .cse4 .cse3) (and .cse7 .cse8 .cse16 .cse5 .cse10 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse13 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse12 .cse14 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse7 .cse8 .cse32 .cse12 .cse26 .cse6 .cse3 .cse28) (and .cse14 .cse12 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and .cse16 .cse14 .cse30 .cse10 .cse2 .cse4 .cse31 .cse7 .cse32 .cse8 .cse12 .cse26 .cse3 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse6 .cse3 .cse28) (and .cse16 .cse14 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse12 .cse5 .cse23 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29))) [2019-12-07 17:32:48,358 INFO L246 CegarLoopResult]: For program point L125(lines 124 470) no Hoare annotation was computed. [2019-12-07 17:32:48,358 INFO L246 CegarLoopResult]: For program point L918(lines 918 922) no Hoare annotation was computed. [2019-12-07 17:32:48,358 INFO L246 CegarLoopResult]: For program point L786(lines 475 827) no Hoare annotation was computed. [2019-12-07 17:32:48,359 INFO L246 CegarLoopResult]: For program point L1315(lines 1245 1334) no Hoare annotation was computed. [2019-12-07 17:32:48,359 INFO L246 CegarLoopResult]: For program point L126(lines 126 130) no Hoare annotation was computed. [2019-12-07 17:32:48,359 INFO L246 CegarLoopResult]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-12-07 17:32:48,359 INFO L242 CegarLoopResult]: At program point L457(lines 450 467) 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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse0 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 17:32:48,359 INFO L246 CegarLoopResult]: For program point L1316(lines 1316 1320) no Hoare annotation was computed. [2019-12-07 17:32:48,359 INFO L246 CegarLoopResult]: For program point L259(lines 259 263) no Hoare annotation was computed. [2019-12-07 17:32:48,359 INFO L242 CegarLoopResult]: At program point L61(lines 52 62) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~i 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,359 INFO L246 CegarLoopResult]: For program point L854(lines 854 862) no Hoare annotation was computed. [2019-12-07 17:32:48,359 INFO L246 CegarLoopResult]: For program point L458(lines 450 467) no Hoare annotation was computed. [2019-12-07 17:32:48,360 INFO L242 CegarLoopResult]: At program point L855(lines 850 1101) the Hoare annotation is: false [2019-12-07 17:32:48,360 INFO L242 CegarLoopResult]: At program point L657(lines 627 658) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,360 INFO L246 CegarLoopResult]: For program point L459(lines 459 463) no Hoare annotation was computed. [2019-12-07 17:32:48,360 INFO L242 CegarLoopResult]: At program point L1120(lines 1109 1150) the Hoare annotation is: (let ((.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse12 (= 0 ~s_run_pc~0)) (.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= 0 ~c_req_a~0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse10 (<= ~m_run_pc~0 0)) (.cse9 (<= 0 ~a_t~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse11 (= 0 ~c_req_type~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse13 (<= ~c_m_lock~0 0)) (.cse33 (= ~m_run_st~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse8 .cse0 .cse9 .cse10 .cse7 .cse11 .cse12 .cse13 .cse4 .cse3) (and .cse14 .cse15 .cse16 .cse5 .cse12 .cse2 .cse3 .cse4) (and .cse9 .cse11 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse8 .cse7 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse7 .cse9 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse9 .cse30 .cse2 .cse4 .cse31 .cse14 .cse15 .cse32 .cse7 .cse26 .cse6 .cse3 .cse28) (and .cse9 .cse7 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse11 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse33 .cse6 .cse3 .cse28) (and .cse14 .cse15 .cse0 .cse10 .cse5 .cse12 .cse13 .cse33 .cse3 .cse4) (and .cse16 .cse9 .cse30 .cse12 .cse2 .cse4 .cse31 .cse14 .cse32 .cse15 .cse7 .cse26 .cse3 .cse28) (and .cse16 .cse9 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse7 .cse5 .cse23 .cse25 .cse26 .cse27 .cse33 .cse6 .cse3 .cse28 .cse29) (and .cse8 .cse0 .cse10 .cse9 .cse7 .cse5 .cse11 .cse1 .cse13 .cse33 .cse4 .cse3))) [2019-12-07 17:32:48,361 INFO L242 CegarLoopResult]: At program point L1054(lines 1047 1073) the Hoare annotation is: (let ((.cse4 (<= 1 ~c_req_type~0)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (let ((.cse1 (not .cse3))) (or (and .cse0 (= 0 ~s_run_pc~0) .cse1 .cse2) (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse8 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse16 .cse3 .cse18) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3 .cse18 .cse19))) [2019-12-07 17:32:48,361 INFO L246 CegarLoopResult]: For program point L1253(lines 1253 1306) no Hoare annotation was computed. [2019-12-07 17:32:48,361 INFO L242 CegarLoopResult]: At program point L1187(lines 1180 1224) 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 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 17:32:48,361 INFO L246 CegarLoopResult]: For program point L857(lines 857 861) no Hoare annotation was computed. [2019-12-07 17:32:48,361 INFO L242 CegarLoopResult]: At program point L725(lines 718 735) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,361 INFO L242 CegarLoopResult]: At program point L593(lines 586 603) the Hoare annotation is: (let ((.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= 2 ~s_run_pc~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3) (and (<= 0 ~a_t~0) (or (and (<= ~m_run_pc~0 0) .cse3 .cse2) (and (= ~m_run_pc~0 3) .cse2 .cse3)) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,362 INFO L242 CegarLoopResult]: At program point L329(lines 322 366) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,362 INFO L246 CegarLoopResult]: For program point L1254(lines 1254 1258) no Hoare annotation was computed. [2019-12-07 17:32:48,362 INFO L242 CegarLoopResult]: At program point L197(lines 167 198) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= 0 ~a_t~0)) (.cse4 (= 0 ~c_req_type~0)) (.cse17 (<= 2 ~s_run_pc~0)) (.cse7 (= 0 ~c_req_a~0)) (.cse8 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 2 ~s_run_st~0)) (.cse5 (= 0 ~s_run_pc~0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse14 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse15 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 (not (= 2 ~s_run_pc~0)) .cse17 .cse6 .cse14) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse3 .cse16 .cse5 .cse12 .cse14 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse15))) [2019-12-07 17:32:48,362 INFO L246 CegarLoopResult]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2019-12-07 17:32:48,362 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:32:48,362 INFO L242 CegarLoopResult]: At program point L924(lines 917 952) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse1 .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse4 .cse0 (let ((.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3))) (or (and .cse8 .cse9 .cse3 .cse10 .cse11 (= 0 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2) (and .cse8 .cse9 .cse3 .cse10 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2))) (<= ~c_req_type~0 1) .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,362 INFO L242 CegarLoopResult]: At program point L858(lines 850 1101) the Hoare annotation is: (let ((.cse0 (= ~m_run_pc~0 3)) (.cse3 (<= 0 ~a_t~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (= ~c_empty_req~0 1) (<= 2 ~s_run_pc~0) .cse0 .cse1 .cse2) (and (<= 1 ~c_req_type~0) .cse3 (<= ~c_req_type~0 1) .cse0 .cse2 (<= ~c_req_d~0 50) (<= ~c_req_a~0 0) (<= 50 ~c_req_d~0) (<= 0 ~c_req_a~0) .cse4 .cse5 .cse6 .cse1 .cse7) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse3 (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse4 (= ~req_tt_a~0 0) .cse5 .cse6 .cse1 .cse7))) [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L726(lines 718 735) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L594(lines 475 827) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L396(lines 396 449) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L1189(lines 1189 1193) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L66(lines 66 69) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L991-1(lines 866 1096) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L727(lines 727 731) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L595(lines 595 599) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L246 CegarLoopResult]: For program point L331(lines 331 335) no Hoare annotation was computed. [2019-12-07 17:32:48,363 INFO L242 CegarLoopResult]: At program point L265(lines 258 275) 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) .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 17:32:48,364 INFO L246 CegarLoopResult]: For program point L1124(lines 1124 1131) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L992(lines 991 1015) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L926(lines 926 930) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L266(lines 258 275) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L993(lines 993 997) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L267(lines 267 271) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L242 CegarLoopResult]: At program point L135-2(lines 135 163) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse6 (<= 0 ~a_t~0)) (.cse8 (= 0 ~c_req_type~0)) (.cse9 (= 0 ~c_req_a~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse15 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (<= ~m_run_pc~0 0)) (.cse5 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (= 0 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse16 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse3 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse2 .cse17) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse3 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse2 .cse17) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse5 .cse18 .cse3 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse10 .cse0 .cse14 .cse16 .cse2 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17))) [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L664(lines 664 717) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L136(lines 135 163) no Hoare annotation was computed. [2019-12-07 17:32:48,364 INFO L246 CegarLoopResult]: For program point L665(lines 665 669) no Hoare annotation was computed. [2019-12-07 17:32:48,365 INFO L242 CegarLoopResult]: At program point L1260(lines 1253 1306) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse5 .cse10 .cse11 .cse3 .cse4) (and .cse12 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse15 .cse10 .cse11 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse5 .cse15 .cse6 .cse11 .cse4 .cse3) (and .cse7 .cse8 .cse16 .cse5 .cse10 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse13 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse12 .cse14 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse7 .cse8 .cse32 .cse12 .cse26 .cse6 .cse3 .cse28) (and .cse14 .cse12 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and .cse16 .cse14 .cse30 .cse10 .cse2 .cse4 .cse31 .cse7 .cse32 .cse8 .cse12 .cse26 .cse3 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse6 .cse3 .cse28) (and .cse16 .cse14 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse12 .cse5 .cse23 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29))) [2019-12-07 17:32:48,365 INFO L246 CegarLoopResult]: For program point L137(lines 137 141) no Hoare annotation was computed. [2019-12-07 17:32:48,365 INFO L242 CegarLoopResult]: At program point L1062(lines 1055 1072) the Hoare annotation is: (let ((.cse4 (<= 1 ~c_req_type~0)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ~c_req_type~0 1)) (.cse7 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (<= ~c_req_d~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse19 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (let ((.cse1 (not .cse3))) (or (and .cse0 (= 0 ~s_run_pc~0) .cse1 .cse2) (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse5 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse8 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse16 .cse3 .cse18) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3 .cse18 .cse19))) [2019-12-07 17:32:48,365 INFO L246 CegarLoopResult]: For program point L204(lines 204 257) no Hoare annotation was computed. [2019-12-07 17:32:48,365 INFO L242 CegarLoopResult]: At program point L1195(lines 1188 1223) 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 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 17:32:48,365 INFO L246 CegarLoopResult]: For program point L1063(lines 866 1096) no Hoare annotation was computed. [2019-12-07 17:32:48,366 INFO L242 CegarLoopResult]: At program point L403(lines 396 449) 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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse0 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 17:32:48,366 INFO L242 CegarLoopResult]: At program point L337(lines 330 365) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,366 INFO L246 CegarLoopResult]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2019-12-07 17:32:48,366 INFO L246 CegarLoopResult]: For program point L1328-1(lines 1160 1339) no Hoare annotation was computed. [2019-12-07 17:32:48,366 INFO L246 CegarLoopResult]: For program point L1262(lines 1262 1266) no Hoare annotation was computed. [2019-12-07 17:32:48,366 INFO L246 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-12-07 17:32:48,366 INFO L246 CegarLoopResult]: For program point L1064(lines 1064 1068) no Hoare annotation was computed. [2019-12-07 17:32:48,366 INFO L242 CegarLoopResult]: At program point L932(lines 925 951) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse1 .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse4 .cse0 (let ((.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3))) (or (and .cse8 .cse9 .cse3 .cse10 .cse11 (= 0 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2) (and .cse8 .cse9 .cse3 .cse10 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2))) (<= ~c_req_type~0 1) .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,367 INFO L242 CegarLoopResult]: At program point L866-1(lines 850 1101) the Hoare annotation is: (let ((.cse6 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~s_run_pc~0)) (.cse10 (<= ~c_req_a~0 0)) (.cse11 (<= 0 ~c_req_a~0)) (.cse1 (= 0 ~c_req_type~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse12 (<= 1 ~c_req_type~0)) (.cse0 (<= 0 ~a_t~0)) (.cse17 (<= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse9 (<= ~c_req_d~0 50)) (.cse16 (<= 50 ~c_req_d~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse1 (= ~s_memory0~0 50) .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8) (and .cse9 (or (and .cse10 .cse11 .cse12 (not .cse6) .cse13 .cse14 .cse7 .cse15) (and .cse10 .cse11 .cse12 (= 0 ~s_run_pc~0) .cse14 .cse7 .cse15)) .cse16 .cse4 .cse0 .cse17 .cse5 .cse8) (and .cse3 .cse13 .cse14 .cse7 .cse15) (and .cse10 .cse11 .cse3 .cse4 .cse0 (<= ~m_run_pc~0 0) .cse1 (<= ~c_m_lock~0 0) .cse7 .cse15) (and .cse12 .cse0 .cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse2 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse16 .cse3 .cse4 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse5 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1201) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L801(lines 801 805) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L242 CegarLoopResult]: At program point L471(lines 123 472) the Hoare annotation is: (let ((.cse4 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse4 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 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) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse1 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L339(lines 339 343) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L934(lines 934 938) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,367 INFO L246 CegarLoopResult]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,368 INFO L246 CegarLoopResult]: For program point L869-1(lines 866 1096) no Hoare annotation was computed. [2019-12-07 17:32:48,368 INFO L246 CegarLoopResult]: For program point L737(lines 737 743) no Hoare annotation was computed. [2019-12-07 17:32:48,368 INFO L242 CegarLoopResult]: At program point L737-1(lines 737 743) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,368 INFO L242 CegarLoopResult]: At program point L671(lines 664 717) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,368 INFO L242 CegarLoopResult]: At program point L11-3(lines 1 1366) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~i 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,368 INFO L242 CegarLoopResult]: At program point L11-4(lines 64 72) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (= ~m_run_pc~0 3)) (.cse2 (= ULTIMATE.start_s_memory_write_~i 0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (<= 2 ~s_run_pc~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= 0 ~s_run_pc~0) .cse1 .cse2 .cse3 .cse4))) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,368 INFO L246 CegarLoopResult]: For program point L870(lines 869 893) no Hoare annotation was computed. [2019-12-07 17:32:48,368 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 17:32:48,369 INFO L242 CegarLoopResult]: At program point L1135(lines 1109 1150) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse10 (<= ~m_run_pc~0 0)) (.cse12 (<= ~c_m_lock~0 0)) (.cse11 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse18 (= ~m_run_pc~0 6)) (.cse23 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse25 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse19 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse20 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse21 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse22 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse24 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse26 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse27 (<= 1 ~c_m_lock~0)) (.cse28 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse8 .cse9 .cse0 .cse10 .cse5 .cse11 .cse12 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse10 .cse7 .cse15 .cse11 .cse12 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse10 .cse7 .cse5 .cse15 .cse6 .cse12 .cse4 .cse3) (and .cse8 .cse9 .cse16 .cse5 .cse11 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse14 .cse5 .cse6 .cse3 .cse4 .cse17 .cse18) (and .cse14 .cse15 .cse19 .cse20 .cse4 .cse21 .cse18 .cse22 .cse23 .cse13 .cse7 .cse24 .cse25 .cse26 .cse27 .cse28 .cse6 .cse3 .cse17 .cse29) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse8 .cse9 .cse32 .cse7 .cse27 .cse6 .cse3 .cse17) (and .cse14 .cse7 .cse5 .cse27 .cse6 .cse3 .cse4 .cse18 .cse17) (and .cse16 .cse14 .cse30 .cse11 .cse2 .cse4 .cse31 .cse8 .cse32 .cse9 .cse7 .cse27 .cse3 .cse17) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse20 .cse18 .cse23 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse5 .cse25 (= 50 ~c_rsp_d~0) .cse27 .cse6 .cse3 .cse17) (and .cse16 .cse14 .cse30 .cse19 .cse2 .cse20 .cse21 .cse22 .cse31 .cse32 .cse0 .cse7 .cse5 .cse24 .cse26 .cse27 .cse28 .cse6 .cse3 .cse17 .cse29))) [2019-12-07 17:32:48,369 INFO L246 CegarLoopResult]: For program point L871(lines 871 875) no Hoare annotation was computed. [2019-12-07 17:32:48,369 INFO L246 CegarLoopResult]: For program point L673(lines 673 677) no Hoare annotation was computed. [2019-12-07 17:32:48,369 INFO L242 CegarLoopResult]: At program point L475-2(lines 475 827) the Hoare annotation is: (let ((.cse11 (= 2 ~s_run_pc~0))) (let ((.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 0 ~a_t~0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (not .cse11)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 1 ~c_req_type~0) .cse7 (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse9 .cse10 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse0 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 .cse11 .cse4 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse7 .cse10 .cse0 .cse8 .cse11 .cse3 .cse4 .cse5 .cse12) (and .cse9 .cse10 .cse7 .cse0 .cse3 .cse11 .cse4 .cse5 .cse12 (= ~m_run_pc~0 6)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0) .cse5)))) [2019-12-07 17:32:48,369 INFO L242 CegarLoopResult]: At program point L1268(lines 1261 1305) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse5 .cse10 .cse11 .cse3 .cse4) (and .cse12 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse15 .cse10 .cse11 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse5 .cse15 .cse6 .cse11 .cse4 .cse3) (and .cse7 .cse8 .cse16 .cse5 .cse10 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse13 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse12 .cse14 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse7 .cse8 .cse32 .cse12 .cse26 .cse6 .cse3 .cse28) (and .cse14 .cse12 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and .cse16 .cse14 .cse30 .cse10 .cse2 .cse4 .cse31 .cse7 .cse32 .cse8 .cse12 .cse26 .cse3 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse6 .cse3 .cse28) (and .cse16 .cse14 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse12 .cse5 .cse23 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29))) [2019-12-07 17:32:48,369 INFO L242 CegarLoopResult]: At program point L211(lines 204 257) the Hoare annotation is: (let ((.cse3 (= 0 ~s_run_pc~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (<= 1 ~c_req_type~0)) (.cse13 (<= 0 ~a_t~0)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse14 (<= ~c_req_type~0 1)) (.cse11 (<= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse5 (<= ~c_req_a~0 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse6 (<= 0 ~c_req_a~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~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 .cse7 (not (= 2 ~s_run_pc~0)) .cse11 .cse4 .cse9) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse11 .cse4 .cse15 .cse5 .cse16 .cse6 .cse17 .cse7 .cse18 .cse19 .cse8 .cse20 .cse9 .cse10))) [2019-12-07 17:32:48,370 INFO L246 CegarLoopResult]: For program point L476(lines 475 827) no Hoare annotation was computed. [2019-12-07 17:32:48,370 INFO L249 CegarLoopResult]: At program point L1335(lines 1157 1340) the Hoare annotation is: true [2019-12-07 17:32:48,370 INFO L242 CegarLoopResult]: At program point L278-2(lines 278 306) the Hoare annotation is: (let ((.cse18 (= 2 ~s_run_pc~0))) (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse12 (<= ~c_req_a~0 0)) (.cse14 (<= 0 ~c_req_a~0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse6 (not .cse18)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= 1 ~c_req_type~0)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= ~c_req_type~0 1)) (.cse2 (= ~m_run_pc~0 3)) (.cse11 (<= ~c_req_d~0 50)) (.cse13 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse6 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17) (and .cse7 .cse8 .cse9 .cse4 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse3 .cse17) (and .cse15 .cse5 .cse18 .cse4 .cse3) (and .cse12 .cse14 .cse7 .cse5 .cse10 .cse6 .cse3 .cse4) (and .cse7 .cse8 .cse9 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse2 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 .cse13 .cse0 .cse15 .cse5 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= 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) .cse18 .cse3 .cse17 (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-12-07 17:32:48,370 INFO L242 CegarLoopResult]: At program point L1203(lines 1196 1222) 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 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 17:32:48,370 INFO L242 CegarLoopResult]: At program point L807(lines 800 817) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= ~c_m_lock~0 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,370 INFO L246 CegarLoopResult]: For program point L609(lines 609 613) no Hoare annotation was computed. [2019-12-07 17:32:48,370 INFO L246 CegarLoopResult]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-12-07 17:32:48,370 INFO L242 CegarLoopResult]: At program point L411(lines 404 448) 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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse0 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 17:32:48,371 INFO L242 CegarLoopResult]: At program point L345(lines 338 364) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L279(lines 278 306) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L1270(lines 1270 1274) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L213(lines 213 217) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L242 CegarLoopResult]: At program point L940(lines 933 950) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse1 .cse2 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse3 .cse4 (= ~req_tt_a~0 0) .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse4 .cse0 (let ((.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse11 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse12 (= ~m_run_pc~0 3))) (or (and .cse8 .cse9 .cse3 .cse10 .cse11 (= 0 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2) (and .cse8 .cse9 .cse3 .cse10 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse1 .cse6 .cse2))) (<= ~c_req_type~0 1) .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L808(lines 800 817) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L1205(lines 1205 1209) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L941(lines 866 1096) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L809(lines 809 813) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L347(lines 347 351) no Hoare annotation was computed. [2019-12-07 17:32:48,371 INFO L246 CegarLoopResult]: For program point L942(lines 942 946) no Hoare annotation was computed. [2019-12-07 17:32:48,372 INFO L242 CegarLoopResult]: At program point L679(lines 672 716) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,372 INFO L242 CegarLoopResult]: At program point L547(lines 517 548) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (not .cse5)) (.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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-12-07 17:32:48,372 INFO L246 CegarLoopResult]: For program point L746(lines 746 799) no Hoare annotation was computed. [2019-12-07 17:32:48,372 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:32:48,372 INFO L246 CegarLoopResult]: For program point L747(lines 747 751) no Hoare annotation was computed. [2019-12-07 17:32:48,372 INFO L246 CegarLoopResult]: For program point L681(lines 681 685) no Hoare annotation was computed. [2019-12-07 17:32:48,372 INFO L242 CegarLoopResult]: At program point L615(lines 608 625) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0))) (or (and .cse0 (not .cse1) (<= 2 ~s_run_pc~0) .cse2 .cse3) (and (<= 0 ~a_t~0) .cse0 (<= 1 ~c_m_lock~0) .cse1 .cse3 .cse2 (<= 0 ULTIMATE.start_m_run_~a~0)))) [2019-12-07 17:32:48,372 INFO L242 CegarLoopResult]: At program point L1276(lines 1269 1304) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse5 .cse10 .cse11 .cse3 .cse4) (and .cse12 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse15 .cse10 .cse11 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse5 .cse15 .cse6 .cse11 .cse4 .cse3) (and .cse7 .cse8 .cse16 .cse5 .cse10 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse13 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse12 .cse14 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse7 .cse8 .cse32 .cse12 .cse26 .cse6 .cse3 .cse28) (and .cse14 .cse12 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and .cse16 .cse14 .cse30 .cse10 .cse2 .cse4 .cse31 .cse7 .cse32 .cse8 .cse12 .cse26 .cse3 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse6 .cse3 .cse28) (and .cse16 .cse14 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse12 .cse5 .cse23 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29))) [2019-12-07 17:32:48,372 INFO L242 CegarLoopResult]: At program point L219(lines 212 256) the Hoare annotation is: (let ((.cse3 (= 0 ~s_run_pc~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (<= 1 ~c_req_type~0)) (.cse13 (<= 0 ~a_t~0)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse14 (<= ~c_req_type~0 1)) (.cse11 (<= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse5 (<= ~c_req_a~0 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse6 (<= 0 ~c_req_a~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~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 .cse7 (not (= 2 ~s_run_pc~0)) .cse11 .cse4 .cse9) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse11 .cse4 .cse15 .cse5 .cse16 .cse6 .cse17 .cse7 .cse18 .cse19 .cse8 .cse20 .cse9 .cse10))) [2019-12-07 17:32:48,372 INFO L246 CegarLoopResult]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L616(lines 608 625) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L242 CegarLoopResult]: At program point L1211(lines 1204 1221) 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 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and (= 0 ~c_req_a~0) .cse0 .cse1 (<= 0 ~a_t~0) (<= 2 ~c_write_req_ev~0) (= 0 ~c_req_type~0) .cse2 .cse3 .cse5 .cse4))) [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L617(lines 617 621) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L242 CegarLoopResult]: At program point L419(lines 412 447) 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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse0 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 17:32:48,373 INFO L242 CegarLoopResult]: At program point L485-2(lines 485 513) the Hoare annotation is: (let ((.cse6 (= 2 ~s_run_pc~0))) (let ((.cse3 (<= ~c_m_lock~0 0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (not .cse6)) (.cse2 (<= 2 ~s_run_pc~0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse5 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 .cse6 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 .cse1 .cse2 .cse4 (<= 3 ~m_run_pc~0) .cse5)))) [2019-12-07 17:32:48,373 INFO L242 CegarLoopResult]: At program point L353(lines 346 363) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L1278(lines 1278 1282) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L221(lines 221 225) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L1212(lines 1160 1339) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L486(lines 485 513) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L354(lines 124 470) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L1213(lines 1213 1217) no Hoare annotation was computed. [2019-12-07 17:32:48,373 INFO L246 CegarLoopResult]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-12-07 17:32:48,374 INFO L246 CegarLoopResult]: For program point L421(lines 421 425) no Hoare annotation was computed. [2019-12-07 17:32:48,374 INFO L246 CegarLoopResult]: For program point L355(lines 355 359) no Hoare annotation was computed. [2019-12-07 17:32:48,374 INFO L242 CegarLoopResult]: At program point L1016(lines 990 1017) the Hoare annotation is: (let ((.cse6 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse18 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (= 2 ~s_run_pc~0)) (.cse0 (<= 1 ~c_req_type~0)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (<= ~c_req_type~0 1)) (.cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse7 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse14 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse1 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse5 .cse6 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse11 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 (= ~req_tt_a~0 0) .cse15 .cse17 .cse18 .cse19) (and (let ((.cse21 (not .cse17))) (or (and .cse11 .cse21 (= 0 ~s_run_pc~0) .cse4 .cse18) (and .cse11 .cse21 (<= 2 ~s_run_pc~0) .cse4 .cse18))) .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20))) [2019-12-07 17:32:48,374 INFO L246 CegarLoopResult]: For program point L554(lines 554 607) no Hoare annotation was computed. [2019-12-07 17:32:48,374 INFO L246 CegarLoopResult]: For program point L92(lines 92 120) no Hoare annotation was computed. [2019-12-07 17:32:48,374 INFO L246 CegarLoopResult]: For program point L819(lines 819 825) no Hoare annotation was computed. [2019-12-07 17:32:48,374 INFO L242 CegarLoopResult]: At program point L819-1(lines 819 825) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 (= ~m_run_pc~0 3) .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ~c_empty_req~0 1) .cse1 .cse0 .cse2 .cse4 .cse3 .cse5 .cse6 (= ~m_run_pc~0 6) .cse7) (and .cse2 (not .cse3) (<= 2 ~s_run_pc~0) .cse4 .cse5 (<= 3 ~m_run_pc~0) .cse6))) [2019-12-07 17:32:48,374 INFO L242 CegarLoopResult]: At program point L753(lines 746 799) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= ~c_m_lock~0 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,374 INFO L242 CegarLoopResult]: At program point L687(lines 680 715) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,374 INFO L246 CegarLoopResult]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-12-07 17:32:48,374 INFO L242 CegarLoopResult]: At program point L1084(lines 1077 1094) the Hoare annotation is: (let ((.cse0 (<= 0 ~a_t~0)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse0 (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) .cse1 (= ~m_run_pc~0 6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse2 .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse4 (= 2 ~s_run_pc~0) .cse5) (and (<= 1 ~c_req_type~0) .cse0 (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_type~1 1) (let ((.cse6 (= ~m_run_pc~0 3))) (or (and .cse2 (<= 2 ~s_run_pc~0) .cse6) (and .cse2 (= 0 ~s_run_pc~0) .cse6))) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse3 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse4 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-12-07 17:32:48,375 INFO L242 CegarLoopResult]: At program point L1151(lines 1103 1156) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse5 .cse10 .cse11 .cse3 .cse4) (and .cse12 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse15 .cse10 .cse11 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse5 .cse15 .cse6 .cse11 .cse4 .cse3) (and .cse7 .cse8 .cse16 .cse5 .cse10 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse13 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse12 .cse14 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse7 .cse8 .cse32 .cse12 .cse26 .cse6 .cse3 .cse28) (and .cse14 .cse12 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and .cse16 .cse14 .cse30 .cse10 .cse2 .cse4 .cse31 .cse7 .cse32 .cse8 .cse12 .cse26 .cse3 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse6 .cse3 .cse28) (and .cse16 .cse14 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse12 .cse5 .cse23 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29))) [2019-12-07 17:32:48,375 INFO L246 CegarLoopResult]: For program point L1085(lines 1077 1094) no Hoare annotation was computed. [2019-12-07 17:32:48,375 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:32:48,375 INFO L246 CegarLoopResult]: For program point L755(lines 755 759) no Hoare annotation was computed. [2019-12-07 17:32:48,375 INFO L246 CegarLoopResult]: For program point L689(lines 689 693) no Hoare annotation was computed. [2019-12-07 17:32:48,375 INFO L242 CegarLoopResult]: At program point L1284(lines 1277 1303) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse9 (<= ~m_run_pc~0 0)) (.cse11 (<= ~c_m_lock~0 0)) (.cse10 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse15 (= 0 ~c_req_type~0)) (.cse20 (= ~m_run_pc~0 6)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse24 (= ~req_tt_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse14 (<= 0 ~a_t~0)) (.cse30 (<= ~c_req_type~0 1)) (.cse17 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= ~m_run_pc~0 3)) (.cse18 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ~c_req_d~0 50)) (.cse32 (<= 50 ~c_req_d~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse5 (<= 2 ~s_run_st~0)) (.cse23 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse25 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse26 (<= 1 ~c_m_lock~0)) (.cse27 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse6 (= 2 ~s_run_pc~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse28 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (not .cse6) .cse1 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse5 .cse10 .cse11 .cse3 .cse4) (and .cse12 .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse15 .cse10 .cse11 .cse4 .cse3) (and .cse13 .cse0 .cse14 .cse9 .cse12 .cse5 .cse15 .cse6 .cse11 .cse4 .cse3) (and .cse7 .cse8 .cse16 .cse5 .cse10 .cse2 .cse3 .cse4) (and .cse14 .cse15 .cse17 .cse18 .cse4 .cse19 .cse20 .cse21 .cse22 .cse13 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29) (and .cse0 .cse12 .cse14 .cse5 .cse6 .cse3 .cse4 .cse28 .cse20) (and .cse16 .cse14 .cse30 .cse2 .cse4 .cse31 .cse7 .cse8 .cse32 .cse12 .cse26 .cse6 .cse3 .cse28) (and .cse14 .cse12 .cse5 .cse26 .cse6 .cse3 .cse4 .cse20 .cse28) (and .cse16 .cse14 .cse30 .cse10 .cse2 .cse4 .cse31 .cse7 .cse32 .cse8 .cse12 .cse26 .cse3 .cse28) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) .cse15 (= ~s_memory0~0 50) .cse18 .cse20 .cse22 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse13 .cse0 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse5 .cse24 (= 50 ~c_rsp_d~0) .cse26 .cse6 .cse3 .cse28) (and .cse16 .cse14 .cse30 .cse17 .cse2 .cse18 .cse19 .cse21 .cse31 .cse32 .cse0 .cse12 .cse5 .cse23 .cse25 .cse26 .cse27 .cse6 .cse3 .cse28 .cse29))) [2019-12-07 17:32:48,375 INFO L242 CegarLoopResult]: At program point L227(lines 220 255) the Hoare annotation is: (let ((.cse24 (= 2 ~s_run_pc~0))) (let ((.cse22 (<= ~m_run_pc~0 0)) (.cse11 (not .cse24)) (.cse23 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse5 (or (and .cse22 .cse11 .cse13 .cse12) (and .cse11 .cse23 .cse12 .cse13))) (.cse7 (= 0 ~s_run_pc~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (<= 1 ~c_req_type~0)) (.cse15 (<= 0 ~a_t~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= ~c_req_type~0 1)) (.cse17 (<= ~c_req_d~0 50)) (.cse0 (<= ~c_req_a~0 0)) (.cse18 (<= 50 ~c_req_d~0)) (.cse2 (<= 0 ~c_req_a~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse19 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse20 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse21 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse9 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse11 (<= 2 ~s_run_pc~0) .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse4 .cse5 .cse16 .cse7 .cse17 .cse0 .cse18 .cse2 .cse19 .cse20 .cse8 .cse21 .cse9 .cse10) (and .cse14 .cse1 .cse3 .cse15 .cse4 .cse16 (or (and .cse22 .cse13 .cse12) (and .cse23 .cse12 .cse13)) .cse17 .cse0 .cse18 .cse2 .cse6 .cse19 .cse20 .cse8 .cse21 .cse24 .cse10 .cse9))))) [2019-12-07 17:32:48,375 INFO L246 CegarLoopResult]: For program point L95(lines 95 119) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1090) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L242 CegarLoopResult]: At program point L96(lines 91 833) 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 17:32:48,376 INFO L242 CegarLoopResult]: At program point L427(lines 420 446) 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 (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) .cse0 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 (not .cse3) (<= 2 ~s_run_pc~0) .cse2 .cse4 .cse0))) [2019-12-07 17:32:48,376 INFO L246 CegarLoopResult]: For program point L1286(lines 1286 1290) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L246 CegarLoopResult]: For program point L229(lines 229 233) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L246 CegarLoopResult]: For program point L956(lines 956 960) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L242 CegarLoopResult]: At program point L164(lines 134 165) the Hoare annotation is: (let ((.cse5 (<= 2 ~s_run_pc~0)) (.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= 0 ~a_t~0)) (.cse4 (= 0 ~c_req_type~0)) (.cse7 (= 0 ~c_req_a~0)) (.cse8 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse11 (<= 2 ~s_run_st~0)) (.cse17 (= 0 ~s_run_pc~0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse11 (not (= 2 ~s_run_pc~0)) .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse13 .cse15 .cse16) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse2 .cse3 .cse11 .cse17 .cse14 .cse15 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16))) [2019-12-07 17:32:48,376 INFO L246 CegarLoopResult]: For program point L98(lines 98 118) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L246 CegarLoopResult]: For program point L1023(lines 1023 1076) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L242 CegarLoopResult]: At program point L561(lines 554 607) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0))) (let ((.cse1 (<= 2 ~s_run_st~0)) (.cse4 (not .cse2)) (.cse5 (<= 2 ~s_run_pc~0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ~m_run_pc~0 3) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse1 .cse4 .cse5 .cse0 .cse3 (<= 3 ~m_run_pc~0)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse1 .cse4 .cse5 .cse0 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0))))) [2019-12-07 17:32:48,376 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-12-07 17:32:48,376 INFO L242 CegarLoopResult]: At program point L99(lines 91 833) 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 17:32:48,377 INFO L246 CegarLoopResult]: For program point L1024(lines 1024 1028) no Hoare annotation was computed. [2019-12-07 17:32:48,377 INFO L242 CegarLoopResult]: At program point L628-2(lines 628 656) the Hoare annotation is: (let ((.cse1 (= 0 ~c_req_type~0)) (.cse15 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse5 (= 0 ~c_req_a~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse9 (= ~req_tt_a~0 0)) (.cse19 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse20 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse21 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_empty_req~0 1)) (.cse3 (= ~m_run_pc~0 6)) (.cse0 (<= 0 ~a_t~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 2 ~s_run_st~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse11 (= 2 ~s_run_pc~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_write_rsp_ev~0)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse1 (= ~s_memory0~0 50) .cse2 .cse3 .cse4 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 .cse9 (= 50 ~c_rsp_d~0) .cse10 .cse11 .cse12 .cse13) (and .cse8 (not .cse11) (<= 2 ~s_run_pc~0) .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse14 .cse17 .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse18 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse21) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse14 .cse17 .cse4 .cse5 .cse7 .cse18 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse21) (and .cse6 .cse7 .cse0 .cse8 .cse11 .cse12 .cse14 .cse3 .cse13) (and .cse0 .cse7 .cse8 .cse10 .cse11 .cse14 .cse12 .cse13))) [2019-12-07 17:32:48,377 INFO L242 CegarLoopResult]: At program point L761(lines 754 798) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= ~c_m_lock~0 0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,377 INFO L242 CegarLoopResult]: At program point L695(lines 688 714) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= ~m_run_pc~0 6) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-12-07 17:32:48,377 INFO L246 CegarLoopResult]: For program point L629(lines 628 656) no Hoare annotation was computed. [2019-12-07 17:32:48,377 INFO L246 CegarLoopResult]: For program point L563(lines 563 567) no Hoare annotation was computed. [2019-12-07 17:32:48,377 INFO L246 CegarLoopResult]: For program point L101(lines 101 117) no Hoare annotation was computed. [2019-12-07 17:32:48,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:32:48 BoogieIcfgContainer [2019-12-07 17:32:48,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:32:48,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:32:48,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:32:48,535 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:32:48,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:31:34" (3/4) ... [2019-12-07 17:32:48,538 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:32:48,555 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 17:32:48,556 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 17:32:48,577 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && 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) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,577 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,577 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 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) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || ((((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((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)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((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) && 2 <= s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) [2019-12-07 17:32:48,577 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,578 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,578 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,578 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,578 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,578 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) [2019-12-07 17:32:48,579 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((c_req_d <= 50 && ((((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && c_req_type <= 1) && 1 <= c_m_lock) && 0 <= a)) || ((((c_empty_req == 1 && 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) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,579 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) || ((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) || (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) [2019-12-07 17:32:48,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,580 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,581 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) || ((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) || ((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3))) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,581 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,581 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) [2019-12-07 17:32:48,581 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 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)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((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) [2019-12-07 17:32:48,581 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,582 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && i == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,582 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,583 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a [2019-12-07 17:32:48,648 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d86de3ad-8733-4d62-bbbf-47c5322013b5/bin/uautomizer/witness.graphml [2019-12-07 17:32:48,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:32:48,648 INFO L168 Benchmark]: Toolchain (without parser) took 74825.63 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 942.4 MB in the beginning and 1.5 GB in the end (delta: -534.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,649 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:32:48,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:32:48,649 INFO L168 Benchmark]: Boogie Preprocessor took 34.86 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 17:32:48,649 INFO L168 Benchmark]: RCFGBuilder took 564.25 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: 82.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,650 INFO L168 Benchmark]: TraceAbstraction took 73762.57 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -488.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,650 INFO L168 Benchmark]: Witness Printer took 112.53 ms. Allocated memory is still 2.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,651 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.86 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 564.25 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: 82.8 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73762.57 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -488.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 112.53 ms. Allocated memory is still 2.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 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: 925]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && ((((((((((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) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: ((((((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) || (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a)) || (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= a) && 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: 167]: Loop Invariant Derived loop invariant: (((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 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 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 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) - InvariantResult [Line: 212]: 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) || ((((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) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 387]: 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) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 2 <= s_run_pc) && m_run_pc == 3) && 0 == req_a) && req_type <= 1) && 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) && 1 <= req_type) && i == req_a) && v == req_d) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((c_req_d <= 50 && ((((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && !(2 == s_run_pc)) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && c_req_type <= 1) && 1 <= c_m_lock) && 0 <= a)) || ((((c_empty_req == 1 && 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) && c_empty_req == 1) && 2 <= c_write_req_ev) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 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 - InvariantResult [Line: 570]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && (((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) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && req_d <= 50) - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 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 - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && (((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) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && req_d <= 50) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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 - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && m_run_pc == 3) && 2 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) || (((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || ((((((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: 1269]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((req_d <= 50 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 50 <= req_d) && 1 <= req_type) && 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 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((a <= 0 && c_empty_req == 1) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a) - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1277]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 955]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && ((((((((((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) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 933]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && ((((((((((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) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((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: 608]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((0 <= a_t && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 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 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && (((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) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && req_d <= 50) - InvariantResult [Line: 220]: 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)) || (((((((((((((((((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) && 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 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) && 0 <= a) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) || (((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 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 - InvariantResult [Line: 1307]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 1285]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 762]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 236]: 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)) || (((((((((((((((((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) && 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 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) && 0 <= a) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 258]: 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) && 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: 696]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 770]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 228]: 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)) || (((((((((((((((((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) && 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 && a <= 0) && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && c_req_type <= 1) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((m_run_pc == 3 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 == s_run_pc) && 0 <= req_a) && 0 <= a) - InvariantResult [Line: 1172]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((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: 1109]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && 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) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 518]: 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) || (((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((((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: 1180]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((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: 485]: Loop Invariant Derived loop invariant: ((((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) || (((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && c_empty_rsp == 1) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 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 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 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 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && i == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 91]: 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: 628]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 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)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((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) - InvariantResult [Line: 91]: 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: 800]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((((0 == c_req_a && a == 0) && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && 2 <= s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((a <= 0 && 2 <= s_run_st) && !(2 == s_run_pc)) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || ((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((((((((0 == c_req_a && a == 0) && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 135]: 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 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 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) && 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)) || (((((((((((((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: 1031]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) || (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((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)) || ((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev)) || (((((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)) || (((((((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) - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) || ((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) || ((((((((((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)) || ((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 123]: 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) || (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && ((((((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) && i == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3) && i == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && v == req_d) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 1188]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && i == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((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: 1103]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 278]: 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) || ((((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 && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && !(2 == s_run_pc)) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 == s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && !(2 == s_run_pc)) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((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: 1196]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 428]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && c_m_lock <= 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) || (((((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: 1157]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1226]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1204]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 91]: 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: 91]: 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) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((((0 == c_req_a && c_empty_req == 1) && m_run_pc <= 0) && 0 <= a_t) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 0 == c_req_type) && 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) && 0 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && ((((((((((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) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 1109]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 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) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || ((((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((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)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && m_run_st == 0) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || (((((((((((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) && 2 <= s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 909]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && ((((((((((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) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: (((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && c_req_type <= 1) && 1 <= c_m_lock) && 0 <= a) || ((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - InvariantResult [Line: 91]: 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: 1077]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a) || ((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && (((c_empty_req == 1 && 2 <= s_run_pc) && m_run_pc == 3) || ((c_empty_req == 1 && 0 == s_run_pc) && m_run_pc == 3))) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= a_t && 0 == c_req_type) && req_type___0 == 0) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) || (((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc)) || ((((((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: 1055]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && 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) && 0 <= a) && req_d <= 50) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && 2 == s_run_pc) && 0 <= a)) || ((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && 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) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= a_t && 0 == c_req_type) && req_type___0 == 0) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50) || ((((2 <= s_run_st && !(2 == s_run_pc)) && 2 <= s_run_pc) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 517]: 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) || ((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((((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: 484]: 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) || ((((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && req_d <= 50)) || ((((((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: 1253]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 204]: 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) || ((((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) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: (((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1261]: 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) || ((((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)) || (((((((((0 == c_req_a && c_empty_req == 1) && 0 <= a_t) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 0 == c_req_type) && 0 == 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) && 2 <= s_run_st) && 0 == c_req_type) && 2 == s_run_pc) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev)) || (((((((c_req_a <= 0 && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_st) && 0 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((((((0 <= a_t && 0 == c_req_type) && s_memory0 == req_d) && 0 == req_a) && c_empty_rsp == 1) && req_type <= 1) && m_run_pc == 6) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50)) || ((((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && m_run_pc == 6)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 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)) || ((((((((0 <= a_t && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 0 <= a)) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 <= c_write_rsp_ev) && 0 <= a)) || (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && m_run_pc == 3) && 0 == req_a) && req_type <= 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) && 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) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && m_run_pc == 6) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && ((((((((((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) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: ((((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 0 == req_a) && m_run_pc == 6) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && 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) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 850]: 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) || (((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && m_run_pc == 3) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && c_empty_rsp == 1) && m_run_pc == 6) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && 2 == s_run_pc) && 2 <= c_write_rsp_ev) && 0 <= a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 5 error locations. Result: SAFE, OverallTime: 12.0s, OverallIterations: 24, TraceHistogramMax: 4, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 61.4s, HoareTripleCheckerStatistics: 12911 SDtfs, 15564 SDslu, 20890 SDs, 0 SdLazy, 2173 SolverSat, 466 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 296 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9345occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 47731 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1161 NumberOfFragments, 14335 HoareAnnotationTreeSize, 98 FomulaSimplifications, 5557962 FormulaSimplificationTreeSizeReduction, 11.2s HoareSimplificationTime, 98 FomulaSimplificationsInter, 965813 FormulaSimplificationTreeSizeReductionInter, 50.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2489 NumberOfCodeBlocks, 2489 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2464 ConstructedInterpolants, 0 QuantifiedInterpolants, 927151 SizeOfPredicates, 16 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 304/408 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...