./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13a2f963fb17b383a7c5451f284cefc57445bb3b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 09:02:51,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 09:02:51,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 09:02:51,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 09:02:51,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 09:02:51,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 09:02:51,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 09:02:51,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 09:02:51,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 09:02:51,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 09:02:51,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 09:02:51,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 09:02:51,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 09:02:51,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 09:02:51,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 09:02:51,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 09:02:51,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 09:02:51,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 09:02:51,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 09:02:51,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 09:02:51,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 09:02:51,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 09:02:51,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 09:02:51,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 09:02:51,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 09:02:51,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 09:02:51,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 09:02:51,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 09:02:51,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 09:02:51,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 09:02:51,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 09:02:51,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 09:02:51,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 09:02:51,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 09:02:51,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 09:02:51,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 09:02:51,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 09:02:51,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 09:02:51,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 09:02:51,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 09:02:51,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 09:02:51,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 09:02:51,442 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 09:02:51,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 09:02:51,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 09:02:51,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 09:02:51,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 09:02:51,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 09:02:51,445 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 09:02:51,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 09:02:51,446 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 09:02:51,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 09:02:51,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 09:02:51,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 09:02:51,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 09:02:51,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 09:02:51,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 09:02:51,447 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 09:02:51,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 09:02:51,447 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 09:02:51,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 09:02:51,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 09:02:51,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 09:02:51,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 09:02:51,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:02:51,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 09:02:51,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 09:02:51,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 09:02:51,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 09:02:51,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 09:02:51,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 09:02:51,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 09:02:51,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 13a2f963fb17b383a7c5451f284cefc57445bb3b [2021-08-26 09:02:51,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 09:02:51,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 09:02:51,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 09:02:51,754 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 09:02:51,756 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 09:02:51,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2021-08-26 09:02:51,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d1af6d9/53c7c7cfde8342c1b5dd86c371a60ab9/FLAG9d71b7bfc [2021-08-26 09:02:52,245 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 09:02:52,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2021-08-26 09:02:52,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d1af6d9/53c7c7cfde8342c1b5dd86c371a60ab9/FLAG9d71b7bfc [2021-08-26 09:02:52,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8d1af6d9/53c7c7cfde8342c1b5dd86c371a60ab9 [2021-08-26 09:02:52,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 09:02:52,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 09:02:52,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 09:02:52,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 09:02:52,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 09:02:52,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:02:52" (1/1) ... [2021-08-26 09:02:52,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697fdfee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:52, skipping insertion in model container [2021-08-26 09:02:52,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:02:52" (1/1) ... [2021-08-26 09:02:52,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 09:02:52,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 09:02:52,822 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2021-08-26 09:02:52,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:02:52,968 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 09:02:52,976 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2021-08-26 09:02:53,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 09:02:53,058 INFO L208 MainTranslator]: Completed translation [2021-08-26 09:02:53,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53 WrapperNode [2021-08-26 09:02:53,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 09:02:53,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 09:02:53,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 09:02:53,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 09:02:53,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 09:02:53,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 09:02:53,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 09:02:53,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 09:02:53,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 09:02:53,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 09:02:53,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 09:02:53,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 09:02:53,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (1/1) ... [2021-08-26 09:02:53,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 09:02:53,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:02:53,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 09:02:53,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 09:02:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 09:02:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 09:02:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 09:02:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 09:02:53,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 09:02:53,951 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-08-26 09:02:53,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:02:53 BoogieIcfgContainer [2021-08-26 09:02:53,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 09:02:53,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 09:02:53,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 09:02:53,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 09:02:53,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:02:52" (1/3) ... [2021-08-26 09:02:53,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10715c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:02:53, skipping insertion in model container [2021-08-26 09:02:53,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:02:53" (2/3) ... [2021-08-26 09:02:53,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10715c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:02:53, skipping insertion in model container [2021-08-26 09:02:53,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:02:53" (3/3) ... [2021-08-26 09:02:53,958 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2021-08-26 09:02:53,961 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 09:02:53,961 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-08-26 09:02:53,990 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 09:02:53,994 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 09:02:53,995 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-26 09:02:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 266 states have (on average 1.8646616541353382) internal successors, (496), 271 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-26 09:02:54,013 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:54,014 INFO L512 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] [2021-08-26 09:02:54,014 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2021-08-26 09:02:54,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:54,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004678943] [2021-08-26 09:02:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:54,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:54,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:54,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004678943] [2021-08-26 09:02:54,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004678943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:54,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:54,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:54,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812537203] [2021-08-26 09:02:54,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:54,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:54,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:54,193 INFO L87 Difference]: Start difference. First operand has 272 states, 266 states have (on average 1.8646616541353382) internal successors, (496), 271 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:54,478 INFO L93 Difference]: Finished difference Result 719 states and 1304 transitions. [2021-08-26 09:02:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-26 09:02:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:54,494 INFO L225 Difference]: With dead ends: 719 [2021-08-26 09:02:54,494 INFO L226 Difference]: Without dead ends: 444 [2021-08-26 09:02:54,498 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-08-26 09:02:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 428. [2021-08-26 09:02:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.5933806146572105) internal successors, (674), 427 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 674 transitions. [2021-08-26 09:02:54,560 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 674 transitions. Word has length 28 [2021-08-26 09:02:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:54,561 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 674 transitions. [2021-08-26 09:02:54,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 674 transitions. [2021-08-26 09:02:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-26 09:02:54,566 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:54,566 INFO L512 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] [2021-08-26 09:02:54,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 09:02:54,567 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1366485519, now seen corresponding path program 1 times [2021-08-26 09:02:54,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:54,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858710718] [2021-08-26 09:02:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:54,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:54,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:54,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858710718] [2021-08-26 09:02:54,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858710718] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:54,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:54,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:54,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520818428] [2021-08-26 09:02:54,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:54,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:54,646 INFO L87 Difference]: Start difference. First operand 428 states and 674 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:54,791 INFO L93 Difference]: Finished difference Result 1123 states and 1791 transitions. [2021-08-26 09:02:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:54,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-08-26 09:02:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:54,794 INFO L225 Difference]: With dead ends: 1123 [2021-08-26 09:02:54,794 INFO L226 Difference]: Without dead ends: 709 [2021-08-26 09:02:54,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-08-26 09:02:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 693. [2021-08-26 09:02:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 688 states have (on average 1.629360465116279) internal successors, (1121), 692 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1121 transitions. [2021-08-26 09:02:54,810 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1121 transitions. Word has length 37 [2021-08-26 09:02:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:54,810 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 1121 transitions. [2021-08-26 09:02:54,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1121 transitions. [2021-08-26 09:02:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-26 09:02:54,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:54,812 INFO L512 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] [2021-08-26 09:02:54,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 09:02:54,812 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash -226101542, now seen corresponding path program 1 times [2021-08-26 09:02:54,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:54,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364613170] [2021-08-26 09:02:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:54,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:54,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:54,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364613170] [2021-08-26 09:02:54,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364613170] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:54,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:54,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:54,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076848025] [2021-08-26 09:02:54,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:54,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:54,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:54,845 INFO L87 Difference]: Start difference. First operand 693 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:54,893 INFO L93 Difference]: Finished difference Result 1747 states and 2828 transitions. [2021-08-26 09:02:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:54,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-08-26 09:02:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:54,897 INFO L225 Difference]: With dead ends: 1747 [2021-08-26 09:02:54,897 INFO L226 Difference]: Without dead ends: 1079 [2021-08-26 09:02:54,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-08-26 09:02:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1067. [2021-08-26 09:02:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.6233521657250471) internal successors, (1724), 1066 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1724 transitions. [2021-08-26 09:02:54,916 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1724 transitions. Word has length 38 [2021-08-26 09:02:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:54,916 INFO L470 AbstractCegarLoop]: Abstraction has 1067 states and 1724 transitions. [2021-08-26 09:02:54,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1724 transitions. [2021-08-26 09:02:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-26 09:02:54,918 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:54,918 INFO L512 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] [2021-08-26 09:02:54,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 09:02:54,918 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash -775080850, now seen corresponding path program 1 times [2021-08-26 09:02:54,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:54,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742853245] [2021-08-26 09:02:54,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:54,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:54,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:54,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742853245] [2021-08-26 09:02:54,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742853245] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:54,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:54,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:02:54,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186740174] [2021-08-26 09:02:54,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:02:54,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:02:54,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:54,953 INFO L87 Difference]: Start difference. First operand 1067 states and 1724 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:55,246 INFO L93 Difference]: Finished difference Result 2933 states and 4721 transitions. [2021-08-26 09:02:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:02:55,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-08-26 09:02:55,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:55,253 INFO L225 Difference]: With dead ends: 2933 [2021-08-26 09:02:55,253 INFO L226 Difference]: Without dead ends: 1891 [2021-08-26 09:02:55,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-08-26 09:02:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1661. [2021-08-26 09:02:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1656 states have (on average 1.5990338164251208) internal successors, (2648), 1660 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2648 transitions. [2021-08-26 09:02:55,286 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2648 transitions. Word has length 46 [2021-08-26 09:02:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:55,287 INFO L470 AbstractCegarLoop]: Abstraction has 1661 states and 2648 transitions. [2021-08-26 09:02:55,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2648 transitions. [2021-08-26 09:02:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-26 09:02:55,288 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:55,288 INFO L512 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] [2021-08-26 09:02:55,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 09:02:55,288 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-08-26 09:02:55,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:55,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529680395] [2021-08-26 09:02:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:55,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:55,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:55,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529680395] [2021-08-26 09:02:55,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529680395] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:55,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:55,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:02:55,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68373482] [2021-08-26 09:02:55,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:02:55,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:02:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:02:55,320 INFO L87 Difference]: Start difference. First operand 1661 states and 2648 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:55,694 INFO L93 Difference]: Finished difference Result 4937 states and 7764 transitions. [2021-08-26 09:02:55,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 09:02:55,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-08-26 09:02:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:55,702 INFO L225 Difference]: With dead ends: 4937 [2021-08-26 09:02:55,703 INFO L226 Difference]: Without dead ends: 3295 [2021-08-26 09:02:55,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:02:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2021-08-26 09:02:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 2921. [2021-08-26 09:02:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2916 states have (on average 1.5716735253772292) internal successors, (4583), 2920 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4583 transitions. [2021-08-26 09:02:55,784 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4583 transitions. Word has length 52 [2021-08-26 09:02:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:55,785 INFO L470 AbstractCegarLoop]: Abstraction has 2921 states and 4583 transitions. [2021-08-26 09:02:55,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4583 transitions. [2021-08-26 09:02:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-26 09:02:55,786 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:55,786 INFO L512 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] [2021-08-26 09:02:55,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 09:02:55,786 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-08-26 09:02:55,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:55,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516845008] [2021-08-26 09:02:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:55,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:55,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:55,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516845008] [2021-08-26 09:02:55,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516845008] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:55,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:55,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:55,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646570389] [2021-08-26 09:02:55,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:55,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:55,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:55,815 INFO L87 Difference]: Start difference. First operand 2921 states and 4583 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:55,931 INFO L93 Difference]: Finished difference Result 6863 states and 10722 transitions. [2021-08-26 09:02:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:55,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-08-26 09:02:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:55,942 INFO L225 Difference]: With dead ends: 6863 [2021-08-26 09:02:55,942 INFO L226 Difference]: Without dead ends: 3965 [2021-08-26 09:02:55,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2021-08-26 09:02:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3781. [2021-08-26 09:02:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3776 states have (on average 1.5500529661016949) internal successors, (5853), 3780 states have internal predecessors, (5853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5853 transitions. [2021-08-26 09:02:56,025 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5853 transitions. Word has length 52 [2021-08-26 09:02:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:56,026 INFO L470 AbstractCegarLoop]: Abstraction has 3781 states and 5853 transitions. [2021-08-26 09:02:56,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5853 transitions. [2021-08-26 09:02:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-26 09:02:56,027 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:56,027 INFO L512 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] [2021-08-26 09:02:56,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 09:02:56,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1739823060, now seen corresponding path program 1 times [2021-08-26 09:02:56,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:56,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961568472] [2021-08-26 09:02:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:56,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:56,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:56,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961568472] [2021-08-26 09:02:56,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961568472] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:56,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:56,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:56,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580649995] [2021-08-26 09:02:56,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:56,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:56,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:56,071 INFO L87 Difference]: Start difference. First operand 3781 states and 5853 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:56,403 INFO L93 Difference]: Finished difference Result 9083 states and 14177 transitions. [2021-08-26 09:02:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:56,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-26 09:02:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:56,417 INFO L225 Difference]: With dead ends: 9083 [2021-08-26 09:02:56,418 INFO L226 Difference]: Without dead ends: 5325 [2021-08-26 09:02:56,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2021-08-26 09:02:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 4575. [2021-08-26 09:02:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4570 states have (on average 1.4919037199124727) internal successors, (6818), 4574 states have internal predecessors, (6818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 6818 transitions. [2021-08-26 09:02:56,539 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 6818 transitions. Word has length 57 [2021-08-26 09:02:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:56,539 INFO L470 AbstractCegarLoop]: Abstraction has 4575 states and 6818 transitions. [2021-08-26 09:02:56,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 6818 transitions. [2021-08-26 09:02:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-26 09:02:56,541 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:56,541 INFO L512 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] [2021-08-26 09:02:56,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 09:02:56,541 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash -635425216, now seen corresponding path program 1 times [2021-08-26 09:02:56,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:56,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618890404] [2021-08-26 09:02:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:56,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:56,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:56,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618890404] [2021-08-26 09:02:56,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618890404] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:56,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:56,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:56,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484134972] [2021-08-26 09:02:56,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:56,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:56,566 INFO L87 Difference]: Start difference. First operand 4575 states and 6818 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:56,703 INFO L93 Difference]: Finished difference Result 8993 states and 13413 transitions. [2021-08-26 09:02:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:56,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-26 09:02:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:56,715 INFO L225 Difference]: With dead ends: 8993 [2021-08-26 09:02:56,715 INFO L226 Difference]: Without dead ends: 4441 [2021-08-26 09:02:56,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4441 states. [2021-08-26 09:02:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4441 to 4441. [2021-08-26 09:02:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4441 states, 4436 states have (on average 1.4691163210099187) internal successors, (6517), 4440 states have internal predecessors, (6517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4441 states to 4441 states and 6517 transitions. [2021-08-26 09:02:56,823 INFO L78 Accepts]: Start accepts. Automaton has 4441 states and 6517 transitions. Word has length 59 [2021-08-26 09:02:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:56,824 INFO L470 AbstractCegarLoop]: Abstraction has 4441 states and 6517 transitions. [2021-08-26 09:02:56,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4441 states and 6517 transitions. [2021-08-26 09:02:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-26 09:02:56,825 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:56,826 INFO L512 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] [2021-08-26 09:02:56,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 09:02:56,826 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash 400542306, now seen corresponding path program 1 times [2021-08-26 09:02:56,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:56,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922405515] [2021-08-26 09:02:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:56,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:56,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:56,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922405515] [2021-08-26 09:02:56,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922405515] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:56,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:56,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:56,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426894993] [2021-08-26 09:02:56,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:56,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:56,846 INFO L87 Difference]: Start difference. First operand 4441 states and 6517 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:56,983 INFO L93 Difference]: Finished difference Result 9529 states and 14152 transitions. [2021-08-26 09:02:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:56,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-08-26 09:02:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:57,000 INFO L225 Difference]: With dead ends: 9529 [2021-08-26 09:02:57,000 INFO L226 Difference]: Without dead ends: 5111 [2021-08-26 09:02:57,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2021-08-26 09:02:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 3435. [2021-08-26 09:02:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 3430 states have (on average 1.4877551020408164) internal successors, (5103), 3434 states have internal predecessors, (5103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5103 transitions. [2021-08-26 09:02:57,107 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5103 transitions. Word has length 60 [2021-08-26 09:02:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:57,108 INFO L470 AbstractCegarLoop]: Abstraction has 3435 states and 5103 transitions. [2021-08-26 09:02:57,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5103 transitions. [2021-08-26 09:02:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-26 09:02:57,109 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:57,109 INFO L512 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] [2021-08-26 09:02:57,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 09:02:57,110 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:57,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1524089549, now seen corresponding path program 1 times [2021-08-26 09:02:57,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:57,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484271485] [2021-08-26 09:02:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:57,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:57,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:57,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484271485] [2021-08-26 09:02:57,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484271485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:57,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:57,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 09:02:57,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373313979] [2021-08-26 09:02:57,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 09:02:57,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 09:02:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:02:57,173 INFO L87 Difference]: Start difference. First operand 3435 states and 5103 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:57,978 INFO L93 Difference]: Finished difference Result 16325 states and 24095 transitions. [2021-08-26 09:02:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 09:02:57,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-26 09:02:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:57,997 INFO L225 Difference]: With dead ends: 16325 [2021-08-26 09:02:57,997 INFO L226 Difference]: Without dead ends: 13109 [2021-08-26 09:02:58,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-08-26 09:02:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13109 states. [2021-08-26 09:02:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13109 to 4301. [2021-08-26 09:02:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4301 states, 4296 states have (on average 1.480679702048417) internal successors, (6361), 4300 states have internal predecessors, (6361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 6361 transitions. [2021-08-26 09:02:58,150 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 6361 transitions. Word has length 62 [2021-08-26 09:02:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:58,150 INFO L470 AbstractCegarLoop]: Abstraction has 4301 states and 6361 transitions. [2021-08-26 09:02:58,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 6361 transitions. [2021-08-26 09:02:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-26 09:02:58,151 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:58,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:02:58,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 09:02:58,152 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 21161543, now seen corresponding path program 1 times [2021-08-26 09:02:58,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:58,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620722883] [2021-08-26 09:02:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:58,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:58,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:58,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620722883] [2021-08-26 09:02:58,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620722883] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:58,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:58,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 09:02:58,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147163567] [2021-08-26 09:02:58,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:02:58,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:58,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:02:58,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:02:58,189 INFO L87 Difference]: Start difference. First operand 4301 states and 6361 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:59,151 INFO L93 Difference]: Finished difference Result 29739 states and 43762 transitions. [2021-08-26 09:02:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-26 09:02:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-08-26 09:02:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:59,199 INFO L225 Difference]: With dead ends: 29739 [2021-08-26 09:02:59,199 INFO L226 Difference]: Without dead ends: 25657 [2021-08-26 09:02:59,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 135.6ms TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-08-26 09:02:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25657 states. [2021-08-26 09:02:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25657 to 4609. [2021-08-26 09:02:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 4604 states have (on average 1.470677671589922) internal successors, (6771), 4608 states have internal predecessors, (6771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 6771 transitions. [2021-08-26 09:02:59,573 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 6771 transitions. Word has length 63 [2021-08-26 09:02:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:02:59,574 INFO L470 AbstractCegarLoop]: Abstraction has 4609 states and 6771 transitions. [2021-08-26 09:02:59,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 6771 transitions. [2021-08-26 09:02:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-26 09:02:59,576 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:02:59,576 INFO L512 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] [2021-08-26 09:02:59,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 09:02:59,576 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:02:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:02:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 633008800, now seen corresponding path program 1 times [2021-08-26 09:02:59,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:02:59,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525742617] [2021-08-26 09:02:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:02:59,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:02:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:02:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:02:59,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:02:59,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525742617] [2021-08-26 09:02:59,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525742617] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:02:59,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:02:59,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:02:59,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869972580] [2021-08-26 09:02:59,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:02:59,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:02:59,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:02:59,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:59,595 INFO L87 Difference]: Start difference. First operand 4609 states and 6771 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:02:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:02:59,821 INFO L93 Difference]: Finished difference Result 9704 states and 14220 transitions. [2021-08-26 09:02:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:02:59,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-26 09:02:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:02:59,829 INFO L225 Difference]: With dead ends: 9704 [2021-08-26 09:02:59,829 INFO L226 Difference]: Without dead ends: 5116 [2021-08-26 09:02:59,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:02:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5116 states. [2021-08-26 09:03:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5116 to 5042. [2021-08-26 09:03:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5042 states, 5037 states have (on average 1.4643637085566805) internal successors, (7376), 5041 states have internal predecessors, (7376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 7376 transitions. [2021-08-26 09:03:00,160 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 7376 transitions. Word has length 77 [2021-08-26 09:03:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:00,160 INFO L470 AbstractCegarLoop]: Abstraction has 5042 states and 7376 transitions. [2021-08-26 09:03:00,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 7376 transitions. [2021-08-26 09:03:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-26 09:03:00,163 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:00,164 INFO L512 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] [2021-08-26 09:03:00,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 09:03:00,164 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash -120422989, now seen corresponding path program 1 times [2021-08-26 09:03:00,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:00,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584167905] [2021-08-26 09:03:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:00,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:03:00,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:00,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584167905] [2021-08-26 09:03:00,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584167905] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:00,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:03:00,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 09:03:00,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616041034] [2021-08-26 09:03:00,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 09:03:00,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:00,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 09:03:00,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 09:03:00,219 INFO L87 Difference]: Start difference. First operand 5042 states and 7376 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:00,687 INFO L93 Difference]: Finished difference Result 13482 states and 19556 transitions. [2021-08-26 09:03:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 09:03:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-26 09:03:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:00,701 INFO L225 Difference]: With dead ends: 13482 [2021-08-26 09:03:00,701 INFO L226 Difference]: Without dead ends: 8340 [2021-08-26 09:03:00,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:03:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2021-08-26 09:03:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 7477. [2021-08-26 09:03:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7477 states, 7472 states have (on average 1.436830835117773) internal successors, (10736), 7476 states have internal predecessors, (10736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 10736 transitions. [2021-08-26 09:03:01,064 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 10736 transitions. Word has length 88 [2021-08-26 09:03:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:01,065 INFO L470 AbstractCegarLoop]: Abstraction has 7477 states and 10736 transitions. [2021-08-26 09:03:01,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 10736 transitions. [2021-08-26 09:03:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-26 09:03:01,067 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:01,067 INFO L512 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] [2021-08-26 09:03:01,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 09:03:01,067 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1916611, now seen corresponding path program 1 times [2021-08-26 09:03:01,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:01,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129806670] [2021-08-26 09:03:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:01,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:03:01,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:01,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129806670] [2021-08-26 09:03:01,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129806670] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:01,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:03:01,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:03:01,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694270948] [2021-08-26 09:03:01,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:03:01,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:03:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:03:01,092 INFO L87 Difference]: Start difference. First operand 7477 states and 10736 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:01,235 INFO L93 Difference]: Finished difference Result 10796 states and 15541 transitions. [2021-08-26 09:03:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:03:01,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-08-26 09:03:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:01,241 INFO L225 Difference]: With dead ends: 10796 [2021-08-26 09:03:01,241 INFO L226 Difference]: Without dead ends: 3327 [2021-08-26 09:03:01,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:03:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2021-08-26 09:03:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3274. [2021-08-26 09:03:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3274 states, 3269 states have (on average 1.3487304986234323) internal successors, (4409), 3273 states have internal predecessors, (4409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4409 transitions. [2021-08-26 09:03:01,355 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 4409 transitions. Word has length 95 [2021-08-26 09:03:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:01,355 INFO L470 AbstractCegarLoop]: Abstraction has 3274 states and 4409 transitions. [2021-08-26 09:03:01,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 4409 transitions. [2021-08-26 09:03:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-26 09:03:01,356 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:01,357 INFO L512 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] [2021-08-26 09:03:01,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 09:03:01,357 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:01,357 INFO L82 PathProgramCache]: Analyzing trace with hash -390807016, now seen corresponding path program 1 times [2021-08-26 09:03:01,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:01,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776570832] [2021-08-26 09:03:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:01,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:03:01,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:01,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776570832] [2021-08-26 09:03:01,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776570832] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:01,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:03:01,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:03:01,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862337355] [2021-08-26 09:03:01,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:03:01,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:03:01,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:03:01,396 INFO L87 Difference]: Start difference. First operand 3274 states and 4409 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:01,809 INFO L93 Difference]: Finished difference Result 12501 states and 16843 transitions. [2021-08-26 09:03:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 09:03:01,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-08-26 09:03:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:01,818 INFO L225 Difference]: With dead ends: 12501 [2021-08-26 09:03:01,819 INFO L226 Difference]: Without dead ends: 9401 [2021-08-26 09:03:01,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:03:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2021-08-26 09:03:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 3276. [2021-08-26 09:03:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 3271 states have (on average 1.3466829715683277) internal successors, (4405), 3275 states have internal predecessors, (4405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4405 transitions. [2021-08-26 09:03:01,959 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4405 transitions. Word has length 98 [2021-08-26 09:03:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:01,960 INFO L470 AbstractCegarLoop]: Abstraction has 3276 states and 4405 transitions. [2021-08-26 09:03:01,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4405 transitions. [2021-08-26 09:03:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-26 09:03:01,963 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:01,963 INFO L512 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, 1] [2021-08-26 09:03:01,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 09:03:01,963 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash -126414573, now seen corresponding path program 1 times [2021-08-26 09:03:01,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:01,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946129441] [2021-08-26 09:03:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:01,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:03:02,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:02,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946129441] [2021-08-26 09:03:02,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946129441] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:02,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108086668] [2021-08-26 09:03:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:02,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:02,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:02,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:02,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 09:03:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:02,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:03:02,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:03:02,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108086668] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:02,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:03:02,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-08-26 09:03:02,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455274282] [2021-08-26 09:03:02,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:03:02,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:03:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:02,461 INFO L87 Difference]: Start difference. First operand 3276 states and 4405 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:02,599 INFO L93 Difference]: Finished difference Result 3907 states and 5244 transitions. [2021-08-26 09:03:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:03:02,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-26 09:03:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:02,603 INFO L225 Difference]: With dead ends: 3907 [2021-08-26 09:03:02,603 INFO L226 Difference]: Without dead ends: 3903 [2021-08-26 09:03:02,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3903 states. [2021-08-26 09:03:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3903 to 3853. [2021-08-26 09:03:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3848 states have (on average 1.343035343035343) internal successors, (5168), 3852 states have internal predecessors, (5168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5168 transitions. [2021-08-26 09:03:02,798 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5168 transitions. Word has length 100 [2021-08-26 09:03:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:02,798 INFO L470 AbstractCegarLoop]: Abstraction has 3853 states and 5168 transitions. [2021-08-26 09:03:02,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5168 transitions. [2021-08-26 09:03:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-26 09:03:02,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:02,800 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-08-26 09:03:02,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-26 09:03:03,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-26 09:03:03,015 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash -103777098, now seen corresponding path program 1 times [2021-08-26 09:03:03,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:03,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310842209] [2021-08-26 09:03:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:03,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 09:03:03,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:03,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310842209] [2021-08-26 09:03:03,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310842209] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:03,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322560292] [2021-08-26 09:03:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:03,063 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:03,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:03,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:03,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 09:03:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:03,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:03:03,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:03:03,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322560292] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:03,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:03:03,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-08-26 09:03:03,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029477400] [2021-08-26 09:03:03,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:03:03,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:03,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:03:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:03,553 INFO L87 Difference]: Start difference. First operand 3853 states and 5168 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:03,724 INFO L93 Difference]: Finished difference Result 6855 states and 9241 transitions. [2021-08-26 09:03:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:03:03,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2021-08-26 09:03:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:03,728 INFO L225 Difference]: With dead ends: 6855 [2021-08-26 09:03:03,728 INFO L226 Difference]: Without dead ends: 3011 [2021-08-26 09:03:03,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2021-08-26 09:03:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 2790. [2021-08-26 09:03:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2785 states have (on average 1.3213644524236985) internal successors, (3680), 2789 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3680 transitions. [2021-08-26 09:03:03,870 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3680 transitions. Word has length 153 [2021-08-26 09:03:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:03,870 INFO L470 AbstractCegarLoop]: Abstraction has 2790 states and 3680 transitions. [2021-08-26 09:03:03,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3680 transitions. [2021-08-26 09:03:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-26 09:03:03,872 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:03,872 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-08-26 09:03:03,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 09:03:04,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-26 09:03:04,089 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash -744158357, now seen corresponding path program 1 times [2021-08-26 09:03:04,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:04,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801257770] [2021-08-26 09:03:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:04,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:03:04,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:04,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801257770] [2021-08-26 09:03:04,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801257770] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:04,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988050516] [2021-08-26 09:03:04,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:04,151 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:04,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:04,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 09:03:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:04,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:03:04,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-26 09:03:04,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988050516] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:04,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:03:04,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-08-26 09:03:04,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258322764] [2021-08-26 09:03:04,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:03:04,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:03:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:04,746 INFO L87 Difference]: Start difference. First operand 2790 states and 3680 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:04,912 INFO L93 Difference]: Finished difference Result 5411 states and 7176 transitions. [2021-08-26 09:03:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:03:04,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-08-26 09:03:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:04,915 INFO L225 Difference]: With dead ends: 5411 [2021-08-26 09:03:04,915 INFO L226 Difference]: Without dead ends: 2790 [2021-08-26 09:03:04,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2021-08-26 09:03:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2790. [2021-08-26 09:03:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2785 states have (on average 1.2868940754039497) internal successors, (3584), 2789 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3584 transitions. [2021-08-26 09:03:05,057 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3584 transitions. Word has length 156 [2021-08-26 09:03:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:05,058 INFO L470 AbstractCegarLoop]: Abstraction has 2790 states and 3584 transitions. [2021-08-26 09:03:05,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3584 transitions. [2021-08-26 09:03:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-08-26 09:03:05,060 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:05,060 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:05,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 09:03:05,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-26 09:03:05,274 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1224698480, now seen corresponding path program 1 times [2021-08-26 09:03:05,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:05,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459969341] [2021-08-26 09:03:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:05,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:03:05,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:05,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459969341] [2021-08-26 09:03:05,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459969341] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:05,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369887565] [2021-08-26 09:03:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:05,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:05,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:05,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 09:03:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:05,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-26 09:03:05,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-26 09:03:05,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369887565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:05,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:03:05,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-08-26 09:03:05,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82431660] [2021-08-26 09:03:05,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:03:05,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:03:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:05,943 INFO L87 Difference]: Start difference. First operand 2790 states and 3584 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:06,342 INFO L93 Difference]: Finished difference Result 6302 states and 8253 transitions. [2021-08-26 09:03:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:03:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2021-08-26 09:03:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:06,347 INFO L225 Difference]: With dead ends: 6302 [2021-08-26 09:03:06,347 INFO L226 Difference]: Without dead ends: 3681 [2021-08-26 09:03:06,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 09:03:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2021-08-26 09:03:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3590. [2021-08-26 09:03:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 3585 states have (on average 1.2543933054393306) internal successors, (4497), 3589 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 4497 transitions. [2021-08-26 09:03:06,554 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 4497 transitions. Word has length 157 [2021-08-26 09:03:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:06,555 INFO L470 AbstractCegarLoop]: Abstraction has 3590 states and 4497 transitions. [2021-08-26 09:03:06,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4497 transitions. [2021-08-26 09:03:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-08-26 09:03:06,557 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:06,557 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:06,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 09:03:06,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:06,794 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash 114274644, now seen corresponding path program 1 times [2021-08-26 09:03:06,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:06,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825456139] [2021-08-26 09:03:06,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:06,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:03:06,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:06,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825456139] [2021-08-26 09:03:06,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825456139] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:06,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918694439] [2021-08-26 09:03:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:06,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:06,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:06,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 09:03:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:07,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 09:03:07,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-26 09:03:07,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918694439] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:07,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:03:07,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2021-08-26 09:03:07,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986166348] [2021-08-26 09:03:07,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 09:03:07,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 09:03:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-26 09:03:07,621 INFO L87 Difference]: Start difference. First operand 3590 states and 4497 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:08,715 INFO L93 Difference]: Finished difference Result 19008 states and 23932 transitions. [2021-08-26 09:03:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-26 09:03:08,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-08-26 09:03:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:08,733 INFO L225 Difference]: With dead ends: 19008 [2021-08-26 09:03:08,733 INFO L226 Difference]: Without dead ends: 15587 [2021-08-26 09:03:08,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 228.6ms TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2021-08-26 09:03:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15587 states. [2021-08-26 09:03:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15587 to 5085. [2021-08-26 09:03:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5085 states, 5080 states have (on average 1.2590551181102363) internal successors, (6396), 5084 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5085 states to 5085 states and 6396 transitions. [2021-08-26 09:03:09,009 INFO L78 Accepts]: Start accepts. Automaton has 5085 states and 6396 transitions. Word has length 159 [2021-08-26 09:03:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:09,009 INFO L470 AbstractCegarLoop]: Abstraction has 5085 states and 6396 transitions. [2021-08-26 09:03:09,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5085 states and 6396 transitions. [2021-08-26 09:03:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-08-26 09:03:09,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:09,012 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:09,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-08-26 09:03:09,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:09,229 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1253383823, now seen corresponding path program 1 times [2021-08-26 09:03:09,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:09,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840820471] [2021-08-26 09:03:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:09,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 101 proven. 101 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 09:03:09,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:09,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840820471] [2021-08-26 09:03:09,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840820471] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:09,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808700499] [2021-08-26 09:03:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:09,317 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:09,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:09,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 09:03:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:09,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 09:03:09,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 09:03:10,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808700499] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:10,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-26 09:03:10,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2021-08-26 09:03:10,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505628041] [2021-08-26 09:03:10,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:03:10,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:03:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-26 09:03:10,275 INFO L87 Difference]: Start difference. First operand 5085 states and 6396 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:10,679 INFO L93 Difference]: Finished difference Result 11178 states and 14067 transitions. [2021-08-26 09:03:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 09:03:10,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2021-08-26 09:03:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:10,686 INFO L225 Difference]: With dead ends: 11178 [2021-08-26 09:03:10,686 INFO L226 Difference]: Without dead ends: 6259 [2021-08-26 09:03:10,691 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 43.6ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-08-26 09:03:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2021-08-26 09:03:10,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 4955. [2021-08-26 09:03:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 4950 states have (on average 1.2567676767676768) internal successors, (6221), 4954 states have internal predecessors, (6221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 6221 transitions. [2021-08-26 09:03:10,923 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 6221 transitions. Word has length 257 [2021-08-26 09:03:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:10,924 INFO L470 AbstractCegarLoop]: Abstraction has 4955 states and 6221 transitions. [2021-08-26 09:03:10,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 6221 transitions. [2021-08-26 09:03:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-08-26 09:03:10,926 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:10,926 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:10,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 09:03:11,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:11,146 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 35825393, now seen corresponding path program 1 times [2021-08-26 09:03:11,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:11,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793918111] [2021-08-26 09:03:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:11,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-08-26 09:03:11,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:11,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793918111] [2021-08-26 09:03:11,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793918111] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:11,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:03:11,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 09:03:11,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418405919] [2021-08-26 09:03:11,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 09:03:11,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 09:03:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:03:11,189 INFO L87 Difference]: Start difference. First operand 4955 states and 6221 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:11,336 INFO L93 Difference]: Finished difference Result 5810 states and 7180 transitions. [2021-08-26 09:03:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 09:03:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2021-08-26 09:03:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:11,337 INFO L225 Difference]: With dead ends: 5810 [2021-08-26 09:03:11,337 INFO L226 Difference]: Without dead ends: 910 [2021-08-26 09:03:11,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 09:03:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-08-26 09:03:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 907. [2021-08-26 09:03:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 904 states have (on average 1.084070796460177) internal successors, (980), 906 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 980 transitions. [2021-08-26 09:03:11,388 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 980 transitions. Word has length 258 [2021-08-26 09:03:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:11,389 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 980 transitions. [2021-08-26 09:03:11,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 980 transitions. [2021-08-26 09:03:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-08-26 09:03:11,390 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:11,390 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:11,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 09:03:11,391 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1838022629, now seen corresponding path program 1 times [2021-08-26 09:03:11,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:11,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137331503] [2021-08-26 09:03:11,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:11,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-08-26 09:03:11,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:11,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137331503] [2021-08-26 09:03:11,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137331503] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:11,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:03:11,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 09:03:11,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208512981] [2021-08-26 09:03:11,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 09:03:11,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 09:03:11,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 09:03:11,448 INFO L87 Difference]: Start difference. First operand 907 states and 980 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:11,640 INFO L93 Difference]: Finished difference Result 1870 states and 2021 transitions. [2021-08-26 09:03:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 09:03:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2021-08-26 09:03:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:11,642 INFO L225 Difference]: With dead ends: 1870 [2021-08-26 09:03:11,642 INFO L226 Difference]: Without dead ends: 1573 [2021-08-26 09:03:11,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 50.2ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-26 09:03:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2021-08-26 09:03:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 905. [2021-08-26 09:03:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 902 states have (on average 1.0798226164079823) internal successors, (974), 904 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 974 transitions. [2021-08-26 09:03:11,691 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 974 transitions. Word has length 259 [2021-08-26 09:03:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:11,691 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 974 transitions. [2021-08-26 09:03:11,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 974 transitions. [2021-08-26 09:03:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2021-08-26 09:03:11,692 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:11,693 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:11,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-26 09:03:11,693 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:11,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1163152431, now seen corresponding path program 1 times [2021-08-26 09:03:11,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:11,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316793492] [2021-08-26 09:03:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:11,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-08-26 09:03:11,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:11,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316793492] [2021-08-26 09:03:11,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316793492] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 09:03:11,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 09:03:11,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 09:03:11,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177019985] [2021-08-26 09:03:11,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 09:03:11,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:11,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 09:03:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 09:03:11,733 INFO L87 Difference]: Start difference. First operand 905 states and 974 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:11,829 INFO L93 Difference]: Finished difference Result 1424 states and 1536 transitions. [2021-08-26 09:03:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 09:03:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2021-08-26 09:03:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:11,831 INFO L225 Difference]: With dead ends: 1424 [2021-08-26 09:03:11,831 INFO L226 Difference]: Without dead ends: 1125 [2021-08-26 09:03:11,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 09:03:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2021-08-26 09:03:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 887. [2021-08-26 09:03:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.0632768361581921) internal successors, (941), 886 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 941 transitions. [2021-08-26 09:03:11,879 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 941 transitions. Word has length 260 [2021-08-26 09:03:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:11,879 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 941 transitions. [2021-08-26 09:03:11,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 941 transitions. [2021-08-26 09:03:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2021-08-26 09:03:11,881 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:11,881 INFO L512 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:11,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-26 09:03:11,882 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1173960251, now seen corresponding path program 1 times [2021-08-26 09:03:11,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:11,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513795039] [2021-08-26 09:03:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:11,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-08-26 09:03:12,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:12,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513795039] [2021-08-26 09:03:12,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513795039] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:12,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954823822] [2021-08-26 09:03:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:12,191 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:12,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:12,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:12,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 09:03:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:12,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-26 09:03:12,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-08-26 09:03:14,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954823822] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:14,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:03:14,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2021-08-26 09:03:14,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757593501] [2021-08-26 09:03:14,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-26 09:03:14,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-26 09:03:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-08-26 09:03:14,239 INFO L87 Difference]: Start difference. First operand 887 states and 941 transitions. Second operand has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:14,842 INFO L93 Difference]: Finished difference Result 1201 states and 1279 transitions. [2021-08-26 09:03:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-26 09:03:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 318 [2021-08-26 09:03:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:14,844 INFO L225 Difference]: With dead ends: 1201 [2021-08-26 09:03:14,844 INFO L226 Difference]: Without dead ends: 1199 [2021-08-26 09:03:14,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 547.1ms TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2021-08-26 09:03:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2021-08-26 09:03:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 887. [2021-08-26 09:03:14,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.0621468926553672) internal successors, (940), 886 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 940 transitions. [2021-08-26 09:03:14,905 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 940 transitions. Word has length 318 [2021-08-26 09:03:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:14,906 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 940 transitions. [2021-08-26 09:03:14,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 940 transitions. [2021-08-26 09:03:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-08-26 09:03:14,908 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:14,908 INFO L512 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:14,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 09:03:15,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:15,126 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1814260282, now seen corresponding path program 1 times [2021-08-26 09:03:15,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:15,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841612071] [2021-08-26 09:03:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:15,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-08-26 09:03:15,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:15,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841612071] [2021-08-26 09:03:15,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841612071] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:15,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079219590] [2021-08-26 09:03:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:15,313 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:15,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:15,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 09:03:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:16,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 09:03:16,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-08-26 09:03:16,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079219590] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:16,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:03:16,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2021-08-26 09:03:16,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000934736] [2021-08-26 09:03:16,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 09:03:16,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 09:03:16,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-26 09:03:16,784 INFO L87 Difference]: Start difference. First operand 887 states and 940 transitions. Second operand has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:17,030 INFO L93 Difference]: Finished difference Result 1228 states and 1306 transitions. [2021-08-26 09:03:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 09:03:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 364 [2021-08-26 09:03:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:17,032 INFO L225 Difference]: With dead ends: 1228 [2021-08-26 09:03:17,032 INFO L226 Difference]: Without dead ends: 1126 [2021-08-26 09:03:17,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-08-26 09:03:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2021-08-26 09:03:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 885. [2021-08-26 09:03:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.0576923076923077) internal successors, (935), 884 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 935 transitions. [2021-08-26 09:03:17,089 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 935 transitions. Word has length 364 [2021-08-26 09:03:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:17,089 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 935 transitions. [2021-08-26 09:03:17,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 935 transitions. [2021-08-26 09:03:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2021-08-26 09:03:17,091 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 09:03:17,092 INFO L512 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 09:03:17,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-26 09:03:17,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-26 09:03:17,305 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-08-26 09:03:17,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 09:03:17,305 INFO L82 PathProgramCache]: Analyzing trace with hash -73771068, now seen corresponding path program 1 times [2021-08-26 09:03:17,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 09:03:17,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773462178] [2021-08-26 09:03:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:17,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 09:03:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 86 proven. 332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 09:03:17,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 09:03:17,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773462178] [2021-08-26 09:03:17,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773462178] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:17,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558879529] [2021-08-26 09:03:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 09:03:17,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 09:03:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 09:03:17,660 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 09:03:17,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 09:03:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 09:03:18,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 45 conjunts are in the unsatisfiable core [2021-08-26 09:03:18,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 09:03:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-26 09:03:20,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558879529] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 09:03:20,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 09:03:20,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 31 [2021-08-26 09:03:20,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519617035] [2021-08-26 09:03:20,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-26 09:03:20,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 09:03:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-26 09:03:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2021-08-26 09:03:20,937 INFO L87 Difference]: Start difference. First operand 885 states and 935 transitions. Second operand has 31 states, 31 states have (on average 16.93548387096774) internal successors, (525), 31 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 09:03:22,094 INFO L93 Difference]: Finished difference Result 1126 states and 1194 transitions. [2021-08-26 09:03:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-26 09:03:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 16.93548387096774) internal successors, (525), 31 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 424 [2021-08-26 09:03:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 09:03:22,095 INFO L225 Difference]: With dead ends: 1126 [2021-08-26 09:03:22,095 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 09:03:22,097 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 431 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1051.5ms TimeCoverageRelationStatistics Valid=505, Invalid=3655, Unknown=0, NotChecked=0, Total=4160 [2021-08-26 09:03:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 09:03:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 09:03:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 09:03:22,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 424 [2021-08-26 09:03:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 09:03:22,098 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 09:03:22,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 16.93548387096774) internal successors, (525), 31 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 09:03:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 09:03:22,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 09:03:22,101 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:03:22,101 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:03:22,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:03:22,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:03:22,102 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 09:03:22,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 09:03:22,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-26 09:03:22,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 09:03:22,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:22,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:22,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:22,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:22,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:22,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:23,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:23,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:23,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:23,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:23,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:23,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:24,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:24,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:24,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:24,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:24,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:24,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:25,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:26,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:26,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:26,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:26,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:27,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:27,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:27,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:27,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:27,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:27,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:28,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:29,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:29,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:29,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:29,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:29,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:29,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:30,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:31,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:32,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:32,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:32,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:32,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:32,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:33,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:33,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:33,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:33,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:34,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:03:35,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 09:04:23,130 INFO L857 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2021-08-26 09:04:23,130 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,130 INFO L857 garLoopResultBuilder]: For program point L696(lines 696 700) no Hoare annotation was computed. [2021-08-26 09:04:23,131 INFO L853 garLoopResultBuilder]: At program point L1291(lines 1284 1310) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse21 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse25 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse24 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse20 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse8 .cse10 (<= 0 ~a_t~0) .cse13 .cse16 .cse17 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse10 .cse11 .cse13 .cse16 .cse14) (and .cse0 .cse2 .cse5 .cse8 .cse18 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ~c_req_d~0 50) .cse12 .cse13 .cse14 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse20 .cse8 .cse21 .cse22 .cse11 .cse13 .cse16 .cse23) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse25 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse17 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse15) (and .cse0 .cse8 .cse10 .cse13 .cse16 .cse14) (and .cse20 .cse8 .cse21 .cse13 .cse16 .cse14 (not .cse24)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse24 .cse0 .cse20 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse25 .cse18 (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 .cse19 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse0 .cse20 .cse8 .cse22 .cse10 .cse11 .cse13 .cse16 .cse19 .cse15 .cse23))) [2021-08-26 09:04:23,131 INFO L853 garLoopResultBuilder]: At program point L234(lines 227 262) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~a~0 50)) (.cse20 (= ~m_run_pc~0 0)) (.cse19 (= ~c_empty_rsp~0 1))) (let ((.cse4 (= 2 ~s_run_pc~0)) (.cse7 (or (and .cse19 .cse20) (and .cse19 (= ~m_run_pc~0 3)))) (.cse2 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_req_type~0 0))) (.cse11 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse18 (= ~s_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse15 (<= ~c_req_d~0 .cse21)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse17 (<= .cse21 ~c_req_d~0))) (or (and (<= 1 ULTIMATE.start_m_run_~a~0) .cse0 .cse1 (<= 50 ~s_memory0~0) (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse2 .cse3 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse5 (<= ~s_memory0~0 50) .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse10 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse14 .cse15 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse11 .cse2 .cse3 .cse18 .cse12 .cse6 .cse19 .cse16 .cse20 .cse10) (and .cse11 .cse0 .cse1 .cse18 .cse12 .cse13 .cse14 .cse15 .cse5 .cse6 .cse19 .cse16 .cse8 .cse9 .cse20 .cse17)))) [2021-08-26 09:04:23,131 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 126) no Hoare annotation was computed. [2021-08-26 09:04:23,131 INFO L857 garLoopResultBuilder]: For program point L1093(lines 1093 1097) no Hoare annotation was computed. [2021-08-26 09:04:23,131 INFO L853 garLoopResultBuilder]: At program point L103(lines 98 840) the Hoare annotation is: false [2021-08-26 09:04:23,131 INFO L853 garLoopResultBuilder]: At program point L434(lines 427 453) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) .cse3 (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-08-26 09:04:23,131 INFO L857 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2021-08-26 09:04:23,131 INFO L857 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2021-08-26 09:04:23,131 INFO L857 garLoopResultBuilder]: For program point L963(lines 963 967) no Hoare annotation was computed. [2021-08-26 09:04:23,132 INFO L853 garLoopResultBuilder]: At program point L171(lines 141 172) the Hoare annotation is: (let ((.cse18 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse3 (= ~s_run_pc~0 0)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= .cse18 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (not (= ~c_m_lock~0 1))) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse18)) (.cse17 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse16 .cse3 .cse4 .cse6 .cse8 .cse10 .cse11 .cse12 .cse15) (and .cse1 (<= 50 ~s_memory0~0) (= ULTIMATE.start_m_run_~req_a~0 1) .cse16 (<= 50 ~c_req_d~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) .cse10 .cse11 (= ~m_run_pc~0 3) .cse13 (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2021-08-26 09:04:23,132 INFO L857 garLoopResultBuilder]: For program point L105(lines 105 125) no Hoare annotation was computed. [2021-08-26 09:04:23,132 INFO L857 garLoopResultBuilder]: For program point L1030(lines 1030 1083) no Hoare annotation was computed. [2021-08-26 09:04:23,132 INFO L853 garLoopResultBuilder]: At program point L568(lines 561 614) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 (= ~c_req_a~0 0) .cse1 .cse2 (<= 1 ~a_t~0) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse13))) [2021-08-26 09:04:23,132 INFO L857 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-08-26 09:04:23,132 INFO L853 garLoopResultBuilder]: At program point L106(lines 98 840) the Hoare annotation is: false [2021-08-26 09:04:23,132 INFO L857 garLoopResultBuilder]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2021-08-26 09:04:23,132 INFO L853 garLoopResultBuilder]: At program point L635-2(lines 635 663) the Hoare annotation is: (let ((.cse22 (<= 1 ~a_t~0)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (= ~c_req_a~0 1)) (.cse15 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse23 (= ~req_tt_a~0 1)) (.cse4 (<= 0 ~a_t~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse25 (= ~c_req_a~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse11 (<= 50 ~s_memory0~0)) (.cse13 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse14 (<= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse26 (= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (<= 51 ~s_memory1~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse27 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse24 (= ~c_empty_req~0 1)) (.cse18 (<= ~s_memory0~0 50)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse20 (= ~m_run_pc~0 6)) (.cse21 (= ~a_t~0 0)) (.cse7 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse0 .cse9 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ULTIMATE.start_m_run_~a~0 1) .cse3 .cse4 .cse18 .cse5 .cse6 .cse19 .cse20 .cse21 .cse7) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse9 .cse1 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_run_~req_a~1 1) .cse2 .cse16 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse23 .cse17 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse3 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse24 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse5 .cse20 (<= 51 ~c_rsp_d~0) .cse7 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse8 .cse0 .cse25 .cse1 .cse10 .cse11 .cse13 .cse14 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse26 .cse17 .cse3 .cse27 .cse4 .cse18 .cse5 .cse6 .cse7 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse9 .cse22 .cse2 .cse3 .cse24 .cse5 .cse6 .cse20 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse17 .cse3 .cse4 .cse18 .cse5 .cse6 .cse19 .cse20 .cse7) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse8 .cse0 .cse25 .cse1 .cse10 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse13 .cse14 .cse2 .cse16 .cse26 (= ~req_tt_a~0 0) .cse17 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse27 .cse24 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse18 .cse5 (<= ~c_rsp_d~0 50) .cse19 .cse20 .cse21 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,132 INFO L853 garLoopResultBuilder]: At program point L768(lines 761 805) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 6 ~m_run_pc~0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= ~s_memory0~0 50)) (.cse14 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 6))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 .cse9 .cse10 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 .cse14 (<= ~c_rsp_d~0 50) .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 (= ~a_t~0 0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse6 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse11 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse12 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 .cse15 .cse16 (<= 51 ~c_rsp_d~0) (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,133 INFO L853 garLoopResultBuilder]: At program point L702(lines 695 721) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) .cse14 (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 (= ~a_t~0 0) .cse16 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14 .cse15 (<= 51 ~c_rsp_d~0) .cse16 (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,133 INFO L857 garLoopResultBuilder]: For program point L636(lines 635 663) no Hoare annotation was computed. [2021-08-26 09:04:23,133 INFO L857 garLoopResultBuilder]: For program point L570(lines 570 574) no Hoare annotation was computed. [2021-08-26 09:04:23,133 INFO L857 garLoopResultBuilder]: For program point L108(lines 108 124) no Hoare annotation was computed. [2021-08-26 09:04:23,133 INFO L853 garLoopResultBuilder]: At program point L901(lines 875 902) the Hoare annotation is: (let ((.cse15 (= ~c_req_type~0 0))) (let ((.cse17 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse21 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= ~s_memory1~0 51)) (.cse23 (<= 51 ~s_memory1~0)) (.cse25 (= ~m_run_pc~0 6)) (.cse1 (= ~c_req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (<= 50 ~c_req_d~0)) (.cse8 (<= ~c_req_d~0 50)) (.cse12 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_type~0 1)) (.cse18 (<= 1 ~a_t~0)) (.cse19 (<= 50 ~s_memory0~0)) (.cse20 (= ~c_req_a~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse7 (= 2 ~s_run_pc~0)) (.cse24 (<= ~s_memory0~0 50)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse14 (not .cse15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse16 .cse2 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse4 (= ~req_tt_a~0 1) .cse23 .cse7 .cse24 .cse9 .cse10 .cse25 .cse13) (and .cse15 .cse0 .cse1 .cse2 .cse17 .cse19 .cse21 .cse22 .cse4 .cse5 (= ~req_tt_a~0 0) .cse23 .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse24 .cse9 .cse10 .cse25 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~s_run_pc~0 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse16 .cse2 .cse3 .cse18 .cse19 .cse20 .cse4 (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse7 .cse24 .cse9 .cse10 .cse11 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse14)))) [2021-08-26 09:04:23,133 INFO L857 garLoopResultBuilder]: For program point L637(lines 637 641) no Hoare annotation was computed. [2021-08-26 09:04:23,133 INFO L853 garLoopResultBuilder]: At program point L109(lines 98 840) the Hoare annotation is: (let ((.cse8 (= ~c_empty_req~0 1)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (<= ~c_req_d~0 50)) (.cse19 (= ~a_t~0 0)) (.cse13 (= ~c_req_a~0 0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse15 (= ~s_run_pc~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse14 (= ~c_req_type~0 1)) (.cse2 (<= 1 ~a_t~0)) (.cse3 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ~c_req_d~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (<= ~c_req_d~0 51)) (.cse7 (= 2 ~s_run_pc~0)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse22 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse23 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse24 (not (= ~c_req_type~0 0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) .cse2 .cse3 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 (<= 51 ~s_memory1~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse16 .cse17 .cse10 .cse18 .cse11 .cse19 .cse12) (and .cse7 .cse8 .cse10 .cse18 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse16 .cse20 .cse7 .cse21 .cse8 .cse17 .cse9 .cse10 .cse11 .cse19 .cse22 .cse12 .cse23) (and .cse0 .cse4 .cse7 .cse10 .cse18 .cse11) (and .cse0 .cse13 .cse1 .cse14 .cse16 .cse7 .cse17 .cse10 .cse18 .cse11 .cse19 .cse12 .cse24) (and .cse13 .cse4 .cse15 .cse10 .cse18 .cse11 .cse24) (and .cse0 .cse1 .cse14 .cse2 .cse3 (= ~c_req_a~0 1) .cse5 .cse20 .cse6 .cse7 .cse21 .cse9 .cse10 .cse18 .cse11 .cse22 .cse12 .cse23 .cse24))) [2021-08-26 09:04:23,134 INFO L853 garLoopResultBuilder]: At program point L175-2(lines 175 203) the Hoare annotation is: (let ((.cse8 (= 2 ~s_run_pc~0)) (.cse20 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse6 (<= .cse20 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse20)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse14 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse17 (not .cse8)) (.cse18 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse4 (not (= ~s_run_st~0 0))) (.cse19 (= ~s_run_pc~0 0)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 (<= 1 ULTIMATE.start_m_run_~a~0) .cse3 (<= 50 ~s_memory0~0) (= ULTIMATE.start_m_run_~req_a~0 1) .cse4 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse9 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse10 (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) .cse11 .cse12 (= ~m_run_pc~0 3) .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse18 .cse19 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse4 .cse19 .cse5 .cse9 .cse11 .cse12 .cse13 .cse16)))) [2021-08-26 09:04:23,134 INFO L857 garLoopResultBuilder]: For program point L770(lines 770 774) no Hoare annotation was computed. [2021-08-26 09:04:23,134 INFO L857 garLoopResultBuilder]: For program point L704(lines 704 708) no Hoare annotation was computed. [2021-08-26 09:04:23,134 INFO L853 garLoopResultBuilder]: At program point L1299(lines 1292 1309) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse21 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse25 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse24 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse20 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse8 .cse10 (<= 0 ~a_t~0) .cse13 .cse16 .cse17 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse10 .cse11 .cse13 .cse16 .cse14) (and .cse0 .cse2 .cse5 .cse8 .cse18 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ~c_req_d~0 50) .cse12 .cse13 .cse14 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse20 .cse8 .cse21 .cse22 .cse11 .cse13 .cse16 .cse23) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse25 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse17 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse15) (and .cse0 .cse8 .cse10 .cse13 .cse16 .cse14) (and .cse20 .cse8 .cse21 .cse13 .cse16 .cse14 (not .cse24)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse24 .cse0 .cse20 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse25 .cse18 (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 .cse19 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse0 .cse20 .cse8 .cse22 .cse10 .cse11 .cse13 .cse16 .cse19 .cse15 .cse23))) [2021-08-26 09:04:23,134 INFO L853 garLoopResultBuilder]: At program point L242(lines 235 261) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~a~0 50)) (.cse20 (= ~m_run_pc~0 0)) (.cse19 (= ~c_empty_rsp~0 1))) (let ((.cse4 (= 2 ~s_run_pc~0)) (.cse7 (or (and .cse19 .cse20) (and .cse19 (= ~m_run_pc~0 3)))) (.cse2 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_req_type~0 0))) (.cse11 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse18 (= ~s_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse15 (<= ~c_req_d~0 .cse21)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse17 (<= .cse21 ~c_req_d~0))) (or (and (<= 1 ULTIMATE.start_m_run_~a~0) .cse0 .cse1 (<= 50 ~s_memory0~0) (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse2 .cse3 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse5 (<= ~s_memory0~0 50) .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse10 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse14 .cse15 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse11 .cse2 .cse3 .cse18 .cse12 .cse6 .cse19 .cse16 .cse20 .cse10) (and .cse11 .cse0 .cse1 .cse18 .cse12 .cse13 .cse14 .cse15 .cse5 .cse6 .cse19 .cse16 .cse8 .cse9 .cse20 .cse17)))) [2021-08-26 09:04:23,134 INFO L857 garLoopResultBuilder]: For program point L176(lines 175 203) no Hoare annotation was computed. [2021-08-26 09:04:23,134 INFO L853 garLoopResultBuilder]: At program point L969(lines 962 979) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 1)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse6 (= ~c_req_a~0 1)) (.cse7 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse25 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse27 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~s_memory1~0 51)) (.cse8 (not (= ~s_run_st~0 0))) (.cse29 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (= ~m_run_pc~0 6)) (.cse24 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse17 .cse2 .cse3 .cse8 .cse18 .cse19 .cse20 .cse9 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse8 (= ~s_run_pc~0 0) .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse27 .cse28 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse7 .cse8 .cse29 (= ~req_tt_a~0 1) .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15) (and .cse25 .cse0 .cse17 .cse2 .cse26 .cse5 .cse27 .cse28 .cse8 .cse29 .cse18 (= ~req_tt_a~0 0) .cse30 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 .cse13 .cse23 .cse31 .cse24 .cse15))) [2021-08-26 09:04:23,134 INFO L857 garLoopResultBuilder]: For program point L1300(lines 1252 1341) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L1234(lines 1234 1238) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 181) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 123) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L970(lines 962 979) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L853 garLoopResultBuilder]: At program point L442(lines 435 452) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) .cse3 (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L376(lines 376 380) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L1169(lines 1169 1173) no Hoare annotation was computed. [2021-08-26 09:04:23,135 INFO L853 garLoopResultBuilder]: At program point L112(lines 98 840) the Hoare annotation is: false [2021-08-26 09:04:23,135 INFO L857 garLoopResultBuilder]: For program point L1169-2(lines 1167 1346) no Hoare annotation was computed. [2021-08-26 09:04:23,136 INFO L853 garLoopResultBuilder]: At program point L1037(lines 1030 1083) the Hoare annotation is: (let ((.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ~c_req_d~0 50)) (.cse12 (= ~m_run_pc~0 3)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse22 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse24 (= ~m_run_pc~0 6)) (.cse19 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse8 (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse5 .cse14 .cse15 .cse16 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 .cse21) (and .cse0 .cse2 (= ~c_req_type~0 1) .cse5 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse14 .cse15 .cse16 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 (= ULTIMATE.start_s_run_~req_type~1 1) .cse21) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse23 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse24 (<= 51 ~c_rsp_d~0) .cse13 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse22 .cse0 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse23 .cse14 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse24 .cse19 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,136 INFO L857 garLoopResultBuilder]: For program point L971(lines 971 975) no Hoare annotation was computed. [2021-08-26 09:04:23,136 INFO L857 garLoopResultBuilder]: For program point L443(lines 131 477) no Hoare annotation was computed. [2021-08-26 09:04:23,136 INFO L853 garLoopResultBuilder]: At program point L576(lines 569 613) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 (= ~c_req_a~0 0) .cse1 .cse2 (<= 1 ~a_t~0) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse13))) [2021-08-26 09:04:23,136 INFO L857 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2021-08-26 09:04:23,136 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-08-26 09:04:23,136 INFO L857 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2021-08-26 09:04:23,136 INFO L853 garLoopResultBuilder]: At program point L115(lines 98 840) the Hoare annotation is: false [2021-08-26 09:04:23,136 INFO L857 garLoopResultBuilder]: For program point L908(lines 908 961) no Hoare annotation was computed. [2021-08-26 09:04:23,146 INFO L853 garLoopResultBuilder]: At program point L776(lines 769 804) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 6 ~m_run_pc~0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= ~s_memory0~0 50)) (.cse14 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 6))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 .cse9 .cse10 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 .cse14 (<= ~c_rsp_d~0 50) .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 (= ~a_t~0 0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse6 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse11 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse12 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 .cse15 .cse16 (<= 51 ~c_rsp_d~0) (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,146 INFO L853 garLoopResultBuilder]: At program point L710(lines 703 720) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) .cse14 (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 (= ~a_t~0 0) .cse16 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14 .cse15 (<= 51 ~c_rsp_d~0) .cse16 (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,147 INFO L857 garLoopResultBuilder]: For program point L578(lines 578 582) no Hoare annotation was computed. [2021-08-26 09:04:23,147 INFO L860 garLoopResultBuilder]: At program point L1371(lines 1348 1373) the Hoare annotation is: true [2021-08-26 09:04:23,147 INFO L853 garLoopResultBuilder]: At program point L314(lines 284 315) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-08-26 09:04:23,147 INFO L857 garLoopResultBuilder]: For program point L909(lines 909 913) no Hoare annotation was computed. [2021-08-26 09:04:23,147 INFO L857 garLoopResultBuilder]: For program point L711(lines 482 834) no Hoare annotation was computed. [2021-08-26 09:04:23,148 INFO L853 garLoopResultBuilder]: At program point L1240(lines 1233 1250) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-08-26 09:04:23,148 INFO L857 garLoopResultBuilder]: For program point L1174-1(lines 1167 1346) no Hoare annotation was computed. [2021-08-26 09:04:23,148 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-08-26 09:04:23,148 INFO L857 garLoopResultBuilder]: For program point L778(lines 778 782) no Hoare annotation was computed. [2021-08-26 09:04:23,148 INFO L857 garLoopResultBuilder]: For program point L712(lines 712 716) no Hoare annotation was computed. [2021-08-26 09:04:23,148 INFO L853 garLoopResultBuilder]: At program point L382(lines 375 392) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,149 INFO L853 garLoopResultBuilder]: At program point L250(lines 243 260) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~a~0 50)) (.cse20 (= ~m_run_pc~0 0)) (.cse19 (= ~c_empty_rsp~0 1))) (let ((.cse4 (= 2 ~s_run_pc~0)) (.cse7 (or (and .cse19 .cse20) (and .cse19 (= ~m_run_pc~0 3)))) (.cse2 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_req_type~0 0))) (.cse11 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse18 (= ~s_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse15 (<= ~c_req_d~0 .cse21)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse17 (<= .cse21 ~c_req_d~0))) (or (and (<= 1 ULTIMATE.start_m_run_~a~0) .cse0 .cse1 (<= 50 ~s_memory0~0) (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse2 .cse3 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse5 (<= ~s_memory0~0 50) .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse10 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse14 .cse15 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse11 .cse2 .cse3 .cse18 .cse12 .cse6 .cse19 .cse16 .cse20 .cse10) (and .cse11 .cse0 .cse1 .cse18 .cse12 .cse13 .cse14 .cse15 .cse5 .cse6 .cse19 .cse16 .cse8 .cse9 .cse20 .cse17)))) [2021-08-26 09:04:23,149 INFO L853 garLoopResultBuilder]: At program point L118(lines 98 840) the Hoare annotation is: (let ((.cse19 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse10 (<= 1 ~a_t~0)) (.cse12 (= ~c_req_a~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse16 (= ~req_tt_a~0 1)) (.cse20 (= ~c_empty_req~0 1)) (.cse8 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse21 (= ~c_req_a~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse11 (<= 50 ~s_memory0~0)) (.cse13 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse14 (<= ~s_memory1~0 51)) (.cse22 (= ~req_tt_a~0 0)) (.cse17 (<= 51 ~s_memory1~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse18 (<= ~s_memory0~0 50)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 6)) (.cse23 (= ~a_t~0 0)) (.cse7 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7) (and .cse0 .cse10 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse8 .cse0 .cse21 .cse1 .cse9 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse13 .cse14 .cse2 .cse15 .cse22 .cse17 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse3 .cse20 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse18 .cse4 (<= ~c_rsp_d~0 50) .cse19 .cse6 .cse23 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~req_a~1 1) .cse2 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse16 .cse17 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse3 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse20 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse18 .cse4 .cse6 (<= 51 ~c_rsp_d~0) .cse7 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse8 .cse0 .cse21 .cse1 .cse9 .cse11 .cse13 .cse14 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse22 .cse17 .cse3 .cse18 .cse4 .cse5 .cse6 .cse23 .cse7 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,149 INFO L857 garLoopResultBuilder]: For program point L383(lines 375 392) no Hoare annotation was computed. [2021-08-26 09:04:23,149 INFO L857 garLoopResultBuilder]: For program point L251(lines 131 477) no Hoare annotation was computed. [2021-08-26 09:04:23,149 INFO L857 garLoopResultBuilder]: For program point L1242(lines 1242 1246) no Hoare annotation was computed. [2021-08-26 09:04:23,149 INFO L857 garLoopResultBuilder]: For program point L384(lines 384 388) no Hoare annotation was computed. [2021-08-26 09:04:23,149 INFO L857 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2021-08-26 09:04:23,150 INFO L853 garLoopResultBuilder]: At program point L1045(lines 1038 1082) the Hoare annotation is: (let ((.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ~c_req_d~0 50)) (.cse12 (= ~m_run_pc~0 3)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse22 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse24 (= ~m_run_pc~0 6)) (.cse19 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse8 (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse5 .cse14 .cse15 .cse16 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 .cse21) (and .cse0 .cse2 (= ~c_req_type~0 1) .cse5 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse14 .cse15 .cse16 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 (= ULTIMATE.start_s_run_~req_type~1 1) .cse21) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse23 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse24 (<= 51 ~c_rsp_d~0) .cse13 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse22 .cse0 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse23 .cse14 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse24 .cse19 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,150 INFO L853 garLoopResultBuilder]: At program point L584(lines 577 612) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (= ~c_req_a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) .cse9 .cse10 (or (and .cse11 (= ~m_run_pc~0 0)) (and .cse11 (= ~m_run_pc~0 3))) .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,150 INFO L857 garLoopResultBuilder]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2021-08-26 09:04:23,150 INFO L853 garLoopResultBuilder]: At program point L915(lines 908 961) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 1)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse6 (= ~c_req_a~0 1)) (.cse7 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse25 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse27 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~s_memory1~0 51)) (.cse8 (not (= ~s_run_st~0 0))) (.cse29 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (= ~m_run_pc~0 6)) (.cse24 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse17 .cse2 .cse3 .cse8 .cse18 .cse19 .cse20 .cse9 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse8 (= ~s_run_pc~0 0) .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse27 .cse28 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse7 .cse8 .cse29 (= ~req_tt_a~0 1) .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15) (and .cse25 .cse0 .cse17 .cse2 .cse26 .cse5 .cse27 .cse28 .cse8 .cse29 .cse18 (= ~req_tt_a~0 0) .cse30 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 .cse13 .cse23 .cse31 .cse24 .cse15))) [2021-08-26 09:04:23,150 INFO L857 garLoopResultBuilder]: For program point L321(lines 321 374) no Hoare annotation was computed. [2021-08-26 09:04:23,151 INFO L857 garLoopResultBuilder]: For program point L1180(lines 1180 1184) no Hoare annotation was computed. [2021-08-26 09:04:23,151 INFO L857 garLoopResultBuilder]: For program point L982(lines 982 996) no Hoare annotation was computed. [2021-08-26 09:04:23,151 INFO L853 garLoopResultBuilder]: At program point L784(lines 777 803) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 6 ~m_run_pc~0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= ~s_memory0~0 50)) (.cse14 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 6))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 .cse9 .cse10 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 .cse14 (<= ~c_rsp_d~0 50) .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 (= ~a_t~0 0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse6 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse11 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse12 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 .cse15 .cse16 (<= 51 ~c_rsp_d~0) (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,151 INFO L857 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2021-08-26 09:04:23,151 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2021-08-26 09:04:23,151 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 09:04:23,151 INFO L857 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2021-08-26 09:04:23,152 INFO L853 garLoopResultBuilder]: At program point L521(lines 491 522) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (not (= ~s_run_st~0 0))) (.cse6 (<= 51 ~s_memory1~0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse14 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse11 (<= ~c_rsp_d~0 50) .cse12 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse13 .cse14 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 (<= ~c_req_d~0 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 .cse12 (= ~m_run_pc~0 3) .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14))) [2021-08-26 09:04:23,153 INFO L857 garLoopResultBuilder]: For program point L59(lines 59 64) no Hoare annotation was computed. [2021-08-26 09:04:23,153 INFO L857 garLoopResultBuilder]: For program point L786(lines 786 790) no Hoare annotation was computed. [2021-08-26 09:04:23,153 INFO L857 garLoopResultBuilder]: For program point L1315(lines 1315 1319) no Hoare annotation was computed. [2021-08-26 09:04:23,153 INFO L857 garLoopResultBuilder]: For program point L1117(lines 1116 1157) no Hoare annotation was computed. [2021-08-26 09:04:23,153 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 64) no Hoare annotation was computed. [2021-08-26 09:04:23,153 INFO L857 garLoopResultBuilder]: For program point L458(lines 458 462) no Hoare annotation was computed. [2021-08-26 09:04:23,153 INFO L853 garLoopResultBuilder]: At program point L128(lines 98 840) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (not .cse13)) (.cse2 (= ~s_run_pc~0 0)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse11 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse12 .cse7) (and .cse8 .cse9 .cse10 .cse1 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11 .cse12 .cse7)))) [2021-08-26 09:04:23,154 INFO L853 garLoopResultBuilder]: At program point L1053(lines 1046 1081) the Hoare annotation is: (let ((.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ~c_req_d~0 50)) (.cse12 (= ~m_run_pc~0 3)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse22 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse24 (= ~m_run_pc~0 6)) (.cse19 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse8 (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse5 .cse14 .cse15 .cse16 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 .cse21) (and .cse0 .cse2 (= ~c_req_type~0 1) .cse5 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse14 .cse15 .cse16 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 (= ULTIMATE.start_s_run_~req_type~1 1) .cse21) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse23 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse24 (<= 51 ~c_rsp_d~0) .cse13 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse22 .cse0 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse23 .cse14 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse24 .cse19 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,154 INFO L853 garLoopResultBuilder]: At program point L525-2(lines 525 553) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse14 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse11 (<= ~c_rsp_d~0 50) .cse12 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse13 .cse14 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse7 (<= ~c_req_d~0 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 .cse12 (= ~m_run_pc~0 3) .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14))) [2021-08-26 09:04:23,154 INFO L853 garLoopResultBuilder]: At program point L1186(lines 1179 1232) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-08-26 09:04:23,154 INFO L857 garLoopResultBuilder]: For program point L988(lines 988 995) no Hoare annotation was computed. [2021-08-26 09:04:23,154 INFO L853 garLoopResultBuilder]: At program point L592(lines 585 611) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (= ~c_req_a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) .cse9 .cse10 (or (and .cse11 (= ~m_run_pc~0 0)) (and .cse11 (= ~m_run_pc~0 3))) .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,155 INFO L857 garLoopResultBuilder]: For program point L526(lines 525 553) no Hoare annotation was computed. [2021-08-26 09:04:23,155 INFO L857 garLoopResultBuilder]: For program point L394(lines 394 400) no Hoare annotation was computed. [2021-08-26 09:04:23,155 INFO L853 garLoopResultBuilder]: At program point L394-1(lines 394 400) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (<= ~s_memory0~0 50)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ~c_req_d~0 50) .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse9 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,155 INFO L853 garLoopResultBuilder]: At program point L328(lines 321 374) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,155 INFO L857 garLoopResultBuilder]: For program point L1253(line 1253) no Hoare annotation was computed. [2021-08-26 09:04:23,155 INFO L857 garLoopResultBuilder]: For program point L1121(lines 1121 1125) no Hoare annotation was computed. [2021-08-26 09:04:23,156 INFO L857 garLoopResultBuilder]: For program point L1121-1(lines 1116 1157) no Hoare annotation was computed. [2021-08-26 09:04:23,156 INFO L857 garLoopResultBuilder]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2021-08-26 09:04:23,156 INFO L853 garLoopResultBuilder]: At program point L923(lines 916 960) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 1)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse6 (= ~c_req_a~0 1)) (.cse7 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse25 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse27 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~s_memory1~0 51)) (.cse8 (not (= ~s_run_st~0 0))) (.cse29 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (= ~m_run_pc~0 6)) (.cse24 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse17 .cse2 .cse3 .cse8 .cse18 .cse19 .cse20 .cse9 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse8 (= ~s_run_pc~0 0) .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse27 .cse28 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse7 .cse8 .cse29 (= ~req_tt_a~0 1) .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15) (and .cse25 .cse0 .cse17 .cse2 .cse26 .cse5 .cse27 .cse28 .cse8 .cse29 .cse18 (= ~req_tt_a~0 0) .cse30 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 .cse13 .cse23 .cse31 .cse24 .cse15))) [2021-08-26 09:04:23,156 INFO L857 garLoopResultBuilder]: For program point L527(lines 527 531) no Hoare annotation was computed. [2021-08-26 09:04:23,156 INFO L857 garLoopResultBuilder]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2021-08-26 09:04:23,164 INFO L853 garLoopResultBuilder]: At program point L131-2(lines 131 477) the Hoare annotation is: (let ((.cse11 (= ~c_req_type~0 0)) (.cse12 (= ~c_req_a~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (<= ~s_memory0~0 50)) (.cse9 (= ~m_run_pc~0 3)) (.cse15 (= ~a_t~0 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse13 (= ~s_run_pc~0 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_req~0 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 0))) (or (and .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) .cse3 (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ULTIMATE.start_m_run_~a~0) .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse11 .cse0 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse8 .cse15 .cse10 .cse16) (and .cse11 .cse0 .cse12 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse8 .cse15 .cse10 .cse16) (and .cse0 .cse1 .cse2 (<= 50 ~c_req_d~0) .cse3 (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 .cse15 (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse2 .cse13 .cse14 .cse3 .cse5 .cse7 .cse8 .cse16))) [2021-08-26 09:04:23,164 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 09:04:23,164 INFO L857 garLoopResultBuilder]: For program point L858(lines 858 870) no Hoare annotation was computed. [2021-08-26 09:04:23,164 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,165 INFO L853 garLoopResultBuilder]: At program point L792(lines 785 802) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 6 ~m_run_pc~0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= ~s_memory0~0 50)) (.cse14 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 6))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 .cse9 .cse10 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 .cse14 (<= ~c_rsp_d~0 50) .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 (= ~a_t~0 0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse6 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse11 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse12 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 .cse15 .cse16 (<= 51 ~c_rsp_d~0) (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,165 INFO L857 garLoopResultBuilder]: For program point L726(lines 726 730) no Hoare annotation was computed. [2021-08-26 09:04:23,166 INFO L857 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2021-08-26 09:04:23,166 INFO L857 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2021-08-26 09:04:23,167 INFO L853 garLoopResultBuilder]: At program point L1321(lines 1314 1331) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse21 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse25 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse24 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse20 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse8 .cse10 (<= 0 ~a_t~0) .cse13 .cse16 .cse17 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse10 .cse11 .cse13 .cse16 .cse14) (and .cse0 .cse2 .cse5 .cse8 .cse18 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ~c_req_d~0 50) .cse12 .cse13 .cse14 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse20 .cse8 .cse21 .cse22 .cse11 .cse13 .cse16 .cse23) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse25 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse17 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse15) (and .cse0 .cse8 .cse10 .cse13 .cse16 .cse14) (and .cse20 .cse8 .cse21 .cse13 .cse16 .cse14 (not .cse24)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse24 .cse0 .cse20 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse25 .cse18 (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 .cse19 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse0 .cse20 .cse8 .cse22 .cse10 .cse11 .cse13 .cse16 .cse19 .cse15 .cse23))) [2021-08-26 09:04:23,167 INFO L857 garLoopResultBuilder]: For program point L132(lines 131 477) no Hoare annotation was computed. [2021-08-26 09:04:23,167 INFO L853 garLoopResultBuilder]: At program point L66(lines 55 67) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~i 0) (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_run_~req_a~1 0) .cse14 (= ~a_t~0 0) .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|)))) [2021-08-26 09:04:23,167 INFO L857 garLoopResultBuilder]: For program point L925(lines 925 929) no Hoare annotation was computed. [2021-08-26 09:04:23,167 INFO L857 garLoopResultBuilder]: For program point L793(lines 482 834) no Hoare annotation was computed. [2021-08-26 09:04:23,168 INFO L857 garLoopResultBuilder]: For program point L1322(lines 1252 1341) no Hoare annotation was computed. [2021-08-26 09:04:23,168 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 137) no Hoare annotation was computed. [2021-08-26 09:04:23,168 INFO L857 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2021-08-26 09:04:23,168 INFO L853 garLoopResultBuilder]: At program point L464(lines 457 474) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) .cse3 (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-08-26 09:04:23,168 INFO L857 garLoopResultBuilder]: For program point L1323(lines 1323 1327) no Hoare annotation was computed. [2021-08-26 09:04:23,168 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-08-26 09:04:23,168 INFO L857 garLoopResultBuilder]: For program point L861(lines 861 869) no Hoare annotation was computed. [2021-08-26 09:04:23,168 INFO L857 garLoopResultBuilder]: For program point L465(lines 457 474) no Hoare annotation was computed. [2021-08-26 09:04:23,169 INFO L853 garLoopResultBuilder]: At program point L862(lines 857 1108) the Hoare annotation is: false [2021-08-26 09:04:23,169 INFO L853 garLoopResultBuilder]: At program point L664(lines 634 665) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse14 (= ~a_t~0 0) .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,169 INFO L857 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2021-08-26 09:04:23,169 INFO L853 garLoopResultBuilder]: At program point L1127(lines 1116 1157) the Hoare annotation is: (let ((.cse8 (= ~c_req_type~0 0))) (let ((.cse14 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse21 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (= ~req_tt_a~0 0)) (.cse18 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse32 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse12 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (<= ~s_memory1~0 51)) (.cse29 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse30 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse31 (= ~req_tt_a~0 1)) (.cse17 (<= 51 ~s_memory1~0)) (.cse28 (= ~c_req_a~0 1)) (.cse33 (<= 51 ~c_req_d~0)) (.cse34 (<= ~c_req_d~0 51)) (.cse11 (<= 50 ~s_memory0~0)) (.cse40 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse41 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse19 (<= ~s_memory0~0 50)) (.cse42 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse43 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse26 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse27 (<= 1 ~a_t~0)) (.cse6 (= ~m_run_pc~0 6)) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse23 (= ~m_run_st~0 0)) (.cse24 (= ~c_empty_req~0 1)) (.cse25 (= ~m_run_pc~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse36 (= ~c_req_type~0 1)) (.cse44 (= ~s_run_pc~0 0)) (.cse15 (= ULTIMATE.start_m_run_~a~0 0)) (.cse37 (<= 50 ~c_req_d~0)) (.cse38 (<= ~c_req_d~0 50)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse35 (= ~m_run_pc~0 3)) (.cse20 (= ~a_t~0 0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse39 (not .cse8))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse0 .cse9 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse3 .cse18 .cse19 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21) (and .cse8 .cse0 .cse9 .cse2 .cse22 .cse23 .cse3 .cse24 .cse4 .cse5 .cse20 .cse7 .cse25) (and .cse8 .cse0 .cse26 .cse1 .cse10 .cse27 .cse11 .cse28 .cse12 .cse13 .cse29 .cse30 .cse31 .cse17 .cse3 .cse19 .cse4 .cse5 .cse32 .cse6 .cse7) (and .cse0 .cse26 .cse1 .cse10 .cse27 .cse11 .cse12 .cse13 .cse2 .cse14 .cse33 .cse17 .cse34 .cse23 .cse3 .cse24 .cse19 .cse4 .cse35 .cse7 .cse21) (and .cse0 .cse9 .cse1 .cse36 .cse15 .cse37 .cse3 .cse38 .cse4 .cse5 .cse35 .cse20 .cse7 .cse39) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse8 .cse0 .cse9 .cse1 .cse10 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse12 .cse13 .cse2 .cse30 .cse15 .cse16 .cse17 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse23 .cse3 .cse18 .cse24 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 .cse4 (<= ~c_rsp_d~0 50) .cse32 .cse6 .cse20 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse26 .cse1 .cse10 .cse27 .cse11 .cse28 .cse12 .cse13 .cse29 (= ULTIMATE.start_s_run_~req_a~1 1) .cse2 .cse30 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse31 .cse17 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse23 .cse3 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse24 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse19 .cse4 .cse6 (<= 51 ~c_rsp_d~0) .cse7 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse26 .cse1 .cse36 .cse27 .cse11 .cse28 .cse33 .cse40 .cse34 .cse3 .cse41 .cse19 .cse4 .cse5 .cse35 .cse42 .cse7 .cse43 .cse39) (and .cse0 .cse1 .cse11 .cse2 .cse15 .cse37 .cse40 .cse23 .cse3 .cse41 .cse24 .cse38 .cse19 .cse4 .cse35 .cse20 .cse42 .cse7 .cse43) (and .cse8 .cse0 .cse9 .cse44 .cse22 .cse24 .cse4 .cse5 .cse20 .cse7 .cse25) (and .cse0 .cse26 .cse27 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse24 .cse4 .cse5 .cse35) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse35) (and .cse9 .cse2 .cse44 .cse4 .cse5 .cse35 .cse39) (and .cse9 .cse2 .cse44 .cse22 .cse23 .cse24 .cse4 .cse5 .cse25) (and .cse0 .cse9 .cse1 .cse36 .cse44 .cse15 .cse37 .cse38 .cse4 .cse5 .cse35 .cse20 .cse7 .cse39)))) [2021-08-26 09:04:23,170 INFO L853 garLoopResultBuilder]: At program point L1061(lines 1054 1080) the Hoare annotation is: (let ((.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ~c_req_d~0 50)) (.cse12 (= ~m_run_pc~0 3)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse22 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse24 (= ~m_run_pc~0 6)) (.cse19 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse8 (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse5 .cse14 .cse15 .cse16 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 .cse21) (and .cse0 .cse2 (= ~c_req_type~0 1) .cse5 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse14 .cse15 .cse16 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 (= ULTIMATE.start_s_run_~req_type~1 1) .cse21) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse23 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse24 (<= 51 ~c_rsp_d~0) .cse13 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse22 .cse0 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse23 .cse14 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse24 .cse19 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,170 INFO L857 garLoopResultBuilder]: For program point L1260(lines 1260 1313) no Hoare annotation was computed. [2021-08-26 09:04:23,170 INFO L853 garLoopResultBuilder]: At program point L1194(lines 1187 1231) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-08-26 09:04:23,170 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 76) no Hoare annotation was computed. [2021-08-26 09:04:23,170 INFO L857 garLoopResultBuilder]: For program point L864(lines 864 868) no Hoare annotation was computed. [2021-08-26 09:04:23,170 INFO L853 garLoopResultBuilder]: At program point L732(lines 725 742) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) .cse14 (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 (= ~a_t~0 0) .cse16 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14 .cse15 (<= 51 ~c_rsp_d~0) .cse16 (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,171 INFO L853 garLoopResultBuilder]: At program point L600(lines 593 610) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 (= ~c_req_a~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 0 ~a_t~0) .cse9 .cse10 (or (and .cse11 (= ~m_run_pc~0 0)) (and .cse11 (= ~m_run_pc~0 3))) .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,171 INFO L853 garLoopResultBuilder]: At program point L336(lines 329 373) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,171 INFO L857 garLoopResultBuilder]: For program point L1261(lines 1261 1265) no Hoare annotation was computed. [2021-08-26 09:04:23,171 INFO L853 garLoopResultBuilder]: At program point L204(lines 174 205) the Hoare annotation is: (let ((.cse17 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (= ~s_run_pc~0 0)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse2 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= .cse17 ULTIMATE.start_m_run_~req_d~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse17)) (.cse16 (= 2 ~s_run_pc~0)) (.cse13 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse14 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse6 (= ~m_run_pc~0 0))) (or (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse1 .cse2 .cse11 .cse12 .cse13 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6) (and .cse8 .cse10 (<= 50 ~s_memory0~0) (= ULTIMATE.start_m_run_~req_a~0 1) .cse0 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) .cse3 .cse4 (= ~m_run_pc~0 3) .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse7 .cse8 .cse9 .cse10 .cse0 .cse2 .cse11 .cse12 .cse16 .cse13 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6)))) [2021-08-26 09:04:23,171 INFO L857 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2021-08-26 09:04:23,172 INFO L853 garLoopResultBuilder]: At program point L931(lines 924 959) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 1)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse6 (= ~c_req_a~0 1)) (.cse7 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse25 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse27 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~s_memory1~0 51)) (.cse8 (not (= ~s_run_st~0 0))) (.cse29 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (= ~m_run_pc~0 6)) (.cse24 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse17 .cse2 .cse3 .cse8 .cse18 .cse19 .cse20 .cse9 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse8 (= ~s_run_pc~0 0) .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse27 .cse28 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse7 .cse8 .cse29 (= ~req_tt_a~0 1) .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15) (and .cse25 .cse0 .cse17 .cse2 .cse26 .cse5 .cse27 .cse28 .cse8 .cse29 .cse18 (= ~req_tt_a~0 0) .cse30 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 .cse13 .cse23 .cse31 .cse24 .cse15))) [2021-08-26 09:04:23,172 INFO L853 garLoopResultBuilder]: At program point L865(lines 857 1108) the Hoare annotation is: (let ((.cse13 (= ~c_req_type~0 0))) (let ((.cse6 (= ~c_req_a~0 0)) (.cse15 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse19 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse20 (<= ~s_memory1~0 51)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= 51 ~s_memory1~0)) (.cse23 (= ~m_run_pc~0 6)) (.cse10 (= ~a_t~0 0)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse8 (= ~c_req_type~0 1)) (.cse16 (<= 1 ~a_t~0)) (.cse17 (<= 50 ~s_memory0~0)) (.cse18 (= ~c_req_a~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse22 (<= ~s_memory0~0 50)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (not .cse13))) (or (and .cse0 .cse1 (= ~c_empty_req~0 1) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse0 .cse9 (<= 50 ~c_req_d~0) .cse1 (<= ~c_req_d~0 50) .cse2 .cse3 .cse4 .cse10 .cse11 .cse12) (and .cse13 .cse5 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse0 (= ~req_tt_a~0 1) .cse21 .cse1 .cse22 .cse2 .cse3 .cse23 .cse11) (and .cse13 .cse5 .cse6 .cse7 .cse15 .cse17 .cse19 .cse20 .cse0 .cse9 (= ~req_tt_a~0 0) .cse21 .cse1 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse22 .cse2 .cse3 .cse23 .cse10 .cse11) (and .cse5 .cse14 .cse7 .cse8 .cse16 .cse17 .cse18 .cse0 (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse1 .cse22 .cse2 .cse3 .cse4 (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse12)))) [2021-08-26 09:04:23,172 INFO L857 garLoopResultBuilder]: For program point L733(lines 725 742) no Hoare annotation was computed. [2021-08-26 09:04:23,172 INFO L857 garLoopResultBuilder]: For program point L601(lines 482 834) no Hoare annotation was computed. [2021-08-26 09:04:23,172 INFO L857 garLoopResultBuilder]: For program point L403(lines 403 456) no Hoare annotation was computed. [2021-08-26 09:04:23,172 INFO L857 garLoopResultBuilder]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2021-08-26 09:04:23,172 INFO L857 garLoopResultBuilder]: For program point L73(lines 73 76) no Hoare annotation was computed. [2021-08-26 09:04:23,173 INFO L857 garLoopResultBuilder]: For program point L998-1(lines 873 1103) no Hoare annotation was computed. [2021-08-26 09:04:23,174 INFO L857 garLoopResultBuilder]: For program point L734(lines 734 738) no Hoare annotation was computed. [2021-08-26 09:04:23,174 INFO L857 garLoopResultBuilder]: For program point L602(lines 602 606) no Hoare annotation was computed. [2021-08-26 09:04:23,174 INFO L857 garLoopResultBuilder]: For program point L404(lines 404 408) no Hoare annotation was computed. [2021-08-26 09:04:23,174 INFO L857 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-08-26 09:04:23,174 INFO L853 garLoopResultBuilder]: At program point L272(lines 265 282) the Hoare annotation is: (let ((.cse1 (not (= ~s_run_st~0 0))) (.cse0 (= ~c_req_a~0 0)) (.cse2 (= ~s_run_pc~0 0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~c_req_type~0 0))) (and .cse1 (= 2 ~s_run_pc~0) .cse4 .cse5) (let ((.cse8 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse0 (<= 1 ~c_m_lock~0) (= ~c_req_type~0 1) .cse2 .cse3 (<= .cse8 ULTIMATE.start_m_run_~req_d~0) (<= ULTIMATE.start_m_run_~req_d~0 .cse8) (<= ~c_req_d~0 .cse8) (= ULTIMATE.start_m_run_~req_type~0 1) .cse4 .cse5 .cse6 (= ~a_t~0 0) (<= 2 ~c_m_ev~0) .cse7 (<= .cse8 ~c_req_d~0))))) [2021-08-26 09:04:23,175 INFO L857 garLoopResultBuilder]: For program point L1131(lines 1131 1138) no Hoare annotation was computed. [2021-08-26 09:04:23,175 INFO L857 garLoopResultBuilder]: For program point L999(lines 998 1022) no Hoare annotation was computed. [2021-08-26 09:04:23,175 INFO L857 garLoopResultBuilder]: For program point L933(lines 933 937) no Hoare annotation was computed. [2021-08-26 09:04:23,176 INFO L857 garLoopResultBuilder]: For program point L273(lines 265 282) no Hoare annotation was computed. [2021-08-26 09:04:23,176 INFO L857 garLoopResultBuilder]: For program point L1000(lines 1000 1004) no Hoare annotation was computed. [2021-08-26 09:04:23,176 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,176 INFO L857 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2021-08-26 09:04:23,176 INFO L853 garLoopResultBuilder]: At program point L142-2(lines 142 170) the Hoare annotation is: (let ((.cse18 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse3 (= ~s_run_pc~0 0)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (<= .cse18 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (not (= ~c_m_lock~0 1))) (.cse7 (<= ULTIMATE.start_m_run_~req_d~0 .cse18)) (.cse17 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse13 (= ~a_t~0 0)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse16 .cse3 .cse4 .cse6 .cse8 .cse10 .cse11 .cse12 .cse15) (and .cse1 (<= 50 ~s_memory0~0) (= ULTIMATE.start_m_run_~req_a~0 1) .cse16 (<= 50 ~c_req_d~0) .cse6 (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 (<= ~c_req_d~0 50) (<= ~s_memory0~0 50) .cse10 .cse11 (= ~m_run_pc~0 3) .cse13 (<= ULTIMATE.start_s_memory_write_~v 50) .cse14 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2021-08-26 09:04:23,177 INFO L857 garLoopResultBuilder]: For program point L671(lines 671 724) no Hoare annotation was computed. [2021-08-26 09:04:23,177 INFO L857 garLoopResultBuilder]: For program point L143(lines 142 170) no Hoare annotation was computed. [2021-08-26 09:04:23,177 INFO L857 garLoopResultBuilder]: For program point L672(lines 672 676) no Hoare annotation was computed. [2021-08-26 09:04:23,177 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,177 INFO L853 garLoopResultBuilder]: At program point L1267(lines 1260 1313) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse21 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse25 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse24 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse20 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse8 .cse10 (<= 0 ~a_t~0) .cse13 .cse16 .cse17 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse10 .cse11 .cse13 .cse16 .cse14) (and .cse0 .cse2 .cse5 .cse8 .cse18 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ~c_req_d~0 50) .cse12 .cse13 .cse14 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse20 .cse8 .cse21 .cse22 .cse11 .cse13 .cse16 .cse23) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse25 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse17 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse15) (and .cse0 .cse8 .cse10 .cse13 .cse16 .cse14) (and .cse20 .cse8 .cse21 .cse13 .cse16 .cse14 (not .cse24)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse24 .cse0 .cse20 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse25 .cse18 (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 .cse19 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse0 .cse20 .cse8 .cse22 .cse10 .cse11 .cse13 .cse16 .cse19 .cse15 .cse23))) [2021-08-26 09:04:23,177 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2021-08-26 09:04:23,178 INFO L853 garLoopResultBuilder]: At program point L1069(lines 1062 1079) the Hoare annotation is: (let ((.cse15 (<= 50 ~c_req_d~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ~c_req_d~0 50)) (.cse12 (= ~m_run_pc~0 3)) (.cse20 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse21 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse22 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse23 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse24 (= ~m_run_pc~0 6)) (.cse19 (= ~a_t~0 0)) (.cse13 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse8 (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse5 .cse14 .cse15 .cse16 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 .cse21) (and .cse0 .cse2 (= ~c_req_type~0 1) .cse5 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse14 .cse15 .cse16 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse20 .cse13 (= ULTIMATE.start_s_run_~req_type~1 1) .cse21) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse23 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse24 (<= 51 ~c_rsp_d~0) .cse13 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse22 .cse0 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse23 .cse14 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse24 .cse19 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,185 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,185 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,185 INFO L857 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,185 INFO L857 garLoopResultBuilder]: For program point L12-3(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,185 INFO L857 garLoopResultBuilder]: For program point L12-4(line 12) no Hoare annotation was computed. [2021-08-26 09:04:23,185 INFO L857 garLoopResultBuilder]: For program point L211(lines 211 264) no Hoare annotation was computed. [2021-08-26 09:04:23,186 INFO L853 garLoopResultBuilder]: At program point L1202(lines 1195 1230) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-08-26 09:04:23,186 INFO L857 garLoopResultBuilder]: For program point L1070(lines 873 1103) no Hoare annotation was computed. [2021-08-26 09:04:23,186 INFO L853 garLoopResultBuilder]: At program point L13-3(lines 1 1373) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~i 0) (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_run_~req_a~1 0) .cse14 (= ~a_t~0 0) .cse15) (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-08-26 09:04:23,186 INFO L853 garLoopResultBuilder]: At program point L13-4(lines 69 79) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (<= 50 ~c_req_d~0)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse7 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= ~c_req_d~0 50)) (.cse14 (= ~a_t~0 0)) (.cse15 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~m_run_pc~0 3)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_s_run_~req_type~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse17))) [2021-08-26 09:04:23,186 INFO L853 garLoopResultBuilder]: At program point L410(lines 403 456) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) .cse3 (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-08-26 09:04:23,186 INFO L853 garLoopResultBuilder]: At program point L344(lines 337 372) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,187 INFO L857 garLoopResultBuilder]: For program point L1335(lines 1335 1339) no Hoare annotation was computed. [2021-08-26 09:04:23,187 INFO L857 garLoopResultBuilder]: For program point L1335-1(lines 1167 1346) no Hoare annotation was computed. [2021-08-26 09:04:23,187 INFO L857 garLoopResultBuilder]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2021-08-26 09:04:23,187 INFO L857 garLoopResultBuilder]: For program point L212(lines 212 216) no Hoare annotation was computed. [2021-08-26 09:04:23,187 INFO L857 garLoopResultBuilder]: For program point L1071(lines 1071 1075) no Hoare annotation was computed. [2021-08-26 09:04:23,187 INFO L853 garLoopResultBuilder]: At program point L939(lines 932 958) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 1)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse6 (= ~c_req_a~0 1)) (.cse7 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse25 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse27 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~s_memory1~0 51)) (.cse8 (not (= ~s_run_st~0 0))) (.cse29 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (= ~m_run_pc~0 6)) (.cse24 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse17 .cse2 .cse3 .cse8 .cse18 .cse19 .cse20 .cse9 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse8 (= ~s_run_pc~0 0) .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse27 .cse28 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse7 .cse8 .cse29 (= ~req_tt_a~0 1) .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15) (and .cse25 .cse0 .cse17 .cse2 .cse26 .cse5 .cse27 .cse28 .cse8 .cse29 .cse18 (= ~req_tt_a~0 0) .cse30 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 .cse13 .cse23 .cse31 .cse24 .cse15))) [2021-08-26 09:04:23,188 INFO L853 garLoopResultBuilder]: At program point L873-1(lines 857 1108) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= 2 ~s_run_pc~0)) (.cse15 (= ~m_run_pc~0 6)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse23 (not (= ~s_run_st~0 0))) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 50 ~c_req_d~0)) (.cse19 (<= ~c_req_d~0 50)) (.cse24 (= ~c_empty_rsp~0 1)) (.cse16 (= ~a_t~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse3 (<= 1 ~c_m_lock~0)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= 1 ~a_t~0)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse10 (<= 51 ~s_memory1~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= ~s_memory0~0 50)) (.cse14 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~m_run_pc~0 3)) (.cse17 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse9 (= ~req_tt_a~0 0) .cse10 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 .cse14 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 .cse16 .cse17 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse1 .cse3 .cse5 .cse9 .cse18 (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse12 .cse19 .cse13 .cse14 .cse20 .cse16 (<= ULTIMATE.start_s_memory_write_~v 50) .cse17 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse21 .cse3 .cse4 .cse22 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse10 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse11 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse12 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 .cse15 (<= 51 ~c_rsp_d~0) .cse17 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse2 .cse23 (not (= ~c_m_lock~0 1)) .cse12 .cse14 .cse24 .cse16 .cse17 (= ~m_run_pc~0 0)) (and .cse1 .cse2 .cse3 (= ~c_req_type~0 1) .cse23 (= ~s_run_pc~0 0) .cse9 .cse18 .cse19 .cse14 .cse24 .cse20 .cse16 .cse17) (and .cse1 .cse21 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse10 (<= ~c_req_d~0 51) .cse12 .cse13 .cse14 .cse20 .cse17 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,188 INFO L857 garLoopResultBuilder]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2021-08-26 09:04:23,188 INFO L857 garLoopResultBuilder]: For program point L808(lines 808 812) no Hoare annotation was computed. [2021-08-26 09:04:23,188 INFO L853 garLoopResultBuilder]: At program point L478(lines 130 479) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) (<= 50 ~s_memory0~0) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) (not (= ~s_run_st~0 0)) (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (not (= ~c_m_lock~0 1)) (<= ~c_req_d~0 51) (= 2 ~s_run_pc~0) (= ~c_empty_req~0 1) (<= ~s_memory0~0 50) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= 2 ULTIMATE.start_m_run_~a~0) (<= 2 ~c_m_ev~0) (<= 51 ULTIMATE.start_s_run_~req_d~1)) [2021-08-26 09:04:23,194 INFO L857 garLoopResultBuilder]: For program point L412(lines 412 416) no Hoare annotation was computed. [2021-08-26 09:04:23,194 INFO L857 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2021-08-26 09:04:23,194 INFO L857 garLoopResultBuilder]: For program point L941(lines 941 945) no Hoare annotation was computed. [2021-08-26 09:04:23,195 INFO L857 garLoopResultBuilder]: For program point L876-1(lines 873 1103) no Hoare annotation was computed. [2021-08-26 09:04:23,195 INFO L857 garLoopResultBuilder]: For program point L744(lines 744 750) no Hoare annotation was computed. [2021-08-26 09:04:23,195 INFO L853 garLoopResultBuilder]: At program point L744-1(lines 744 750) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse12 (<= ~c_rsp_d~0 50) .cse13 (= ULTIMATE.start_s_run_~req_a~1 0) .cse14 (= ~a_t~0 0) .cse15 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse6 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse9 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse10 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 .cse12 .cse13 .cse14 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,196 INFO L853 garLoopResultBuilder]: At program point L678(lines 671 724) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) .cse14 (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 (= ~a_t~0 0) .cse16 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14 .cse15 (<= 51 ~c_rsp_d~0) .cse16 (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,196 INFO L857 garLoopResultBuilder]: For program point L877(lines 876 900) no Hoare annotation was computed. [2021-08-26 09:04:23,196 INFO L853 garLoopResultBuilder]: At program point L1142(lines 1116 1157) the Hoare annotation is: (let ((.cse22 (= ~c_req_type~0 0))) (let ((.cse9 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse19 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse38 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse40 (= ~req_tt_a~0 1)) (.cse37 (= ~c_req_a~0 1)) (.cse10 (<= 51 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse12 (<= ~c_req_d~0 51)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse32 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse33 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse39 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~req_tt_a~0 0)) (.cse11 (<= 51 ~s_memory1~0)) (.cse26 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse15 (<= ~s_memory0~0 50)) (.cse41 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse21 (= ~m_run_pc~0 6)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse42 (= ~c_req_type~0 1)) (.cse34 (= ~s_run_pc~0 0)) (.cse24 (= ULTIMATE.start_m_run_~a~0 0)) (.cse28 (<= 50 ~c_req_d~0)) (.cse31 (<= ~c_req_d~0 50)) (.cse17 (= ~m_run_pc~0 3)) (.cse43 (not .cse22)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse23 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse35 (not (= ~c_m_lock~0 1))) (.cse13 (= 2 ~s_run_pc~0)) (.cse14 (= ~c_empty_req~0 1)) (.cse16 (= 2 ~c_write_rsp_ev~0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse27 (= ~a_t~0 0)) (.cse18 (<= 2 ~c_m_ev~0)) (.cse36 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse8 .cse13 (<= 0 ~a_t~0) .cse16 .cse20 .cse21 .cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse22 .cse0 .cse23 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse24 .cse25 .cse11 .cse13 .cse26 .cse15 .cse16 .cse20 .cse21 .cse27 .cse18 .cse19) (and .cse0 .cse2 .cse5 .cse8 .cse24 .cse28 .cse29 .cse13 .cse30 .cse14 .cse31 .cse15 .cse16 .cse17 .cse27 .cse32 .cse18 .cse33) (and .cse23 .cse8 .cse34 .cse35 .cse14 .cse16 .cse20 .cse36) (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse37 .cse6 .cse7 .cse38 .cse39 .cse40 .cse11 .cse13 .cse15 .cse16 .cse20 .cse41 .cse21 .cse18) (and .cse0 .cse23 .cse2 .cse42 .cse24 .cse28 .cse13 .cse31 .cse16 .cse20 .cse17 .cse27 .cse18 .cse43) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse22 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse37 .cse6 .cse7 .cse38 (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse39 (<= |ULTIMATE.start_s_memory_read_#res| 51) .cse40 .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse13 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse14 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse15 .cse16 .cse21 (<= 51 ~c_rsp_d~0) .cse18 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse2 .cse42 .cse4 .cse5 .cse37 .cse10 .cse29 .cse12 .cse13 .cse30 .cse15 .cse16 .cse20 .cse17 .cse32 .cse18 .cse33 .cse43) (and .cse22 .cse0 .cse23 .cse34 .cse35 .cse14 .cse16 .cse20 .cse27 .cse18 .cse36) (and .cse0 .cse1 .cse4 .cse8 .cse13 .cse14 .cse16 .cse20 .cse21 .cse18) (and .cse13 .cse14 .cse16 .cse20 .cse17) (and .cse0 .cse8 .cse13 .cse16 .cse20 .cse17) (and .cse23 .cse8 .cse34 .cse16 .cse20 .cse17 .cse43) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse22 .cse0 .cse23 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse39 .cse24 .cse25 .cse11 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse26 .cse14 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse16 (<= ~c_rsp_d~0 50) .cse41 .cse21 .cse27 .cse18 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse23 .cse2 .cse42 .cse34 .cse24 .cse28 .cse31 .cse16 .cse20 .cse17 .cse27 .cse18 .cse43) (and .cse22 .cse0 .cse23 .cse8 .cse35 .cse13 .cse14 .cse16 .cse20 .cse27 .cse18 .cse36)))) [2021-08-26 09:04:23,196 INFO L857 garLoopResultBuilder]: For program point L878(lines 878 882) no Hoare annotation was computed. [2021-08-26 09:04:23,196 INFO L857 garLoopResultBuilder]: For program point L680(lines 680 684) no Hoare annotation was computed. [2021-08-26 09:04:23,197 INFO L853 garLoopResultBuilder]: At program point L482-2(lines 482 834) the Hoare annotation is: (let ((.cse7 (= ~m_run_pc~0 3)) (.cse1 (<= 1 ~a_t~0)) (.cse8 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse11 (<= 50 ~s_memory0~0)) (.cse12 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse13 (<= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse17 (<= 6 ~m_run_pc~0)) (.cse14 (<= 51 ~s_memory1~0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse15 (= ~c_empty_req~0 1)) (.cse16 (<= ~s_memory0~0 50)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse18 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse14 .cse3 (<= ~c_req_d~0 51) .cse4 .cse15 .cse16 .cse5 .cse6 .cse7 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse15 .cse5 .cse6 .cse18 .cse8 .cse9) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse10 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse11 .cse12 .cse13 .cse2 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse17 .cse14 .cse3 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse4 (<= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse15 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse16 .cse5 (<= ~c_rsp_d~0 50) .cse6 (= ULTIMATE.start_s_run_~req_a~1 0) .cse18 (= ~a_t~0 0) .cse9 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,197 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 09:04:23,198 INFO L853 garLoopResultBuilder]: At program point L1275(lines 1268 1312) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse21 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse25 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse24 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse20 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse8 .cse10 (<= 0 ~a_t~0) .cse13 .cse16 .cse17 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse10 .cse11 .cse13 .cse16 .cse14) (and .cse0 .cse2 .cse5 .cse8 .cse18 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ~c_req_d~0 50) .cse12 .cse13 .cse14 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse20 .cse8 .cse21 .cse22 .cse11 .cse13 .cse16 .cse23) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse25 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse17 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse15) (and .cse0 .cse8 .cse10 .cse13 .cse16 .cse14) (and .cse20 .cse8 .cse21 .cse13 .cse16 .cse14 (not .cse24)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse24 .cse0 .cse20 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse25 .cse18 (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 .cse19 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse0 .cse20 .cse8 .cse22 .cse10 .cse11 .cse13 .cse16 .cse19 .cse15 .cse23))) [2021-08-26 09:04:23,199 INFO L853 garLoopResultBuilder]: At program point L218(lines 211 264) the Hoare annotation is: (let ((.cse18 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse3 (= 2 ~s_run_pc~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse9 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse17 (= ~s_run_pc~0 0)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= .cse18 ULTIMATE.start_m_run_~req_d~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse18)) (.cse13 (<= ~c_req_d~0 .cse18)) (.cse4 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse14 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0)) (.cse16 (<= .cse18 ~c_req_d~0))) (or (and .cse0 .cse1 (<= 50 ~s_memory0~0) (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse2 (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse4 (<= ~s_memory0~0 50) .cse5 .cse6 (= ~m_run_pc~0 3) .cse7 (<= ULTIMATE.start_s_memory_write_~v 50) .cse8 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse9 .cse0 .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse15 .cse16) (and .cse9 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse2 .cse17 .cse10 .cse5 .cse6 .cse14 .cse15 (not (= ~c_req_type~0 0))) (and .cse9 .cse0 .cse1 .cse17 .cse10 .cse11 .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse15 .cse16)))) [2021-08-26 09:04:23,199 INFO L857 garLoopResultBuilder]: For program point L483(lines 482 834) no Hoare annotation was computed. [2021-08-26 09:04:23,199 INFO L860 garLoopResultBuilder]: At program point L1342(lines 1164 1347) the Hoare annotation is: true [2021-08-26 09:04:23,200 INFO L853 garLoopResultBuilder]: At program point L285-2(lines 285 313) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0))) (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse5 (<= 51 ~c_req_d~0)) (.cse6 (<= ~c_req_d~0 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse14 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= ~s_memory0~0 50)) (.cse17 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse18 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse4 (not (= ~s_run_st~0 0))) (.cse8 (= ~c_empty_req~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse25 (not .cse7)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse24 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse13 (= ~c_req_type~0 1)) (.cse26 (= ~s_run_pc~0 0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= 50 ~c_req_d~0)) (.cse22 (<= ~c_req_d~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse23 (= ~a_t~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse19 (not (= ~c_req_type~0 0)))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse3 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 (<= 51 ~s_memory1~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 .cse13 .cse3 (= ~c_req_a~0 1) .cse5 .cse14 .cse6 .cse7 .cse15 (<= 0 ~a_t~0) .cse9 .cse10 .cse16 .cse17 .cse12 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse20 .cse21 .cse14 .cse7 .cse15 .cse8 .cse22 .cse9 .cse10 .cse11 .cse23 .cse17 .cse12 .cse18) (and .cse0 .cse24 .cse2 .cse13 .cse20 .cse21 .cse7 .cse22 .cse10 .cse16 .cse23 .cse12 .cse19) (and .cse0 .cse4 .cse7 .cse10 .cse16) (and .cse25 .cse24 .cse4 .cse26 .cse10 .cse16 .cse19) (and .cse7 .cse8 .cse10 .cse16 .cse11) (and .cse25 .cse0 .cse24 .cse2 .cse13 .cse26 .cse20 .cse21 .cse22 .cse10 .cse16 .cse23 .cse12 .cse19)))) [2021-08-26 09:04:23,200 INFO L853 garLoopResultBuilder]: At program point L1210(lines 1203 1229) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-08-26 09:04:23,200 INFO L853 garLoopResultBuilder]: At program point L814(lines 807 824) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 6 ~m_run_pc~0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= ~s_memory0~0 50)) (.cse14 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 6))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 .cse9 .cse10 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 .cse14 (<= ~c_rsp_d~0 50) .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 (= ~a_t~0 0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse6 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse11 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse12 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 .cse15 .cse16 (<= 51 ~c_rsp_d~0) (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,200 INFO L857 garLoopResultBuilder]: For program point L616(lines 616 620) no Hoare annotation was computed. [2021-08-26 09:04:23,200 INFO L857 garLoopResultBuilder]: For program point L484(lines 484 488) no Hoare annotation was computed. [2021-08-26 09:04:23,201 INFO L853 garLoopResultBuilder]: At program point L418(lines 411 455) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) .cse3 (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-08-26 09:04:23,201 INFO L853 garLoopResultBuilder]: At program point L352(lines 345 371) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,201 INFO L857 garLoopResultBuilder]: For program point L286(lines 285 313) no Hoare annotation was computed. [2021-08-26 09:04:23,201 INFO L857 garLoopResultBuilder]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2021-08-26 09:04:23,201 INFO L857 garLoopResultBuilder]: For program point L220(lines 220 224) no Hoare annotation was computed. [2021-08-26 09:04:23,201 INFO L853 garLoopResultBuilder]: At program point L947(lines 940 957) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 1)) (.cse19 (<= 50 ~c_req_d~0)) (.cse20 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse21 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ~c_req_d~0 50)) (.cse14 (= ~m_run_pc~0 3)) (.cse16 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse6 (= ~c_req_a~0 1)) (.cse7 (= ULTIMATE.start_s_run_~req_a~1 1)) (.cse25 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_a~0 0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse26 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse27 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~s_memory1~0 51)) (.cse8 (not (= ~s_run_st~0 0))) (.cse29 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse30 (<= 51 ~s_memory1~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (<= ~s_memory0~0 50)) (.cse12 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse23 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (= ~m_run_pc~0 6)) (.cse24 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 .cse17 .cse2 .cse3 .cse8 .cse18 .cse19 .cse20 .cse9 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse0 .cse17 .cse2 .cse3 .cse8 (= ~s_run_pc~0 0) .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse12 .cse13 .cse14 .cse23 .cse24 .cse15 .cse16) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse27 .cse28 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse7 .cse8 .cse29 (= ~req_tt_a~0 1) .cse30 .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse15) (and .cse25 .cse0 .cse17 .cse2 .cse26 .cse5 .cse27 .cse28 .cse8 .cse29 .cse18 (= ~req_tt_a~0 0) .cse30 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 .cse13 .cse23 .cse31 .cse24 .cse15))) [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L815(lines 807 824) no Hoare annotation was computed. [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L1146(lines 1146 1153) no Hoare annotation was computed. [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L948(lines 873 1103) no Hoare annotation was computed. [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L816(lines 816 820) no Hoare annotation was computed. [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2021-08-26 09:04:23,202 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 358) no Hoare annotation was computed. [2021-08-26 09:04:23,203 INFO L857 garLoopResultBuilder]: For program point L949(lines 949 953) no Hoare annotation was computed. [2021-08-26 09:04:23,203 INFO L853 garLoopResultBuilder]: At program point L686(lines 679 723) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) .cse14 (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 (= ~a_t~0 0) .cse16 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14 .cse15 (<= 51 ~c_rsp_d~0) .cse16 (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,203 INFO L853 garLoopResultBuilder]: At program point L554(lines 524 555) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (<= 51 ~s_memory1~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and .cse0 .cse1 .cse2 (<= 1 ~a_t~0) .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse7 (<= ~c_req_d~0 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 (= ~m_run_pc~0 3) .cse12 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse13) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 (<= ~c_rsp_d~0 50) .cse11 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse12 .cse13 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,203 INFO L857 garLoopResultBuilder]: For program point L753(lines 753 806) no Hoare annotation was computed. [2021-08-26 09:04:23,203 INFO L857 garLoopResultBuilder]: For program point L754(lines 754 758) no Hoare annotation was computed. [2021-08-26 09:04:23,203 INFO L857 garLoopResultBuilder]: For program point L688(lines 688 692) no Hoare annotation was computed. [2021-08-26 09:04:23,204 INFO L853 garLoopResultBuilder]: At program point L622(lines 615 632) the Hoare annotation is: (and (<= 1 ~c_m_lock~0) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (<= 2 ~c_m_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2021-08-26 09:04:23,204 INFO L853 garLoopResultBuilder]: At program point L1283(lines 1276 1311) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse21 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse25 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse24 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse20 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse8 .cse10 (<= 0 ~a_t~0) .cse13 .cse16 .cse17 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse10 .cse11 .cse13 .cse16 .cse14) (and .cse0 .cse2 .cse5 .cse8 .cse18 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ~c_req_d~0 50) .cse12 .cse13 .cse14 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse20 .cse8 .cse21 .cse22 .cse11 .cse13 .cse16 .cse23) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse25 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse17 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse15) (and .cse0 .cse8 .cse10 .cse13 .cse16 .cse14) (and .cse20 .cse8 .cse21 .cse13 .cse16 .cse14 (not .cse24)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse24 .cse0 .cse20 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse25 .cse18 (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 .cse19 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse0 .cse20 .cse8 .cse22 .cse10 .cse11 .cse13 .cse16 .cse19 .cse15 .cse23))) [2021-08-26 09:04:23,204 INFO L853 garLoopResultBuilder]: At program point L226(lines 219 263) the Hoare annotation is: (let ((.cse18 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse3 (= 2 ~s_run_pc~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse9 (= ~c_req_a~0 0)) (.cse0 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_req_type~0 1)) (.cse17 (= ~s_run_pc~0 0)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= .cse18 ULTIMATE.start_m_run_~req_d~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse18)) (.cse13 (<= ~c_req_d~0 .cse18)) (.cse4 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse14 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse15 (= ~m_run_pc~0 0)) (.cse16 (<= .cse18 ~c_req_d~0))) (or (and .cse0 .cse1 (<= 50 ~s_memory0~0) (= ~c_req_a~0 1) (= ULTIMATE.start_m_run_~req_a~0 1) .cse2 (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 1) (<= ULTIMATE.start_s_run_~req_d~1 50) (<= ~c_req_d~0 51) .cse3 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse4 (<= ~s_memory0~0 50) .cse5 .cse6 (= ~m_run_pc~0 3) .cse7 (<= ULTIMATE.start_s_memory_write_~v 50) .cse8 (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse9 .cse0 .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse15 .cse16) (and .cse9 (not (= ULTIMATE.start_m_run_~req_type~0 0)) .cse2 .cse17 .cse10 .cse5 .cse6 .cse14 .cse15 (not (= ~c_req_type~0 0))) (and .cse9 .cse0 .cse1 .cse17 .cse10 .cse11 .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse15 .cse16)))) [2021-08-26 09:04:23,204 INFO L857 garLoopResultBuilder]: For program point L1085(lines 1085 1089) no Hoare annotation was computed. [2021-08-26 09:04:23,204 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 09:04:23,204 INFO L857 garLoopResultBuilder]: For program point L623(lines 615 632) no Hoare annotation was computed. [2021-08-26 09:04:23,205 INFO L853 garLoopResultBuilder]: At program point L1218(lines 1211 1228) the Hoare annotation is: (let ((.cse0 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse6 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) .cse0 .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 (<= 2 ~c_m_ev~0) .cse5 .cse6) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-08-26 09:04:23,205 INFO L857 garLoopResultBuilder]: For program point L624(lines 624 628) no Hoare annotation was computed. [2021-08-26 09:04:23,205 INFO L853 garLoopResultBuilder]: At program point L426(lines 419 454) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 50 ~s_memory0~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3))) (or (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse1 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) .cse3 (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 50 ULTIMATE.start_s_memory_write_~v)))) [2021-08-26 09:04:23,205 INFO L853 garLoopResultBuilder]: At program point L492-2(lines 492 520) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (<= ~s_memory1~0 51)) (.cse5 (not (= ~s_run_st~0 0))) (.cse6 (<= 51 ~s_memory1~0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse8 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= ~s_memory0~0 50)) (.cse11 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse14 (= ULTIMATE.start_m_run_~req_type___0~0 0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) .cse1 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse3 .cse4 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) (= ~req_tt_a~0 0) .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 1) (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 .cse11 (<= ~c_rsp_d~0 50) .cse12 (= ULTIMATE.start_s_run_~req_a~1 0) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse13 .cse14 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 (<= ~c_req_d~0 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 .cse12 (= ~m_run_pc~0 3) .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14))) [2021-08-26 09:04:23,214 INFO L853 garLoopResultBuilder]: At program point L360(lines 353 370) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= ~s_memory0~0 50)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_m_run_~a~0 0) (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ~c_req_d~0 50) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) (<= ULTIMATE.start_s_memory_write_~v 50) .cse10 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse0 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 1 ~a_t~0) .cse2 (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) (<= 51 ~s_memory1~0) (<= ~c_req_d~0 51) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,215 INFO L857 garLoopResultBuilder]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2021-08-26 09:04:23,215 INFO L857 garLoopResultBuilder]: For program point L228(lines 228 232) no Hoare annotation was computed. [2021-08-26 09:04:23,215 INFO L857 garLoopResultBuilder]: For program point L1219(lines 1167 1346) no Hoare annotation was computed. [2021-08-26 09:04:23,216 INFO L857 garLoopResultBuilder]: For program point L493(lines 492 520) no Hoare annotation was computed. [2021-08-26 09:04:23,216 INFO L857 garLoopResultBuilder]: For program point L361(lines 131 477) no Hoare annotation was computed. [2021-08-26 09:04:23,226 INFO L857 garLoopResultBuilder]: For program point L1220(lines 1220 1224) no Hoare annotation was computed. [2021-08-26 09:04:23,226 INFO L857 garLoopResultBuilder]: For program point L494(lines 494 498) no Hoare annotation was computed. [2021-08-26 09:04:23,226 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-08-26 09:04:23,227 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2021-08-26 09:04:23,227 INFO L853 garLoopResultBuilder]: At program point L1023(lines 997 1024) the Hoare annotation is: (let ((.cse4 (<= 50 ~c_req_d~0)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse8 (<= ~c_req_d~0 50)) (.cse13 (<= ULTIMATE.start_s_memory_write_~v 50)) (.cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (.cse16 (= ~c_req_type~0 0)) (.cse22 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse3 (= ULTIMATE.start_m_run_~a~0 0)) (.cse26 (= ~m_run_pc~0 6)) (.cse12 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse18 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse19 (<= 1 ~a_t~0)) (.cse2 (<= 50 ~s_memory0~0)) (.cse20 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse21 (<= ~s_memory1~0 51)) (.cse23 (<= 51 ~s_memory1~0)) (.cse24 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= ~s_memory0~0 50)) (.cse10 (= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~c_empty_rsp~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse14 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_run_~req_type~1 1) .cse15) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse16 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse17 .cse1 .cse18 .cse19 .cse2 (= ~c_req_a~0 1) .cse20 .cse21 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse22 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse23 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse24 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse7 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse9 .cse10 .cse25 .cse26 .cse14 (<= 51 |ULTIMATE.start_s_memory_read_#res|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse16 .cse0 (= ~c_req_a~0 0) .cse1 .cse18 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse2 .cse20 .cse21 .cse22 .cse3 (= ~req_tt_a~0 0) .cse23 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse9 .cse10 .cse25 (= ULTIMATE.start_s_run_~req_a~1 0) .cse26 .cse12 .cse14 (<= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse0 .cse17 .cse1 .cse18 .cse19 .cse2 .cse20 .cse21 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse23 (<= ~c_req_d~0 51) .cse24 .cse7 .cse9 .cse10 .cse25 .cse11 .cse14 (<= 51 ULTIMATE.start_s_run_~req_d~1)))) [2021-08-26 09:04:23,227 INFO L857 garLoopResultBuilder]: For program point L561(lines 561 614) no Hoare annotation was computed. [2021-08-26 09:04:23,227 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 127) no Hoare annotation was computed. [2021-08-26 09:04:23,227 INFO L857 garLoopResultBuilder]: For program point L826(lines 826 832) no Hoare annotation was computed. [2021-08-26 09:04:23,227 INFO L853 garLoopResultBuilder]: At program point L826-1(lines 826 832) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 1 ~a_t~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse10 (= ~m_run_pc~0 6)) (.cse8 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 3) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7 .cse10 .cse8) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) (= ~c_req_type~0 0) .cse0 (= ~c_req_a~0 0) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 50 ULTIMATE.start_s_run_~rsp_d~1) (<= 50 ~s_memory0~0) (<= 51 ULTIMATE.start_s_memory_write_~v) (<= ~s_memory1~0 51) .cse3 (= ULTIMATE.start_s_run_~req_type~1 0) (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) (<= 51 ~s_memory1~0) .cse4 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse5 (<= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) (<= ~s_memory0~0 50) .cse6 (<= ~c_rsp_d~0 50) .cse7 (= ULTIMATE.start_s_run_~req_a~1 0) .cse10 (= ~a_t~0 0) .cse8 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)))) [2021-08-26 09:04:23,228 INFO L853 garLoopResultBuilder]: At program point L760(lines 753 806) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse3 (<= 50 ~s_memory0~0)) (.cse4 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= ~s_memory1~0 51)) (.cse6 (not (= ~s_run_st~0 0))) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (<= 6 ~m_run_pc~0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= ~s_memory0~0 50)) (.cse14 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_pc~0 6))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse3 .cse4 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse8 .cse9 .cse10 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse13 .cse14 (<= ~c_rsp_d~0 50) .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) .cse16 (= ~a_t~0 0) (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 (<= 1 ~a_t~0) .cse3 (= ~c_req_a~0 1) .cse4 .cse5 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse6 .cse7 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse11 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse12 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse13 .cse14 .cse15 .cse16 (<= 51 ~c_rsp_d~0) (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,228 INFO L853 garLoopResultBuilder]: At program point L694(lines 687 722) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse4 (<= 50 ~s_memory0~0)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (<= ~s_memory1~0 51)) (.cse7 (not (= ~s_run_st~0 0))) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ~s_memory0~0 50)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse15 (= ~m_run_pc~0 6)) (.cse16 (<= 2 ~c_m_ev~0))) (or (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse1 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse4 .cse5 (< (+ 49 ULTIMATE.start_m_run_~req_a___0~0) ULTIMATE.start_m_run_~rsp_d___0~0) .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) .cse14 (= ULTIMATE.start_s_run_~req_a~1 0) .cse15 (= ~a_t~0 0) .cse16 (<= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ULTIMATE.start_m_run_~a~0) .cse2 .cse3 (<= 1 ~a_t~0) .cse4 (= ~c_req_a~0 1) .cse5 .cse6 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse7 .cse8 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) (<= ULTIMATE.start_m_run_~rsp_d___0~0 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse14 .cse15 (<= 51 ~c_rsp_d~0) .cse16 (<= 51 ULTIMATE.start_m_run_~rsp_d___0~0) (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)))) [2021-08-26 09:04:23,228 INFO L857 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2021-08-26 09:04:23,228 INFO L853 garLoopResultBuilder]: At program point L1091(lines 1084 1101) the Hoare annotation is: (let ((.cse16 (= 2 ~s_run_pc~0)) (.cse17 (= ~c_empty_req~0 1))) (let ((.cse9 (let ((.cse19 (= ~m_run_pc~0 3))) (or (and (not (= ~s_run_st~0 0)) (= ~s_run_pc~0 0) .cse17 .cse19) (and .cse16 .cse17 .cse19)))) (.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse14 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (<= 51 ~s_memory1~0)) (.cse10 (<= ~s_memory0~0 50)) (.cse18 (= ~m_run_pc~0 6)) (.cse13 (= ~a_t~0 0)) (.cse11 (<= 2 ~c_m_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse8 (<= ~c_req_d~0 51) .cse9 .cse10 .cse11 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse5 .cse12 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse9 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) .cse10 .cse13 (<= ULTIMATE.start_s_memory_write_~v 50) .cse11 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse14 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse8 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse16 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse17 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse18 (<= 51 ~c_rsp_d~0) .cse11 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse14 .cse0 (= ~c_req_a~0 0) .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse15 .cse12 (= ~req_tt_a~0 0) .cse8 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse16 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse17 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse10 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse18 .cse13 .cse11 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0))))) [2021-08-26 09:04:23,229 INFO L853 garLoopResultBuilder]: At program point L1158(lines 1110 1163) the Hoare annotation is: (let ((.cse1 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 1 ~a_t~0)) (.cse21 (= ~s_run_pc~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 50 ~s_memory0~0)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (<= ~s_memory1~0 51)) (.cse25 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 51 ~s_memory1~0)) (.cse12 (<= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse24 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse20 (= ~c_req_a~0 0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse22 (not (= ~c_m_lock~0 1))) (.cse10 (= 2 ~s_run_pc~0)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (= 2 ~c_write_rsp_ev~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse19 (= ~a_t~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse23 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) (<= 51 ~c_req_d~0) .cse9 (<= ~c_req_d~0 51) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (and .cse0 .cse2 .cse8 .cse10 (<= 0 ~a_t~0) .cse13 .cse16 .cse17 .cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse8 .cse10 .cse11 .cse13 .cse16 .cse14) (and .cse0 .cse2 .cse5 .cse8 .cse18 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse10 (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ~c_req_d~0 50) .cse12 .cse13 .cse14 .cse19 (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 (<= 50 ULTIMATE.start_s_memory_write_~v)) (and .cse20 .cse8 .cse21 .cse22 .cse11 .cse13 .cse16 .cse23) (and (<= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse24 .cse0 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_req_a~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse8 .cse25 (<= |ULTIMATE.start_s_memory_read_#res| 51) (= ~req_tt_a~0 1) .cse9 (<= ULTIMATE.start_s_run_~rsp_d~1 51) .cse10 (<= ULTIMATE.start_s_memory_read_~x~0 51) .cse11 (<= 51 ULTIMATE.start_s_memory_read_~x~0) .cse12 .cse13 .cse17 (<= 51 ~c_rsp_d~0) .cse15 (<= 51 |ULTIMATE.start_s_memory_read_#res|) (<= ~c_rsp_d~0 51)) (and .cse0 .cse1 .cse4 .cse8 .cse10 .cse11 .cse13 .cse16 .cse17 .cse15) (and .cse0 .cse8 .cse10 .cse13 .cse16 .cse14) (and .cse20 .cse8 .cse21 .cse13 .cse16 .cse14 (not .cse24)) (and (<= ULTIMATE.start_s_memory_read_~x~0 50) .cse24 .cse0 .cse20 .cse2 .cse3 (<= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse5 .cse6 .cse7 .cse8 .cse25 .cse18 (= ~req_tt_a~0 0) .cse9 (<= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (<= ULTIMATE.start_s_run_~rsp_d~1 50) (<= 50 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse13 (<= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) .cse17 .cse19 .cse15 (<= |ULTIMATE.start_s_memory_read_#res| 50) (<= 50 ~c_rsp_d~0)) (and .cse24 .cse0 .cse20 .cse8 .cse22 .cse10 .cse11 .cse13 .cse16 .cse19 .cse15 .cse23))) [2021-08-26 09:04:23,229 INFO L857 garLoopResultBuilder]: For program point L1092(lines 1084 1101) no Hoare annotation was computed. [2021-08-26 09:04:23,232 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 09:04:23,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:04:23 BoogieIcfgContainer [2021-08-26 09:04:23,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 09:04:23,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 09:04:23,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 09:04:23,397 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 09:04:23,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:02:53" (3/4) ... [2021-08-26 09:04:23,400 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 09:04:23,446 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-08-26 09:04:23,446 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 09:04:23,447 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 09:04:23,448 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 09:04:23,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && m_run_st == 0) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || ((((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && m_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) [2021-08-26 09:04:23,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) [2021-08-26 09:04:23,480 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) [2021-08-26 09:04:23,481 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 51 <= \result)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) [2021-08-26 09:04:23,481 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) || ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev)) || (((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && 50 <= x) && 2 == s_run_pc) && req_a___0 + 50 <= rsp_d___0) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && 51 <= req_d) [2021-08-26 09:04:23,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) [2021-08-26 09:04:23,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) [2021-08-26 09:04:23,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) [2021-08-26 09:04:23,486 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || ((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && ((((!(s_run_st == 0) && s_run_pc == 0) && c_empty_req == 1) && m_run_pc == 3) || ((2 == s_run_pc && c_empty_req == 1) && m_run_pc == 3))) && s_memory0 <= 50) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && ((((!(s_run_st == 0) && s_run_pc == 0) && c_empty_req == 1) && m_run_pc == 3) || ((2 == s_run_pc && c_empty_req == 1) && m_run_pc == 3))) && 50 <= req_d) && c_req_d <= 50) && s_memory0 <= 50) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) && 0 <= a) || (((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 51 <= s_memory1) && a == 1) && 2 == s_run_pc) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) [2021-08-26 09:04:23,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && i == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) || ((((((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 51 <= \result) [2021-08-26 09:04:23,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) [2021-08-26 09:04:23,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) [2021-08-26 09:04:23,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && req_a___0 + 50 <= rsp_d___0) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) [2021-08-26 09:04:23,577 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 09:04:23,592 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 09:04:23,594 INFO L168 Benchmark]: Toolchain (without parser) took 90934.33 ms. Allocated memory was 69.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 52.5 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-08-26 09:04:23,594 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 48.2 MB. Free memory was 29.3 MB in the beginning and 29.2 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 09:04:23,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.44 ms. Allocated memory is still 69.2 MB. Free memory was 52.3 MB in the beginning and 44.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-26 09:04:23,595 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.73 ms. Allocated memory is still 69.2 MB. Free memory was 44.3 MB in the beginning and 41.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 09:04:23,595 INFO L168 Benchmark]: Boogie Preprocessor took 58.94 ms. Allocated memory is still 69.2 MB. Free memory was 41.0 MB in the beginning and 37.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:04:23,595 INFO L168 Benchmark]: RCFGBuilder took 764.88 ms. Allocated memory was 69.2 MB in the beginning and 90.2 MB in the end (delta: 21.0 MB). Free memory was 37.6 MB in the beginning and 52.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 16.1 GB. [2021-08-26 09:04:23,595 INFO L168 Benchmark]: TraceAbstraction took 89443.23 ms. Allocated memory was 90.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 51.6 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.1 GB. [2021-08-26 09:04:23,595 INFO L168 Benchmark]: Witness Printer took 195.41 ms. Allocated memory is still 2.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-08-26 09:04:23,596 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 48.2 MB. Free memory was 29.3 MB in the beginning and 29.2 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 389.44 ms. Allocated memory is still 69.2 MB. Free memory was 52.3 MB in the beginning and 44.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.73 ms. Allocated memory is still 69.2 MB. Free memory was 44.3 MB in the beginning and 41.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.94 ms. Allocated memory is still 69.2 MB. Free memory was 41.0 MB in the beginning and 37.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 764.88 ms. Allocated memory was 69.2 MB in the beginning and 90.2 MB in the end (delta: 21.0 MB). Free memory was 37.6 MB in the beginning and 52.4 MB in the end (delta: -14.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 89443.23 ms. Allocated memory was 90.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 51.6 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.1 GB. * Witness Printer took 195.41 ms. Allocated memory is still 2.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 272 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 89243.5ms, OverallIterations: 27, TraceHistogramMax: 8, EmptinessCheckTime: 51.0ms, AutomataDifference: 10074.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 60812.2ms, InitialAbstractionConstructionTime: 9.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15799 SDtfs, 26653 SDslu, 43118 SDs, 0 SdLazy, 4845 SolverSat, 659 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2487.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2482 GetRequests, 2209 SyntacticMatches, 3 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1898 ImplicationChecksByTransitivity, 2323.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7477occurred in iteration=13, InterpolantAutomatonStates: 259, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3467.1ms AutomataMinimizationTime, 27 MinimizatonAttempts, 53859 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 762 NumberOfFragments, 21830 HoareAnnotationTreeSize, 98 FomulaSimplifications, 329891506 FormulaSimplificationTreeSizeReduction, 12835.7ms HoareSimplificationTime, 98 FomulaSimplificationsInter, 56359609 FormulaSimplificationTreeSizeReductionInter, 47880.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 281.1ms SsaConstructionTime, 856.2ms SatisfiabilityAnalysisTime, 8480.9ms InterpolantComputationTime, 5865 NumberOfCodeBlocks, 5865 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 5829 ConstructedInterpolants, 0 QuantifiedInterpolants, 19825 SizeOfPredicates, 54 NumberOfNonLiveVariables, 6570 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 36 InterpolantComputations, 23 PerfectInterpolantSequences, 1948/3153 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 924]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((1 <= c_m_lock && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d) || ((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((!(2 == s_run_pc) && c_req_a == 0) && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(c_req_type == 0))) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 695]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 1211]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && i == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) || ((((((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 51 <= \result) - InvariantResult [Line: 1203]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 1030]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((1 <= c_m_lock && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && a == 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d) || ((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0)) || (((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 1179]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) - InvariantResult [Line: 826]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) || ((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && req_a___0 + 50 <= rsp_d___0) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: (((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) && 0 <= a) || (((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && 51 <= s_memory1) && a == 1) && 2 == s_run_pc) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 1233]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((!(2 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 1276]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 1046]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1084]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && ((((!(s_run_st == 0) && s_run_pc == 0) && c_empty_req == 1) && m_run_pc == 3) || ((2 == s_run_pc && c_empty_req == 1) && m_run_pc == 3))) && s_memory0 <= 50) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && ((((!(s_run_st == 0) && s_run_pc == 0) && c_empty_req == 1) && m_run_pc == 3) || ((2 == s_run_pc && c_empty_req == 1) && m_run_pc == 3))) && 50 <= req_d) && c_req_d <= 50) && s_memory0 <= 50) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 <= a && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(req_type == 0)) && !(s_run_st == 0)) && 51 <= c_req_d) && a <= 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d) || (((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(req_type == 0)) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && req_a == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) && a + 50 <= c_req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 1195]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && i == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) || ((((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && 2 == s_run_pc) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) || (((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && a <= 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || (((((((((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && !(req_type == 0)) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((!(2 == s_run_pc) && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) - InvariantResult [Line: 1062]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 482]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) || ((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 6 <= m_run_pc) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= a) && 2 <= c_m_ev)) || (((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && 50 <= x) && 2 == s_run_pc) && req_a___0 + 50 <= rsp_d___0) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) - InvariantResult [Line: 807]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 <= a && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(req_type == 0)) && !(s_run_st == 0)) && 51 <= c_req_d) && a <= 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d) || (((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(req_type == 0)) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && req_a == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) && a + 50 <= c_req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) || ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((2 <= c_write_req_ev && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || ((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 1187]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && 2 <= c_m_ev) && m_run_pc == 0) && m_run_pc == s_run_pc) || (((((((c_req_a == 0 && !(s_run_st == 0)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && a == 1) && 50 <= x) && 2 == s_run_pc) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((((1 <= c_m_lock && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_m_ev) && 0 <= a - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) || (((((((((!(req_type == 0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0)) || ((((((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && 2 == s_run_pc) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || ((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((!(s_run_st == 0) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 997]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 51 <= \result)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: ((((((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || ((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) - InvariantResult [Line: 671]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && 0 <= a_t) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && 51 <= req_d)) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || ((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && m_run_st == 0) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && m_run_st == 0) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0))) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && m_run_st == 0) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || ((((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && m_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((!(req_type == 0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) || ((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0)) || (((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || (((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) || (((((((((!(req_type == 0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0)) || ((((((((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && req_a == 1) && !(s_run_st == 0)) && 50 <= c_req_d) && !(c_m_lock == 1)) && a == 1) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && req_d <= 51) && req_type == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && 51 <= req_d)) || ((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && !(c_m_lock == 1)) && req_d <= a + 50) && 2 == s_run_pc) && c_empty_req == 1) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || ((((2 == s_run_pc && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0))) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= c_req_d) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) - InvariantResult [Line: 1292]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 1268]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 1284]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && !(s_run_st == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev) && 0 <= a)) || (((((!(s_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || (((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || ((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= a_t) && !(s_run_st == 0)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((c_req_a == 0 && !(s_run_st == 0)) && s_run_pc == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(c_req_type == 0))) || (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 51 <= req_d) || (((((((((((((((((2 <= c_write_req_ev && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && !(c_m_lock == 1)) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 50 <= v) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) || (((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 51 <= s_memory1) && rsp_d <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && m_run_pc == 6) && 51 <= c_rsp_d) && 2 <= c_m_ev) && 51 <= \result) && c_rsp_d <= 51)) || (((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && c_rsp_d <= 50) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && \result <= 50) && 50 <= c_rsp_d) - InvariantResult [Line: 777]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && 49 + req_a___0 < rsp_d___0) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 6 <= m_run_pc) && 51 <= s_memory1) && !(c_m_lock == 1)) && 50 <= x) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && rsp_d___0 <= 50) && \result <= 50) && 50 <= c_rsp_d) || (((((((((((((((((((((((((((((((((51 <= rsp_d && c_req_type == 0) && 2 <= c_write_req_ev) && i == 1) && 1 <= a) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && \result <= 51) && req_tt_a == 1) && 6 <= m_run_pc) && 51 <= s_memory1) && rsp_d <= 51) && !(c_m_lock == 1)) && rsp_d___0 <= 51) && 2 == s_run_pc) && x <= 51) && c_empty_req == 1) && 51 <= x) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 51 <= c_rsp_d) && 51 <= rsp_d___0) && 51 <= \result) && c_rsp_d <= 51) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || (((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev)) || (((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && 2 <= c_m_ev)) || ((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && !(s_run_st == 0)) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && !(c_m_lock == 1)) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= a) && 2 <= c_m_ev) && 51 <= req_d - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((1 <= a && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(req_type == 0)) && !(s_run_st == 0)) && 51 <= c_req_d) && a <= 1) && req_d <= 50) && c_req_d <= 51) && 2 == s_run_pc) && 50 <= req_d) && req_d <= 51) && req_type == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && 50 <= v) && !(c_req_type == 0)) && 51 <= req_d) || (((((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && !(req_type == 0)) && !(s_run_st == 0)) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && 2 == s_run_pc) && req_type == 1) && 2 == c_write_rsp_ev) && req_a == 0) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a_t == 0) && 2 <= c_m_ev) && !(c_req_type == 0)) && a + 50 <= c_req_d)) || (((((((((c_req_a == 0 && !(req_type == 0)) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 0) && !(c_req_type == 0))) || (((((((((((((((c_req_a == 0 && 1 <= c_m_lock) && c_req_type == 1) && s_run_pc == 0) && a == 0) && a + 50 <= req_d) && req_d <= a + 50) && c_req_d <= a + 50) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && m_run_pc == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && 50 <= s_memory0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && c_req_type == 1) && 50 <= s_memory0) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && v <= 50) && 2 <= c_m_ev) && req_type == 1) && 50 <= v)) || ((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_d <= 51) && 51 <= c_req_d) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev && 1 <= a) && 1 <= c_m_lock) && c_req_type == 1) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && req_a == 1) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && c_req_d <= 51) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && v <= 50) && 2 <= c_m_ev) && 51 <= req_d) && req_type == 1) && 50 <= v) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 2 == s_run_pc) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((2 <= c_write_req_ev && c_req_a == 0) && 1 <= c_m_lock) && c_req_type == 1) && !(s_run_st == 0)) && s_run_pc == 0) && a == 0) && 50 <= c_req_d) && req_d <= 50) && 50 <= req_d) && c_empty_req == 1) && c_req_d <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && req_a == 0) && a_t == 0) && 2 <= c_m_ev) && req_type == 1)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 1 <= a) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && req_a == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 1) && 51 <= s_memory1) && 2 == s_run_pc) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 2 <= c_m_ev)) || ((((((((((((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_type == 0) && a == 0) && req_tt_a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && c_empty_req == 1) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && c_req_a == 1) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) || ((((((((((((((((((((c_req_type == 0 && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && a == 0) && 51 <= s_memory1) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) - InvariantResult [Line: 524]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= c_write_req_ev && 1 <= c_m_lock) && v <= 51) && 1 <= a_t) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && !(s_run_st == 0)) && req_d <= 51) && 51 <= c_req_d) && a == 0) && 51 <= s_memory1) && c_req_d <= 51) && 2 == s_run_pc) && 0 == req_a___0) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 2 <= c_m_ev) && 51 <= req_d) && req_type___0 == 0) || ((((((((((((((((((((((((((((((x <= 50 && c_req_type == 0) && 2 <= c_write_req_ev) && c_req_a == 0) && 1 <= c_m_lock) && v <= 51) && 50 <= rsp_d) && 50 <= s_memory0) && 51 <= v) && s_memory1 <= 51) && req_a___0 == 1) && !(s_run_st == 0)) && req_type == 0) && req_tt_a == 0) && 51 <= s_memory1) && a == 1) && 50 <= x) && 2 == s_run_pc) && rsp_d <= 50) && 50 <= \result) && s_memory0 <= 50) && 2 == c_write_rsp_ev) && c_rsp_d <= 50) && c_empty_rsp == 1) && req_a == 0) && m_run_pc == 6) && a_t == 0) && 2 <= c_m_ev) && req_type___0 == 0) && \result <= 50) && 50 <= c_rsp_d) RESULT: Ultimate proved your program to be correct! [2021-08-26 09:04:23,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...