./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 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan --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 Taipan --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.0-7b2dab5 [2020-12-09 05:33:40,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:33:40,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:33:40,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:33:40,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:33:40,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:33:40,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:33:40,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:33:40,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:33:40,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:33:40,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:33:40,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:33:40,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:33:40,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:33:40,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:33:40,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:33:40,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:33:40,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:33:40,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:33:40,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:33:40,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:33:40,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:33:40,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:33:40,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:33:40,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:33:40,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:33:40,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:33:40,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:33:40,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:33:40,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:33:40,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:33:40,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:33:40,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:33:40,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:33:40,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:33:40,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:33:40,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:33:40,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:33:40,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:33:40,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:33:40,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:33:40,518 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 05:33:40,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:33:40,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:33:40,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:33:40,540 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:33:40,541 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:33:40,541 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:33:40,541 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:33:40,541 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:33:40,541 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:33:40,541 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:33:40,542 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:33:40,542 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:33:40,542 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:33:40,542 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:33:40,542 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:33:40,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:33:40,543 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:33:40,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:33:40,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:33:40,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:33:40,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 05:33:40,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:33:40,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 05:33:40,544 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:33:40,545 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:33:40,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 05:33:40,545 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:33:40,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 05:33:40,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:33:40,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:33:40,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:33:40,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:33:40,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:33:40,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 05:33:40,546 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:33:40,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:33:40,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 05:33:40,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:33:40,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:33:40,547 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan 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 -> Taipan 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 [2020-12-09 05:33:40,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:33:40,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:33:40,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:33:40,755 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:33:40,755 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:33:40,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2020-12-09 05:33:40,796 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/data/a71450533/4dc294f49bf942d1a0924d84ae296f43/FLAG682ca73ef [2020-12-09 05:33:41,178 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:33:41,178 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2020-12-09 05:33:41,189 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/data/a71450533/4dc294f49bf942d1a0924d84ae296f43/FLAG682ca73ef [2020-12-09 05:33:41,198 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/data/a71450533/4dc294f49bf942d1a0924d84ae296f43 [2020-12-09 05:33:41,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:33:41,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:33:41,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:33:41,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:33:41,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:33:41,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae6c787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41, skipping insertion in model container [2020-12-09 05:33:41,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:33:41,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:33:41,362 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2020-12-09 05:33:41,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:33:41,437 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:33:41,444 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[341,354] [2020-12-09 05:33:41,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:33:41,499 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:33:41,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41 WrapperNode [2020-12-09 05:33:41,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:33:41,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:33:41,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:33:41,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:33:41,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:33:41,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:33:41,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:33:41,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:33:41,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... [2020-12-09 05:33:41,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:33:41,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:33:41,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:33:41,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:33:41,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:33:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 05:33:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:33:41,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:33:41,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:33:42,539 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:33:42,540 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2020-12-09 05:33:42,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:33:42 BoogieIcfgContainer [2020-12-09 05:33:42,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:33:42,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:33:42,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:33:42,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:33:42,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:33:41" (1/3) ... [2020-12-09 05:33:42,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3047667e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:33:42, skipping insertion in model container [2020-12-09 05:33:42,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:33:41" (2/3) ... [2020-12-09 05:33:42,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3047667e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:33:42, skipping insertion in model container [2020-12-09 05:33:42,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:33:42" (3/3) ... [2020-12-09 05:33:42,547 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2020-12-09 05:33:42,557 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:33:42,559 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-09 05:33:42,566 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-09 05:33:42,584 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:33:42,584 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 05:33:42,584 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:33:42,585 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:33:42,585 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:33:42,585 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:33:42,585 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:33:42,585 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:33:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2020-12-09 05:33:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:33:42,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:42,605 INFO L422 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] [2020-12-09 05:33:42,605 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:42,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash 981738311, now seen corresponding path program 1 times [2020-12-09 05:33:42,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:42,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289030675] [2020-12-09 05:33:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:42,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289030675] [2020-12-09 05:33:42,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:42,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:33:42,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242891211] [2020-12-09 05:33:42,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:42,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:42,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:42,748 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2020-12-09 05:33:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:43,008 INFO L93 Difference]: Finished difference Result 614 states and 1058 transitions. [2020-12-09 05:33:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:43,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-09 05:33:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:43,020 INFO L225 Difference]: With dead ends: 614 [2020-12-09 05:33:43,020 INFO L226 Difference]: Without dead ends: 385 [2020-12-09 05:33:43,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-12-09 05:33:43,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 375. [2020-12-09 05:33:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-12-09 05:33:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 564 transitions. [2020-12-09 05:33:43,072 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 564 transitions. Word has length 23 [2020-12-09 05:33:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:43,072 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 564 transitions. [2020-12-09 05:33:43,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 564 transitions. [2020-12-09 05:33:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 05:33:43,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:43,074 INFO L422 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] [2020-12-09 05:33:43,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:33:43,074 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:43,075 INFO L82 PathProgramCache]: Analyzing trace with hash -572745796, now seen corresponding path program 1 times [2020-12-09 05:33:43,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:43,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867558300] [2020-12-09 05:33:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:43,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867558300] [2020-12-09 05:33:43,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:43,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:33:43,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840695903] [2020-12-09 05:33:43,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:43,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:43,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,120 INFO L87 Difference]: Start difference. First operand 375 states and 564 transitions. Second operand 3 states. [2020-12-09 05:33:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:43,233 INFO L93 Difference]: Finished difference Result 971 states and 1486 transitions. [2020-12-09 05:33:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:43,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-09 05:33:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:43,237 INFO L225 Difference]: With dead ends: 971 [2020-12-09 05:33:43,237 INFO L226 Difference]: Without dead ends: 606 [2020-12-09 05:33:43,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-12-09 05:33:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 596. [2020-12-09 05:33:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-12-09 05:33:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 924 transitions. [2020-12-09 05:33:43,269 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 924 transitions. Word has length 33 [2020-12-09 05:33:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:43,269 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 924 transitions. [2020-12-09 05:33:43,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 924 transitions. [2020-12-09 05:33:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 05:33:43,272 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:43,272 INFO L422 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] [2020-12-09 05:33:43,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:33:43,272 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:43,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1339119579, now seen corresponding path program 1 times [2020-12-09 05:33:43,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:43,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075666495] [2020-12-09 05:33:43,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:43,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075666495] [2020-12-09 05:33:43,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:43,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:33:43,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180846627] [2020-12-09 05:33:43,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:43,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:43,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:43,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,330 INFO L87 Difference]: Start difference. First operand 596 states and 924 transitions. Second operand 3 states. [2020-12-09 05:33:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:43,374 INFO L93 Difference]: Finished difference Result 1518 states and 2361 transitions. [2020-12-09 05:33:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:43,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-12-09 05:33:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:43,379 INFO L225 Difference]: With dead ends: 1518 [2020-12-09 05:33:43,379 INFO L226 Difference]: Without dead ends: 932 [2020-12-09 05:33:43,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2020-12-09 05:33:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 920. [2020-12-09 05:33:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2020-12-09 05:33:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1430 transitions. [2020-12-09 05:33:43,415 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1430 transitions. Word has length 34 [2020-12-09 05:33:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:43,415 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1430 transitions. [2020-12-09 05:33:43,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1430 transitions. [2020-12-09 05:33:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-09 05:33:43,417 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:43,417 INFO L422 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] [2020-12-09 05:33:43,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:33:43,417 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1349724942, now seen corresponding path program 1 times [2020-12-09 05:33:43,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:43,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270577220] [2020-12-09 05:33:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:43,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270577220] [2020-12-09 05:33:43,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:43,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:33:43,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713269380] [2020-12-09 05:33:43,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:43,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:43,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:43,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,461 INFO L87 Difference]: Start difference. First operand 920 states and 1430 transitions. Second operand 3 states. [2020-12-09 05:33:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:43,518 INFO L93 Difference]: Finished difference Result 2462 states and 3842 transitions. [2020-12-09 05:33:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:43,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-09 05:33:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:43,525 INFO L225 Difference]: With dead ends: 2462 [2020-12-09 05:33:43,525 INFO L226 Difference]: Without dead ends: 1552 [2020-12-09 05:33:43,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2020-12-09 05:33:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1450. [2020-12-09 05:33:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-12-09 05:33:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2246 transitions. [2020-12-09 05:33:43,577 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2246 transitions. Word has length 39 [2020-12-09 05:33:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:43,577 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 2246 transitions. [2020-12-09 05:33:43,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2246 transitions. [2020-12-09 05:33:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 05:33:43,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:43,578 INFO L422 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] [2020-12-09 05:33:43,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 05:33:43,579 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1955414570, now seen corresponding path program 1 times [2020-12-09 05:33:43,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:43,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226355533] [2020-12-09 05:33:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:43,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226355533] [2020-12-09 05:33:43,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:43,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:33:43,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077434847] [2020-12-09 05:33:43,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:43,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:43,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,618 INFO L87 Difference]: Start difference. First operand 1450 states and 2246 transitions. Second operand 3 states. [2020-12-09 05:33:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:43,750 INFO L93 Difference]: Finished difference Result 4133 states and 6387 transitions. [2020-12-09 05:33:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:43,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-09 05:33:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:43,762 INFO L225 Difference]: With dead ends: 4133 [2020-12-09 05:33:43,762 INFO L226 Difference]: Without dead ends: 2691 [2020-12-09 05:33:43,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2020-12-09 05:33:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2635. [2020-12-09 05:33:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2020-12-09 05:33:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4016 transitions. [2020-12-09 05:33:43,854 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4016 transitions. Word has length 47 [2020-12-09 05:33:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:43,854 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 4016 transitions. [2020-12-09 05:33:43,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4016 transitions. [2020-12-09 05:33:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-09 05:33:43,855 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:43,856 INFO L422 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] [2020-12-09 05:33:43,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 05:33:43,856 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash 261284323, now seen corresponding path program 1 times [2020-12-09 05:33:43,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:43,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962020213] [2020-12-09 05:33:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:43,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962020213] [2020-12-09 05:33:43,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:43,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:33:43,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605403774] [2020-12-09 05:33:43,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:43,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:43,892 INFO L87 Difference]: Start difference. First operand 2635 states and 4016 transitions. Second operand 3 states. [2020-12-09 05:33:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:44,010 INFO L93 Difference]: Finished difference Result 6183 states and 9387 transitions. [2020-12-09 05:33:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:44,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-12-09 05:33:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:44,025 INFO L225 Difference]: With dead ends: 6183 [2020-12-09 05:33:44,025 INFO L226 Difference]: Without dead ends: 3557 [2020-12-09 05:33:44,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2020-12-09 05:33:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3409. [2020-12-09 05:33:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2020-12-09 05:33:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 5134 transitions. [2020-12-09 05:33:44,158 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 5134 transitions. Word has length 47 [2020-12-09 05:33:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:44,158 INFO L481 AbstractCegarLoop]: Abstraction has 3409 states and 5134 transitions. [2020-12-09 05:33:44,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 5134 transitions. [2020-12-09 05:33:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-09 05:33:44,159 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:44,160 INFO L422 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] [2020-12-09 05:33:44,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 05:33:44,160 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:44,160 INFO L82 PathProgramCache]: Analyzing trace with hash -499127057, now seen corresponding path program 1 times [2020-12-09 05:33:44,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:44,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402967739] [2020-12-09 05:33:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:44,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402967739] [2020-12-09 05:33:44,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:44,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:33:44,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249421159] [2020-12-09 05:33:44,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:44,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:44,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:44,193 INFO L87 Difference]: Start difference. First operand 3409 states and 5134 transitions. Second operand 3 states. [2020-12-09 05:33:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:44,560 INFO L93 Difference]: Finished difference Result 8237 states and 12444 transitions. [2020-12-09 05:33:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:44,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-12-09 05:33:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:44,580 INFO L225 Difference]: With dead ends: 8237 [2020-12-09 05:33:44,581 INFO L226 Difference]: Without dead ends: 4837 [2020-12-09 05:33:44,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2020-12-09 05:33:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4758. [2020-12-09 05:33:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4758 states. [2020-12-09 05:33:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 7019 transitions. [2020-12-09 05:33:44,734 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 7019 transitions. Word has length 51 [2020-12-09 05:33:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:44,735 INFO L481 AbstractCegarLoop]: Abstraction has 4758 states and 7019 transitions. [2020-12-09 05:33:44,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 7019 transitions. [2020-12-09 05:33:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-09 05:33:44,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:44,736 INFO L422 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] [2020-12-09 05:33:44,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 05:33:44,736 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:44,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1604347203, now seen corresponding path program 1 times [2020-12-09 05:33:44,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:44,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631188645] [2020-12-09 05:33:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:44,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631188645] [2020-12-09 05:33:44,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:44,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:33:44,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525502324] [2020-12-09 05:33:44,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:44,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:44,772 INFO L87 Difference]: Start difference. First operand 4758 states and 7019 transitions. Second operand 3 states. [2020-12-09 05:33:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:44,991 INFO L93 Difference]: Finished difference Result 9507 states and 14029 transitions. [2020-12-09 05:33:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:44,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-09 05:33:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:45,011 INFO L225 Difference]: With dead ends: 9507 [2020-12-09 05:33:45,011 INFO L226 Difference]: Without dead ends: 4758 [2020-12-09 05:33:45,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2020-12-09 05:33:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4758. [2020-12-09 05:33:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4758 states. [2020-12-09 05:33:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6947 transitions. [2020-12-09 05:33:45,180 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6947 transitions. Word has length 53 [2020-12-09 05:33:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:45,180 INFO L481 AbstractCegarLoop]: Abstraction has 4758 states and 6947 transitions. [2020-12-09 05:33:45,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6947 transitions. [2020-12-09 05:33:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 05:33:45,181 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:45,181 INFO L422 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] [2020-12-09 05:33:45,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 05:33:45,181 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:45,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:45,182 INFO L82 PathProgramCache]: Analyzing trace with hash 453068530, now seen corresponding path program 1 times [2020-12-09 05:33:45,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:45,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976450952] [2020-12-09 05:33:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:45,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976450952] [2020-12-09 05:33:45,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:45,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:33:45,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583272759] [2020-12-09 05:33:45,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:45,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:45,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:45,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:45,210 INFO L87 Difference]: Start difference. First operand 4758 states and 6947 transitions. Second operand 3 states. [2020-12-09 05:33:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:45,551 INFO L93 Difference]: Finished difference Result 10806 states and 15747 transitions. [2020-12-09 05:33:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:45,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-09 05:33:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:45,574 INFO L225 Difference]: With dead ends: 10806 [2020-12-09 05:33:45,575 INFO L226 Difference]: Without dead ends: 6057 [2020-12-09 05:33:45,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-12-09 05:33:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 5971. [2020-12-09 05:33:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5971 states. [2020-12-09 05:33:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5971 states to 5971 states and 8478 transitions. [2020-12-09 05:33:45,724 INFO L78 Accepts]: Start accepts. Automaton has 5971 states and 8478 transitions. Word has length 54 [2020-12-09 05:33:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:45,724 INFO L481 AbstractCegarLoop]: Abstraction has 5971 states and 8478 transitions. [2020-12-09 05:33:45,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5971 states and 8478 transitions. [2020-12-09 05:33:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-09 05:33:45,726 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:45,726 INFO L422 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] [2020-12-09 05:33:45,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 05:33:45,726 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:45,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:45,726 INFO L82 PathProgramCache]: Analyzing trace with hash 131438461, now seen corresponding path program 1 times [2020-12-09 05:33:45,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:45,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581148935] [2020-12-09 05:33:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:45,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581148935] [2020-12-09 05:33:45,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:45,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:33:45,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770591936] [2020-12-09 05:33:45,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:33:45,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:45,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:33:45,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:33:45,785 INFO L87 Difference]: Start difference. First operand 5971 states and 8478 transitions. Second operand 7 states. [2020-12-09 05:33:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:46,642 INFO L93 Difference]: Finished difference Result 31037 states and 43978 transitions. [2020-12-09 05:33:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 05:33:46,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-12-09 05:33:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:46,690 INFO L225 Difference]: With dead ends: 31037 [2020-12-09 05:33:46,690 INFO L226 Difference]: Without dead ends: 25075 [2020-12-09 05:33:46,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2020-12-09 05:33:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25075 states. [2020-12-09 05:33:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25075 to 8283. [2020-12-09 05:33:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8283 states. [2020-12-09 05:33:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 11686 transitions. [2020-12-09 05:33:47,015 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 11686 transitions. Word has length 56 [2020-12-09 05:33:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:47,015 INFO L481 AbstractCegarLoop]: Abstraction has 8283 states and 11686 transitions. [2020-12-09 05:33:47,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:33:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 11686 transitions. [2020-12-09 05:33:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 05:33:47,018 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:47,018 INFO L422 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] [2020-12-09 05:33:47,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 05:33:47,018 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1988795820, now seen corresponding path program 1 times [2020-12-09 05:33:47,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:47,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839042353] [2020-12-09 05:33:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:47,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839042353] [2020-12-09 05:33:47,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:47,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:33:47,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764631964] [2020-12-09 05:33:47,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:47,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:47,047 INFO L87 Difference]: Start difference. First operand 8283 states and 11686 transitions. Second operand 3 states. [2020-12-09 05:33:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:47,381 INFO L93 Difference]: Finished difference Result 15754 states and 22344 transitions. [2020-12-09 05:33:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:47,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-12-09 05:33:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:47,393 INFO L225 Difference]: With dead ends: 15754 [2020-12-09 05:33:47,393 INFO L226 Difference]: Without dead ends: 7480 [2020-12-09 05:33:47,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7480 states. [2020-12-09 05:33:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7480 to 5004. [2020-12-09 05:33:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5004 states. [2020-12-09 05:33:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 7018 transitions. [2020-12-09 05:33:47,588 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 7018 transitions. Word has length 57 [2020-12-09 05:33:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:47,589 INFO L481 AbstractCegarLoop]: Abstraction has 5004 states and 7018 transitions. [2020-12-09 05:33:47,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 7018 transitions. [2020-12-09 05:33:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-09 05:33:47,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:47,589 INFO L422 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] [2020-12-09 05:33:47,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 05:33:47,590 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:47,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash -201349225, now seen corresponding path program 1 times [2020-12-09 05:33:47,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:47,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903479357] [2020-12-09 05:33:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:47,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903479357] [2020-12-09 05:33:47,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:47,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 05:33:47,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058395129] [2020-12-09 05:33:47,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:33:47,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:47,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:33:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:33:47,630 INFO L87 Difference]: Start difference. First operand 5004 states and 7018 transitions. Second operand 7 states. [2020-12-09 05:33:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:49,034 INFO L93 Difference]: Finished difference Result 34306 states and 48291 transitions. [2020-12-09 05:33:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-09 05:33:49,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2020-12-09 05:33:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:49,067 INFO L225 Difference]: With dead ends: 34306 [2020-12-09 05:33:49,067 INFO L226 Difference]: Without dead ends: 29416 [2020-12-09 05:33:49,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2020-12-09 05:33:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29416 states. [2020-12-09 05:33:49,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29416 to 5316. [2020-12-09 05:33:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2020-12-09 05:33:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 7420 transitions. [2020-12-09 05:33:49,439 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 7420 transitions. Word has length 57 [2020-12-09 05:33:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:49,439 INFO L481 AbstractCegarLoop]: Abstraction has 5316 states and 7420 transitions. [2020-12-09 05:33:49,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:33:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 7420 transitions. [2020-12-09 05:33:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-09 05:33:49,440 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:49,440 INFO L422 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] [2020-12-09 05:33:49,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 05:33:49,440 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 129014757, now seen corresponding path program 1 times [2020-12-09 05:33:49,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:49,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930372498] [2020-12-09 05:33:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:49,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930372498] [2020-12-09 05:33:49,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:49,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:33:49,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296573681] [2020-12-09 05:33:49,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:49,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:49,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:49,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:49,462 INFO L87 Difference]: Start difference. First operand 5316 states and 7420 transitions. Second operand 3 states. [2020-12-09 05:33:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:49,760 INFO L93 Difference]: Finished difference Result 11216 states and 15607 transitions. [2020-12-09 05:33:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:49,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-09 05:33:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:49,765 INFO L225 Difference]: With dead ends: 11216 [2020-12-09 05:33:49,765 INFO L226 Difference]: Without dead ends: 5929 [2020-12-09 05:33:49,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5929 states. [2020-12-09 05:33:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5929 to 5361. [2020-12-09 05:33:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5361 states. [2020-12-09 05:33:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5361 states to 5361 states and 7472 transitions. [2020-12-09 05:33:49,993 INFO L78 Accepts]: Start accepts. Automaton has 5361 states and 7472 transitions. Word has length 70 [2020-12-09 05:33:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:49,993 INFO L481 AbstractCegarLoop]: Abstraction has 5361 states and 7472 transitions. [2020-12-09 05:33:49,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5361 states and 7472 transitions. [2020-12-09 05:33:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-09 05:33:49,994 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:49,994 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:33:49,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 05:33:49,994 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2006087937, now seen corresponding path program 1 times [2020-12-09 05:33:49,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:49,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530285416] [2020-12-09 05:33:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:50,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530285416] [2020-12-09 05:33:50,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:50,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:33:50,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985698801] [2020-12-09 05:33:50,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:33:50,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:33:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:33:50,018 INFO L87 Difference]: Start difference. First operand 5361 states and 7472 transitions. Second operand 4 states. [2020-12-09 05:33:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:50,449 INFO L93 Difference]: Finished difference Result 12823 states and 17811 transitions. [2020-12-09 05:33:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:33:50,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-09 05:33:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:50,455 INFO L225 Difference]: With dead ends: 12823 [2020-12-09 05:33:50,455 INFO L226 Difference]: Without dead ends: 7414 [2020-12-09 05:33:50,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:33:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7414 states. [2020-12-09 05:33:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7414 to 6128. [2020-12-09 05:33:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6128 states. [2020-12-09 05:33:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6128 states to 6128 states and 8473 transitions. [2020-12-09 05:33:50,762 INFO L78 Accepts]: Start accepts. Automaton has 6128 states and 8473 transitions. Word has length 80 [2020-12-09 05:33:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:50,762 INFO L481 AbstractCegarLoop]: Abstraction has 6128 states and 8473 transitions. [2020-12-09 05:33:50,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:33:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6128 states and 8473 transitions. [2020-12-09 05:33:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-09 05:33:50,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:50,763 INFO L422 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] [2020-12-09 05:33:50,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 05:33:50,763 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash -886917688, now seen corresponding path program 1 times [2020-12-09 05:33:50,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:50,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185235495] [2020-12-09 05:33:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:50,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185235495] [2020-12-09 05:33:50,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:50,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:33:50,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132222438] [2020-12-09 05:33:50,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:50,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:50,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:50,791 INFO L87 Difference]: Start difference. First operand 6128 states and 8473 transitions. Second operand 3 states. [2020-12-09 05:33:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:50,983 INFO L93 Difference]: Finished difference Result 8989 states and 12523 transitions. [2020-12-09 05:33:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:50,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-12-09 05:33:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:50,986 INFO L225 Difference]: With dead ends: 8989 [2020-12-09 05:33:50,986 INFO L226 Difference]: Without dead ends: 2827 [2020-12-09 05:33:50,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:33:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2020-12-09 05:33:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2791. [2020-12-09 05:33:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2020-12-09 05:33:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3717 transitions. [2020-12-09 05:33:51,115 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3717 transitions. Word has length 85 [2020-12-09 05:33:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:51,115 INFO L481 AbstractCegarLoop]: Abstraction has 2791 states and 3717 transitions. [2020-12-09 05:33:51,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3717 transitions. [2020-12-09 05:33:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-09 05:33:51,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:51,116 INFO L422 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] [2020-12-09 05:33:51,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 05:33:51,116 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1993133126, now seen corresponding path program 1 times [2020-12-09 05:33:51,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:51,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18188359] [2020-12-09 05:33:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:51,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18188359] [2020-12-09 05:33:51,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:33:51,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:33:51,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700783663] [2020-12-09 05:33:51,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:33:51,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:51,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:33:51,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:33:51,148 INFO L87 Difference]: Start difference. First operand 2791 states and 3717 transitions. Second operand 5 states. [2020-12-09 05:33:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:51,797 INFO L93 Difference]: Finished difference Result 11181 states and 15030 transitions. [2020-12-09 05:33:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:33:51,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2020-12-09 05:33:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:51,804 INFO L225 Difference]: With dead ends: 11181 [2020-12-09 05:33:51,805 INFO L226 Difference]: Without dead ends: 8508 [2020-12-09 05:33:51,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:33:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2020-12-09 05:33:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 2793. [2020-12-09 05:33:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2793 states. [2020-12-09 05:33:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 3711 transitions. [2020-12-09 05:33:52,025 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 3711 transitions. Word has length 90 [2020-12-09 05:33:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:52,025 INFO L481 AbstractCegarLoop]: Abstraction has 2793 states and 3711 transitions. [2020-12-09 05:33:52,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:33:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3711 transitions. [2020-12-09 05:33:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-09 05:33:52,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:52,026 INFO L422 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] [2020-12-09 05:33:52,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 05:33:52,026 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:52,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash -988046987, now seen corresponding path program 1 times [2020-12-09 05:33:52,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:52,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321905777] [2020-12-09 05:33:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:52,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321905777] [2020-12-09 05:33:52,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817167551] [2020-12-09 05:33:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:33:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:52,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:33:52,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:33:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:52,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:33:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:52,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:33:52,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2020-12-09 05:33:52,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569939798] [2020-12-09 05:33:52,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:52,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:33:52,337 INFO L87 Difference]: Start difference. First operand 2793 states and 3711 transitions. Second operand 3 states. [2020-12-09 05:33:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:52,513 INFO L93 Difference]: Finished difference Result 2811 states and 3725 transitions. [2020-12-09 05:33:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:52,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-09 05:33:52,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:52,515 INFO L225 Difference]: With dead ends: 2811 [2020-12-09 05:33:52,515 INFO L226 Difference]: Without dead ends: 2807 [2020-12-09 05:33:52,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:33:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2020-12-09 05:33:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2793. [2020-12-09 05:33:52,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2793 states. [2020-12-09 05:33:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 3696 transitions. [2020-12-09 05:33:52,672 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 3696 transitions. Word has length 92 [2020-12-09 05:33:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:52,672 INFO L481 AbstractCegarLoop]: Abstraction has 2793 states and 3696 transitions. [2020-12-09 05:33:52,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3696 transitions. [2020-12-09 05:33:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-09 05:33:52,673 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:52,674 INFO L422 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] [2020-12-09 05:33:52,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-09 05:33:52,875 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash -829603657, now seen corresponding path program 1 times [2020-12-09 05:33:52,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:52,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121363581] [2020-12-09 05:33:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:33:52,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121363581] [2020-12-09 05:33:52,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139902786] [2020-12-09 05:33:52,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:33:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:53,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:33:53,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:33:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:53,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:33:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:53,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:33:53,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2020-12-09 05:33:53,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074881703] [2020-12-09 05:33:53,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:53,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:33:53,188 INFO L87 Difference]: Start difference. First operand 2793 states and 3696 transitions. Second operand 3 states. [2020-12-09 05:33:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:53,361 INFO L93 Difference]: Finished difference Result 5446 states and 7240 transitions. [2020-12-09 05:33:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:53,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-09 05:33:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:53,364 INFO L225 Difference]: With dead ends: 5446 [2020-12-09 05:33:53,364 INFO L226 Difference]: Without dead ends: 2793 [2020-12-09 05:33:53,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:33:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2020-12-09 05:33:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2793. [2020-12-09 05:33:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2793 states. [2020-12-09 05:33:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 3608 transitions. [2020-12-09 05:33:53,517 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 3608 transitions. Word has length 145 [2020-12-09 05:33:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:53,518 INFO L481 AbstractCegarLoop]: Abstraction has 2793 states and 3608 transitions. [2020-12-09 05:33:53,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3608 transitions. [2020-12-09 05:33:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-09 05:33:53,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:53,519 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:33:53,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-09 05:33:53,720 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1106829010, now seen corresponding path program 1 times [2020-12-09 05:33:53,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:53,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44514706] [2020-12-09 05:33:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:53,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44514706] [2020-12-09 05:33:53,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145263990] [2020-12-09 05:33:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:33:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:53,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:33:53,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:33:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 05:33:53,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:33:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 05:33:54,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:33:54,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2020-12-09 05:33:54,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783712866] [2020-12-09 05:33:54,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:33:54,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:33:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:33:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:33:54,032 INFO L87 Difference]: Start difference. First operand 2793 states and 3608 transitions. Second operand 3 states. [2020-12-09 05:33:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:33:54,223 INFO L93 Difference]: Finished difference Result 5446 states and 7064 transitions. [2020-12-09 05:33:54,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:33:54,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2020-12-09 05:33:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:33:54,225 INFO L225 Difference]: With dead ends: 5446 [2020-12-09 05:33:54,226 INFO L226 Difference]: Without dead ends: 2793 [2020-12-09 05:33:54,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:33:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2020-12-09 05:33:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2793. [2020-12-09 05:33:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2793 states. [2020-12-09 05:33:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 3558 transitions. [2020-12-09 05:33:54,382 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 3558 transitions. Word has length 148 [2020-12-09 05:33:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:33:54,382 INFO L481 AbstractCegarLoop]: Abstraction has 2793 states and 3558 transitions. [2020-12-09 05:33:54,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:33:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3558 transitions. [2020-12-09 05:33:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-09 05:33:54,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:33:54,383 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:33:54,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:33:54,585 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:33:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:33:54,586 INFO L82 PathProgramCache]: Analyzing trace with hash 33164250, now seen corresponding path program 1 times [2020-12-09 05:33:54,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:33:54,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448137738] [2020-12-09 05:33:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:33:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:54,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448137738] [2020-12-09 05:33:54,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775200961] [2020-12-09 05:33:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:33:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:33:54,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 05:33:54,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:33:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:54,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:33:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 05:33:55,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [678573708] [2020-12-09 05:33:55,080 INFO L159 IcfgInterpreter]: Started Sifa with 102 locations of interest [2020-12-09 05:33:55,080 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:33:55,084 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:33:55,089 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:33:55,089 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:34:02,169 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 278 [2020-12-09 05:34:02,965 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 288 [2020-12-09 05:34:03,444 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 333 [2020-12-09 05:34:04,851 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 359 [2020-12-09 05:34:05,210 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 330 [2020-12-09 05:34:08,906 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:34:08,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:34:08,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2020-12-09 05:34:08,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849449043] [2020-12-09 05:34:08,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:34:08,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:08,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:34:08,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:34:08,909 INFO L87 Difference]: Start difference. First operand 2793 states and 3558 transitions. Second operand 10 states. [2020-12-09 05:34:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:10,243 INFO L93 Difference]: Finished difference Result 16338 states and 20948 transitions. [2020-12-09 05:34:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 05:34:10,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2020-12-09 05:34:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:10,274 INFO L225 Difference]: With dead ends: 16338 [2020-12-09 05:34:10,274 INFO L226 Difference]: Without dead ends: 13685 [2020-12-09 05:34:10,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 307 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=1211, Unknown=0, NotChecked=0, Total=1482 [2020-12-09 05:34:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13685 states. [2020-12-09 05:34:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13685 to 4293. [2020-12-09 05:34:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4293 states. [2020-12-09 05:34:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5527 transitions. [2020-12-09 05:34:10,643 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5527 transitions. Word has length 148 [2020-12-09 05:34:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:10,643 INFO L481 AbstractCegarLoop]: Abstraction has 4293 states and 5527 transitions. [2020-12-09 05:34:10,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:34:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5527 transitions. [2020-12-09 05:34:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2020-12-09 05:34:10,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:10,646 INFO L422 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:34:10,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:34:10,848 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash -480410551, now seen corresponding path program 1 times [2020-12-09 05:34:10,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:10,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313211640] [2020-12-09 05:34:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 96 proven. 97 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 05:34:11,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313211640] [2020-12-09 05:34:11,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991297457] [2020-12-09 05:34:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:34:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:11,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:34:11,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:34:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 05:34:11,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:34:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 05:34:11,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:34:11,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 9 [2020-12-09 05:34:11,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689092501] [2020-12-09 05:34:11,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:34:11,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:11,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:34:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:34:11,501 INFO L87 Difference]: Start difference. First operand 4293 states and 5527 transitions. Second operand 7 states. [2020-12-09 05:34:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:12,035 INFO L93 Difference]: Finished difference Result 9198 states and 11846 transitions. [2020-12-09 05:34:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:34:12,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2020-12-09 05:34:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:12,039 INFO L225 Difference]: With dead ends: 9198 [2020-12-09 05:34:12,040 INFO L226 Difference]: Without dead ends: 5042 [2020-12-09 05:34:12,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:34:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states. [2020-12-09 05:34:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 4184. [2020-12-09 05:34:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4184 states. [2020-12-09 05:34:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 5386 transitions. [2020-12-09 05:34:12,347 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 5386 transitions. Word has length 241 [2020-12-09 05:34:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:12,348 INFO L481 AbstractCegarLoop]: Abstraction has 4184 states and 5386 transitions. [2020-12-09 05:34:12,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:34:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 5386 transitions. [2020-12-09 05:34:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-12-09 05:34:12,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:12,350 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:34:12,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable205 [2020-12-09 05:34:12,551 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 215957626, now seen corresponding path program 1 times [2020-12-09 05:34:12,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:12,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676694649] [2020-12-09 05:34:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-09 05:34:12,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676694649] [2020-12-09 05:34:12,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:34:12,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:34:12,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119127564] [2020-12-09 05:34:12,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:34:12,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:12,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:34:12,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:34:12,650 INFO L87 Difference]: Start difference. First operand 4184 states and 5386 transitions. Second operand 3 states. [2020-12-09 05:34:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:13,208 INFO L93 Difference]: Finished difference Result 9234 states and 11975 transitions. [2020-12-09 05:34:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:34:13,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2020-12-09 05:34:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:13,214 INFO L225 Difference]: With dead ends: 9234 [2020-12-09 05:34:13,215 INFO L226 Difference]: Without dead ends: 5190 [2020-12-09 05:34:13,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:34:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2020-12-09 05:34:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 4962. [2020-12-09 05:34:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4962 states. [2020-12-09 05:34:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 6311 transitions. [2020-12-09 05:34:13,588 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 6311 transitions. Word has length 242 [2020-12-09 05:34:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:13,588 INFO L481 AbstractCegarLoop]: Abstraction has 4962 states and 6311 transitions. [2020-12-09 05:34:13,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:34:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 6311 transitions. [2020-12-09 05:34:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2020-12-09 05:34:13,590 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:13,590 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:34:13,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2020-12-09 05:34:13,590 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash -743254776, now seen corresponding path program 1 times [2020-12-09 05:34:13,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:13,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025554055] [2020-12-09 05:34:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-09 05:34:13,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025554055] [2020-12-09 05:34:13,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:34:13,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 05:34:13,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620288038] [2020-12-09 05:34:13,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:34:13,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:34:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:34:13,669 INFO L87 Difference]: Start difference. First operand 4962 states and 6311 transitions. Second operand 7 states. [2020-12-09 05:34:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:15,700 INFO L93 Difference]: Finished difference Result 26471 states and 34048 transitions. [2020-12-09 05:34:15,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-09 05:34:15,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 242 [2020-12-09 05:34:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:15,717 INFO L225 Difference]: With dead ends: 26471 [2020-12-09 05:34:15,717 INFO L226 Difference]: Without dead ends: 21644 [2020-12-09 05:34:15,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2020-12-09 05:34:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21644 states. [2020-12-09 05:34:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21644 to 5414. [2020-12-09 05:34:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5414 states. [2020-12-09 05:34:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 6901 transitions. [2020-12-09 05:34:16,222 INFO L78 Accepts]: Start accepts. Automaton has 5414 states and 6901 transitions. Word has length 242 [2020-12-09 05:34:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:16,223 INFO L481 AbstractCegarLoop]: Abstraction has 5414 states and 6901 transitions. [2020-12-09 05:34:16,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:34:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5414 states and 6901 transitions. [2020-12-09 05:34:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-12-09 05:34:16,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:16,224 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:34:16,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2020-12-09 05:34:16,225 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1547035796, now seen corresponding path program 1 times [2020-12-09 05:34:16,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:16,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063977259] [2020-12-09 05:34:16,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-12-09 05:34:16,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063977259] [2020-12-09 05:34:16,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:34:16,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:34:16,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131626223] [2020-12-09 05:34:16,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:34:16,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:34:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:34:16,292 INFO L87 Difference]: Start difference. First operand 5414 states and 6901 transitions. Second operand 5 states. [2020-12-09 05:34:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:17,613 INFO L93 Difference]: Finished difference Result 18827 states and 24061 transitions. [2020-12-09 05:34:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:34:17,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2020-12-09 05:34:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:17,623 INFO L225 Difference]: With dead ends: 18827 [2020-12-09 05:34:17,623 INFO L226 Difference]: Without dead ends: 13548 [2020-12-09 05:34:17,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:34:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13548 states. [2020-12-09 05:34:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13548 to 5947. [2020-12-09 05:34:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5947 states. [2020-12-09 05:34:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5947 states to 5947 states and 7571 transitions. [2020-12-09 05:34:18,173 INFO L78 Accepts]: Start accepts. Automaton has 5947 states and 7571 transitions. Word has length 243 [2020-12-09 05:34:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:18,173 INFO L481 AbstractCegarLoop]: Abstraction has 5947 states and 7571 transitions. [2020-12-09 05:34:18,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:34:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 5947 states and 7571 transitions. [2020-12-09 05:34:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-09 05:34:18,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:18,176 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:34:18,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2020-12-09 05:34:18,176 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash 512874240, now seen corresponding path program 1 times [2020-12-09 05:34:18,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:18,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555005177] [2020-12-09 05:34:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-12-09 05:34:18,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555005177] [2020-12-09 05:34:18,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:34:18,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:34:18,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143675990] [2020-12-09 05:34:18,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:34:18,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:34:18,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:34:18,243 INFO L87 Difference]: Start difference. First operand 5947 states and 7571 transitions. Second operand 3 states. [2020-12-09 05:34:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:19,004 INFO L93 Difference]: Finished difference Result 13747 states and 17556 transitions. [2020-12-09 05:34:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:34:19,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2020-12-09 05:34:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:19,010 INFO L225 Difference]: With dead ends: 13747 [2020-12-09 05:34:19,010 INFO L226 Difference]: Without dead ends: 7935 [2020-12-09 05:34:19,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:34:19,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2020-12-09 05:34:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 7885. [2020-12-09 05:34:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7885 states. [2020-12-09 05:34:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7885 states to 7885 states and 9940 transitions. [2020-12-09 05:34:19,731 INFO L78 Accepts]: Start accepts. Automaton has 7885 states and 9940 transitions. Word has length 279 [2020-12-09 05:34:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:19,731 INFO L481 AbstractCegarLoop]: Abstraction has 7885 states and 9940 transitions. [2020-12-09 05:34:19,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:34:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7885 states and 9940 transitions. [2020-12-09 05:34:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-12-09 05:34:19,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:19,734 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:34:19,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2020-12-09 05:34:19,734 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1939135195, now seen corresponding path program 1 times [2020-12-09 05:34:19,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:19,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793835220] [2020-12-09 05:34:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2020-12-09 05:34:19,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793835220] [2020-12-09 05:34:19,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:34:19,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:34:19,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66351811] [2020-12-09 05:34:19,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:34:19,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:34:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:34:19,814 INFO L87 Difference]: Start difference. First operand 7885 states and 9940 transitions. Second operand 3 states. [2020-12-09 05:34:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:20,355 INFO L93 Difference]: Finished difference Result 13266 states and 16726 transitions. [2020-12-09 05:34:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:34:20,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2020-12-09 05:34:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:20,360 INFO L225 Difference]: With dead ends: 13266 [2020-12-09 05:34:20,360 INFO L226 Difference]: Without dead ends: 5516 [2020-12-09 05:34:20,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:34:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5516 states. [2020-12-09 05:34:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5516 to 5073. [2020-12-09 05:34:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5073 states. [2020-12-09 05:34:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 6366 transitions. [2020-12-09 05:34:20,810 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 6366 transitions. Word has length 280 [2020-12-09 05:34:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:20,810 INFO L481 AbstractCegarLoop]: Abstraction has 5073 states and 6366 transitions. [2020-12-09 05:34:20,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:34:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 6366 transitions. [2020-12-09 05:34:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-12-09 05:34:20,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:20,814 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:34:20,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2020-12-09 05:34:20,814 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash 845644754, now seen corresponding path program 1 times [2020-12-09 05:34:20,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:20,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807588698] [2020-12-09 05:34:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2020-12-09 05:34:20,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807588698] [2020-12-09 05:34:20,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:34:20,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:34:20,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278025568] [2020-12-09 05:34:20,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:34:20,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:34:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:34:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:34:20,898 INFO L87 Difference]: Start difference. First operand 5073 states and 6366 transitions. Second operand 4 states. [2020-12-09 05:34:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:34:21,329 INFO L93 Difference]: Finished difference Result 8784 states and 11022 transitions. [2020-12-09 05:34:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:34:21,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2020-12-09 05:34:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:34:21,333 INFO L225 Difference]: With dead ends: 8784 [2020-12-09 05:34:21,333 INFO L226 Difference]: Without dead ends: 3768 [2020-12-09 05:34:21,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:34:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2020-12-09 05:34:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3731. [2020-12-09 05:34:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2020-12-09 05:34:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4589 transitions. [2020-12-09 05:34:21,679 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4589 transitions. Word has length 281 [2020-12-09 05:34:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:34:21,679 INFO L481 AbstractCegarLoop]: Abstraction has 3731 states and 4589 transitions. [2020-12-09 05:34:21,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:34:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4589 transitions. [2020-12-09 05:34:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2020-12-09 05:34:21,681 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:34:21,681 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:34:21,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2020-12-09 05:34:21,681 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:34:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:34:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash -638731407, now seen corresponding path program 1 times [2020-12-09 05:34:21,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:34:21,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969216586] [2020-12-09 05:34:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:34:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 36 proven. 133 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-12-09 05:34:22,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969216586] [2020-12-09 05:34:22,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573310039] [2020-12-09 05:34:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:34:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:34:22,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 05:34:22,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:34:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 38 proven. 115 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2020-12-09 05:34:22,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:34:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 15 proven. 138 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2020-12-09 05:34:22,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76522630] [2020-12-09 05:34:22,822 INFO L159 IcfgInterpreter]: Started Sifa with 156 locations of interest [2020-12-09 05:34:22,822 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:34:22,823 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:34:22,823 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:34:22,823 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:35:24,444 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 288 [2020-12-09 05:35:25,023 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 313 [2020-12-09 05:35:25,622 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 313 [2020-12-09 05:35:26,002 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 333 [2020-12-09 05:35:27,157 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 362 [2020-12-09 05:35:27,714 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 339 DAG size of output: 339 [2020-12-09 05:35:29,321 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 294 [2020-12-09 05:35:36,369 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:35:36,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:35:36,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 28 [2020-12-09 05:35:36,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987756273] [2020-12-09 05:35:36,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-09 05:35:36,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:36,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-09 05:35:36,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2020-12-09 05:35:36,371 INFO L87 Difference]: Start difference. First operand 3731 states and 4589 transitions. Second operand 28 states. [2020-12-09 05:35:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:50,400 INFO L93 Difference]: Finished difference Result 72332 states and 88472 transitions. [2020-12-09 05:35:50,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2020-12-09 05:35:50,400 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 295 [2020-12-09 05:35:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:50,465 INFO L225 Difference]: With dead ends: 72332 [2020-12-09 05:35:50,465 INFO L226 Difference]: Without dead ends: 72330 [2020-12-09 05:35:50,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 679 SyntacticMatches, 5 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19611 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5127, Invalid=44379, Unknown=0, NotChecked=0, Total=49506 [2020-12-09 05:35:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72330 states. [2020-12-09 05:35:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72330 to 15724. [2020-12-09 05:35:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15724 states. [2020-12-09 05:35:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15724 states to 15724 states and 19690 transitions. [2020-12-09 05:35:52,560 INFO L78 Accepts]: Start accepts. Automaton has 15724 states and 19690 transitions. Word has length 295 [2020-12-09 05:35:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:52,561 INFO L481 AbstractCegarLoop]: Abstraction has 15724 states and 19690 transitions. [2020-12-09 05:35:52,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-09 05:35:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 15724 states and 19690 transitions. [2020-12-09 05:35:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2020-12-09 05:35:52,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:52,563 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:35:52,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable212 [2020-12-09 05:35:52,765 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash 682185464, now seen corresponding path program 1 times [2020-12-09 05:35:52,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:52,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332468838] [2020-12-09 05:35:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 155 proven. 16 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2020-12-09 05:35:52,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332468838] [2020-12-09 05:35:52,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122046178] [2020-12-09 05:35:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:35:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:52,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:35:52,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:35:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-09 05:35:53,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:35:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-09 05:35:53,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:35:53,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2020-12-09 05:35:53,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367557594] [2020-12-09 05:35:53,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:53,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:53,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:35:53,306 INFO L87 Difference]: Start difference. First operand 15724 states and 19690 transitions. Second operand 3 states. [2020-12-09 05:35:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:55,193 INFO L93 Difference]: Finished difference Result 30917 states and 38781 transitions. [2020-12-09 05:35:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:55,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2020-12-09 05:35:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:55,207 INFO L225 Difference]: With dead ends: 30917 [2020-12-09 05:35:55,207 INFO L226 Difference]: Without dead ends: 15289 [2020-12-09 05:35:55,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 622 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:35:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15289 states. [2020-12-09 05:35:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15289 to 15289. [2020-12-09 05:35:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15289 states. [2020-12-09 05:35:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15289 states to 15289 states and 18919 transitions. [2020-12-09 05:35:57,012 INFO L78 Accepts]: Start accepts. Automaton has 15289 states and 18919 transitions. Word has length 312 [2020-12-09 05:35:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:35:57,012 INFO L481 AbstractCegarLoop]: Abstraction has 15289 states and 18919 transitions. [2020-12-09 05:35:57,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:35:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15289 states and 18919 transitions. [2020-12-09 05:35:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2020-12-09 05:35:57,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:35:57,015 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:35:57,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:35:57,216 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:35:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:35:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1047570031, now seen corresponding path program 1 times [2020-12-09 05:35:57,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:35:57,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406353769] [2020-12-09 05:35:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:35:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 163 proven. 16 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-12-09 05:35:57,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406353769] [2020-12-09 05:35:57,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196769650] [2020-12-09 05:35:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:35:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:35:57,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:35:57,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:35:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2020-12-09 05:35:57,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:35:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2020-12-09 05:35:57,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:35:57,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2020-12-09 05:35:57,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257240159] [2020-12-09 05:35:57,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:35:57,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:35:57,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:35:57,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:35:57,735 INFO L87 Difference]: Start difference. First operand 15289 states and 18919 transitions. Second operand 3 states. [2020-12-09 05:35:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:35:59,440 INFO L93 Difference]: Finished difference Result 29053 states and 35894 transitions. [2020-12-09 05:35:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:35:59,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2020-12-09 05:35:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:35:59,453 INFO L225 Difference]: With dead ends: 29053 [2020-12-09 05:35:59,453 INFO L226 Difference]: Without dead ends: 13860 [2020-12-09 05:35:59,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 634 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:35:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13860 states. [2020-12-09 05:36:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13860 to 12908. [2020-12-09 05:36:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12908 states. [2020-12-09 05:36:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12908 states to 12908 states and 15960 transitions. [2020-12-09 05:36:01,010 INFO L78 Accepts]: Start accepts. Automaton has 12908 states and 15960 transitions. Word has length 318 [2020-12-09 05:36:01,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:01,010 INFO L481 AbstractCegarLoop]: Abstraction has 12908 states and 15960 transitions. [2020-12-09 05:36:01,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12908 states and 15960 transitions. [2020-12-09 05:36:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2020-12-09 05:36:01,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:01,013 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:36:01,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable754 [2020-12-09 05:36:01,214 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:01,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:01,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1704645581, now seen corresponding path program 1 times [2020-12-09 05:36:01,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:01,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226572642] [2020-12-09 05:36:01,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2020-12-09 05:36:01,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226572642] [2020-12-09 05:36:01,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:36:01,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:36:01,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990298188] [2020-12-09 05:36:01,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:36:01,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:36:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:36:01,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:36:01,331 INFO L87 Difference]: Start difference. First operand 12908 states and 15960 transitions. Second operand 3 states. [2020-12-09 05:36:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:36:01,605 INFO L93 Difference]: Finished difference Result 13823 states and 16964 transitions. [2020-12-09 05:36:01,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:36:01,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2020-12-09 05:36:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:36:01,606 INFO L225 Difference]: With dead ends: 13823 [2020-12-09 05:36:01,606 INFO L226 Difference]: Without dead ends: 759 [2020-12-09 05:36:01,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:36:01,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-12-09 05:36:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 699. [2020-12-09 05:36:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2020-12-09 05:36:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 744 transitions. [2020-12-09 05:36:01,721 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 744 transitions. Word has length 333 [2020-12-09 05:36:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:36:01,721 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 744 transitions. [2020-12-09 05:36:01,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:36:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 744 transitions. [2020-12-09 05:36:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2020-12-09 05:36:01,722 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:36:01,723 INFO L422 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:36:01,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2020-12-09 05:36:01,723 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:36:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:36:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash 279250579, now seen corresponding path program 1 times [2020-12-09 05:36:01,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:36:01,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883463071] [2020-12-09 05:36:01,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:36:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 129 proven. 43 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-12-09 05:36:01,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883463071] [2020-12-09 05:36:01,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313227690] [2020-12-09 05:36:01,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:36:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:36:02,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 05:36:02,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:36:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 129 proven. 43 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-12-09 05:36:02,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:36:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 129 proven. 43 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-12-09 05:36:02,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477993104] [2020-12-09 05:36:02,496 INFO L159 IcfgInterpreter]: Started Sifa with 158 locations of interest [2020-12-09 05:36:02,496 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:36:02,497 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:36:02,497 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:36:02,497 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:37:54,761 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 288 [2020-12-09 05:37:55,371 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 313 [2020-12-09 05:37:56,036 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 313 [2020-12-09 05:37:56,421 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 333 [2020-12-09 05:37:57,581 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 361 [2020-12-09 05:37:57,977 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 328 DAG size of output: 328 [2020-12-09 05:37:59,727 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 295 [2020-12-09 05:38:07,875 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:38:07,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:38:07,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2020-12-09 05:38:07,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787711562] [2020-12-09 05:38:07,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:38:07,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:38:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:38:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-09 05:38:07,877 INFO L87 Difference]: Start difference. First operand 699 states and 744 transitions. Second operand 10 states. [2020-12-09 05:38:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:38:08,153 INFO L93 Difference]: Finished difference Result 874 states and 932 transitions. [2020-12-09 05:38:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 05:38:08,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 336 [2020-12-09 05:38:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:38:08,154 INFO L225 Difference]: With dead ends: 874 [2020-12-09 05:38:08,154 INFO L226 Difference]: Without dead ends: 769 [2020-12-09 05:38:08,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 674 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2020-12-09 05:38:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2020-12-09 05:38:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 697. [2020-12-09 05:38:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-12-09 05:38:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 741 transitions. [2020-12-09 05:38:08,265 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 741 transitions. Word has length 336 [2020-12-09 05:38:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:38:08,266 INFO L481 AbstractCegarLoop]: Abstraction has 697 states and 741 transitions. [2020-12-09 05:38:08,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:38:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 741 transitions. [2020-12-09 05:38:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2020-12-09 05:38:08,267 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:38:08,267 INFO L422 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 05:38:08,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:38:08,469 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 05:38:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:38:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1101719156, now seen corresponding path program 1 times [2020-12-09 05:38:08,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:38:08,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560132160] [2020-12-09 05:38:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:38:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 69 proven. 329 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 05:38:08,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560132160] [2020-12-09 05:38:08,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065390695] [2020-12-09 05:38:08,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:38:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:38:09,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-09 05:38:09,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:38:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 86 proven. 312 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 05:38:09,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:38:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 20 proven. 378 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-09 05:38:09,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040235208] [2020-12-09 05:38:09,940 INFO L159 IcfgInterpreter]: Started Sifa with 158 locations of interest [2020-12-09 05:38:09,940 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:38:09,940 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:38:09,940 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:38:09,940 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:40:01,234 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 288 [2020-12-09 05:40:01,820 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 313 [2020-12-09 05:40:02,420 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 313 [2020-12-09 05:40:02,847 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 333 [2020-12-09 05:40:04,013 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 360 [2020-12-09 05:40:04,352 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 329 [2020-12-09 05:40:14,219 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 05:40:14,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:40:14,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 33 [2020-12-09 05:40:14,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409468608] [2020-12-09 05:40:14,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-09 05:40:14,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:40:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-09 05:40:14,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 05:40:14,222 INFO L87 Difference]: Start difference. First operand 697 states and 741 transitions. Second operand 33 states. [2020-12-09 05:40:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:40:15,200 INFO L93 Difference]: Finished difference Result 867 states and 926 transitions. [2020-12-09 05:40:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-12-09 05:40:15,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 390 [2020-12-09 05:40:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:40:15,201 INFO L225 Difference]: With dead ends: 867 [2020-12-09 05:40:15,201 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 05:40:15,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 780 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=517, Invalid=3905, Unknown=0, NotChecked=0, Total=4422 [2020-12-09 05:40:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 05:40:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 05:40:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 05:40:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 05:40:15,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 390 [2020-12-09 05:40:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:40:15,203 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 05:40:15,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-09 05:40:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 05:40:15,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 05:40:15,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1306,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:40:15,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 05:40:15,688 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 175 [2020-12-09 05:40:16,946 WARN L197 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 602 DAG size of output: 440 [2020-12-09 05:40:17,354 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 342 [2020-12-09 05:40:17,494 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 158 [2020-12-09 05:40:18,211 WARN L197 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 574 DAG size of output: 468 [2020-12-09 05:40:18,388 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 187 [2020-12-09 05:40:18,506 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 211 [2020-12-09 05:40:18,811 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 226 [2020-12-09 05:40:19,235 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 280 [2020-12-09 05:40:19,826 WARN L197 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 328 [2020-12-09 05:40:19,942 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 210 [2020-12-09 05:40:20,090 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 187 [2020-12-09 05:40:20,208 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 211 [2020-12-09 05:40:20,623 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 271 [2020-12-09 05:40:21,046 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 280 [2020-12-09 05:40:21,248 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 240 [2020-12-09 05:40:21,435 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 207 [2020-12-09 05:40:21,931 WARN L197 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 229 [2020-12-09 05:40:22,110 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 194 [2020-12-09 05:40:22,480 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 226 [2020-12-09 05:40:22,617 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2020-12-09 05:40:22,876 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 224 [2020-12-09 05:40:22,993 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 167 [2020-12-09 05:40:23,122 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 168 [2020-12-09 05:40:23,240 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 167 [2020-12-09 05:40:23,376 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2020-12-09 05:40:23,560 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 182 [2020-12-09 05:40:24,017 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 441 DAG size of output: 358 [2020-12-09 05:40:24,289 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 234 [2020-12-09 05:40:25,517 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 602 DAG size of output: 440 [2020-12-09 05:40:25,658 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 158 [2020-12-09 05:40:26,900 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 598 DAG size of output: 436 [2020-12-09 05:40:27,155 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 234 [2020-12-09 05:40:28,395 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 602 DAG size of output: 440 [2020-12-09 05:40:28,859 WARN L197 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 441 DAG size of output: 358 [2020-12-09 05:40:29,050 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 211 [2020-12-09 05:40:29,190 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 158 [2020-12-09 05:40:36,874 WARN L197 SmtUtils]: Spent 7.68 s on a formula simplification. DAG size of input: 1942 DAG size of output: 1490 [2020-12-09 05:40:37,077 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 198 [2020-12-09 05:40:37,225 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 187 [2020-12-09 05:40:37,648 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 280 [2020-12-09 05:40:37,772 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 167 [2020-12-09 05:40:38,229 WARN L197 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 441 DAG size of output: 358 [2020-12-09 05:40:38,392 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 216 [2020-12-09 05:40:39,794 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 461 DAG size of output: 410 [2020-12-09 05:40:39,958 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 183 [2020-12-09 05:40:40,381 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 280 [2020-12-09 05:40:40,498 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 167 [2020-12-09 05:40:49,517 WARN L197 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 2169 DAG size of output: 1683 [2020-12-09 05:40:50,992 WARN L197 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 896 DAG size of output: 673 [2020-12-09 05:40:51,128 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2020-12-09 05:40:51,301 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 189 [2020-12-09 05:40:51,538 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 221 [2020-12-09 05:40:52,704 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 593 DAG size of output: 433 [2020-12-09 05:40:52,845 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 165 [2020-12-09 05:40:52,980 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2020-12-09 05:40:54,438 WARN L197 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 896 DAG size of output: 673 [2020-12-09 05:40:54,608 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 187 [2020-12-09 05:40:54,759 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 187 [2020-12-09 05:40:54,878 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 211 [2020-12-09 05:40:55,017 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 158 [2020-12-09 05:40:55,133 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 209 [2020-12-09 05:40:55,289 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 184 [2020-12-09 05:40:56,085 WARN L197 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 569 DAG size of output: 498 [2020-12-09 05:40:56,234 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 187 [2020-12-09 05:40:56,373 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 158 [2020-12-09 05:40:56,491 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 211 [2020-12-09 05:40:56,916 WARN L197 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 280 [2020-12-09 05:40:57,048 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 182 [2020-12-09 05:40:57,187 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 158 [2020-12-09 05:40:57,364 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 211 [2020-12-09 05:40:57,508 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 191 [2020-12-09 05:40:58,223 WARN L197 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 574 DAG size of output: 468 [2020-12-09 05:40:58,430 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 211 [2020-12-09 05:40:58,710 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 171 [2020-12-09 05:40:58,827 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 167 [2020-12-09 05:40:58,955 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 169 [2020-12-09 05:41:00,415 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 499 DAG size of output: 427 [2020-12-09 05:41:00,551 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 168 [2020-12-09 05:41:00,812 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 224 [2020-12-09 05:41:00,929 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 167 [2020-12-09 05:41:01,643 WARN L197 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 574 DAG size of output: 468 [2020-12-09 05:41:02,816 WARN L197 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 593 DAG size of output: 433 [2020-12-09 05:41:03,980 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 593 DAG size of output: 433 [2020-12-09 05:41:04,354 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 55 [2020-12-09 05:41:06,406 WARN L197 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 432 DAG size of output: 110 [2020-12-09 05:41:07,682 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 338 DAG size of output: 97 [2020-12-09 05:41:08,091 WARN L197 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 65 [2020-12-09 05:41:10,302 WARN L197 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 454 DAG size of output: 104 [2020-12-09 05:41:10,772 WARN L197 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 74 [2020-12-09 05:41:11,587 WARN L197 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 107 [2020-12-09 05:41:12,326 WARN L197 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 63 [2020-12-09 05:41:13,343 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 280 DAG size of output: 103 [2020-12-09 05:41:14,580 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 323 DAG size of output: 105 [2020-12-09 05:41:15,421 WARN L197 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 104 [2020-12-09 05:41:15,942 WARN L197 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 74 [2020-12-09 05:41:16,795 WARN L197 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 107 [2020-12-09 05:41:18,016 WARN L197 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 269 DAG size of output: 85 [2020-12-09 05:41:19,155 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 280 DAG size of output: 103 [2020-12-09 05:41:19,867 WARN L197 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 71 [2020-12-09 05:41:20,489 WARN L197 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 68 [2020-12-09 05:41:21,581 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 224 DAG size of output: 76 [2020-12-09 05:41:22,309 WARN L197 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 88 [2020-12-09 05:41:23,398 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 221 DAG size of output: 79 [2020-12-09 05:41:23,803 WARN L197 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 53 [2020-12-09 05:41:24,661 WARN L197 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 71 [2020-12-09 05:41:25,032 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 50 [2020-12-09 05:41:25,407 WARN L197 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 52 [2020-12-09 05:41:25,784 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 50 [2020-12-09 05:41:26,244 WARN L197 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 53 [2020-12-09 05:41:26,783 WARN L197 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 62 [2020-12-09 05:41:28,335 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 348 DAG size of output: 86 [2020-12-09 05:41:29,278 WARN L197 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 102 [2020-12-09 05:41:31,500 WARN L197 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 432 DAG size of output: 110 [2020-12-09 05:41:31,902 WARN L197 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 65 [2020-12-09 05:41:34,205 WARN L197 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 428 DAG size of output: 107 [2020-12-09 05:41:35,182 WARN L197 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 102 [2020-12-09 05:41:37,338 WARN L197 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 432 DAG size of output: 110 [2020-12-09 05:41:38,758 WARN L197 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 348 DAG size of output: 86 [2020-12-09 05:41:39,062 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 41 [2020-12-09 05:41:39,932 WARN L197 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 107 [2020-12-09 05:41:40,310 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 65 [2020-12-09 05:41:51,529 WARN L197 SmtUtils]: Spent 11.21 s on a formula simplification. DAG size of input: 1468 DAG size of output: 165 [2020-12-09 05:41:52,169 WARN L197 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 69 [2020-12-09 05:41:52,695 WARN L197 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 74 [2020-12-09 05:41:54,030 WARN L197 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 280 DAG size of output: 103 [2020-12-09 05:41:54,509 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 50 [2020-12-09 05:41:56,107 WARN L197 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 348 DAG size of output: 86 [2020-12-09 05:41:56,963 WARN L197 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 83 [2020-12-09 05:41:59,222 WARN L197 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 409 DAG size of output: 87 [2020-12-09 05:41:59,764 WARN L197 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 66 [2020-12-09 05:42:00,877 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 280 DAG size of output: 103 [2020-12-09 05:42:01,273 WARN L197 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 50 [2020-12-09 05:42:15,345 WARN L197 SmtUtils]: Spent 14.03 s on a formula simplification. DAG size of input: 1660 DAG size of output: 141 [2020-12-09 05:42:19,701 WARN L197 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 653 DAG size of output: 135 [2020-12-09 05:42:20,215 WARN L197 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 53 [2020-12-09 05:42:20,789 WARN L197 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 71 [2020-12-09 05:42:21,536 WARN L197 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 62 [2020-12-09 05:42:23,784 WARN L197 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 425 DAG size of output: 111 [2020-12-09 05:42:24,202 WARN L197 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 50 [2020-12-09 05:42:24,705 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 53 [2020-12-09 05:42:28,629 WARN L197 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 653 DAG size of output: 135 [2020-12-09 05:42:29,265 WARN L197 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 69 [2020-12-09 05:42:29,871 WARN L197 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 74 [2020-12-09 05:42:31,179 WARN L197 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 208 DAG size of output: 107 [2020-12-09 05:42:31,582 WARN L197 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 65 [2020-12-09 05:42:32,349 WARN L197 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 97 [2020-12-09 05:42:33,084 WARN L197 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 87 [2020-12-09 05:42:35,416 WARN L197 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 490 DAG size of output: 103 [2020-12-09 05:42:35,980 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 74 [2020-12-09 05:42:36,412 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 65 [2020-12-09 05:42:37,429 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 208 DAG size of output: 107 [2020-12-09 05:42:38,696 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 280 DAG size of output: 103 [2020-12-09 05:42:39,313 WARN L197 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 69 [2020-12-09 05:42:39,748 WARN L197 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 65 [2020-12-09 05:42:40,644 WARN L197 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 62 [2020-12-09 05:42:41,212 WARN L197 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 67 [2020-12-09 05:42:43,686 WARN L197 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 454 DAG size of output: 104 [2020-12-09 05:42:44,340 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 62 [2020-12-09 05:42:44,798 WARN L197 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 54 [2020-12-09 05:42:45,222 WARN L197 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 50 [2020-12-09 05:42:45,720 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 52 [2020-12-09 05:42:46,044 WARN L197 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 66 [2020-12-09 05:42:46,263 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 45 [2020-12-09 05:42:48,880 WARN L197 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 421 DAG size of output: 116 [2020-12-09 05:42:49,341 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 53 [2020-12-09 05:42:50,224 WARN L197 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 71 [2020-12-09 05:42:50,602 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 50 [2020-12-09 05:42:53,116 WARN L197 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 454 DAG size of output: 104 [2020-12-09 05:42:55,520 WARN L197 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 425 DAG size of output: 111 [2020-12-09 05:42:57,679 WARN L197 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 425 DAG size of output: 111 [2020-12-09 05:42:57,682 INFO L262 CegarLoopResult]: For program point L762(lines 762 766) no Hoare annotation was computed. [2020-12-09 05:42:57,682 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,682 INFO L262 CegarLoopResult]: For program point L696(lines 696 700) no Hoare annotation was computed. [2020-12-09 05:42:57,683 INFO L258 CegarLoopResult]: At program point L1291(lines 1284 1310) the Hoare annotation is: (let ((.cse12 (= ULTIMATE.start_m_run_~a~0 1)) (.cse2 (<= 1 ~a_t~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse17 (= ~m_run_pc~0 6)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse20 (= ~a_t~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (not (= ~m_run_st~0 0))) (.cse10 (= ~s_memory0~0 50)) (.cse11 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and (= ~s_run_pc~0 0) .cse16 .cse1 .cse3 (not (= ~c_req_type~0 0)) .cse5 (= ~c_req_a~0 0)) (and .cse16 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse17 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse3 .cse2 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~req_tt_a~0 1)) (and .cse17 .cse9 .cse10 .cse11 (or (and .cse16 .cse6 .cse1 .cse3 .cse2 .cse13 .cse4 .cse14 .cse15 .cse18) (and .cse16 .cse6 .cse1 .cse3 .cse13 .cse19 .cse4 .cse14 .cse15 .cse20))) (and (= ~c_m_lock~0 0) .cse17 .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse9 .cse11 .cse13 .cse14 .cse18) (and .cse0 .cse17 .cse1 .cse3 (= ~req_tt_a~0 0) .cse4 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse19 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse9 .cse10 .cse11 .cse13 .cse19 .cse14 .cse15))) [2020-12-09 05:42:57,683 INFO L258 CegarLoopResult]: At program point L234(lines 227 262) the Hoare annotation is: (let ((.cse31 (<= ~m_run_pc~0 0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (= ~m_run_pc~0 3)) (.cse22 (= 2 ~s_run_pc~0)) (.cse33 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse7 (<= .cse33 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (not (= ~m_run_st~0 0))) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 .cse33)) (.cse2 (<= ~c_req_d~0 .cse33)) (.cse19 (<= .cse33 ~c_req_d~0)) (.cse9 (= ~s_run_pc~0 0)) (.cse14 (let ((.cse32 (not .cse22))) (or (and .cse20 .cse21 .cse32 .cse31) (and .cse20 .cse21 .cse32 .cse30)))) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse23 (<= 6 ~m_run_pc~0)) (.cse0 (not (= ~c_req_type~0 0))) (.cse1 (= ~c_req_type~0 1)) (.cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse24 (or (and .cse20 .cse21 .cse30) (and .cse20 .cse21 .cse31))) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse11 (= ~c_write_req_ev~0 1)) (.cse12 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= ~c_empty_req~0 0)) (.cse5 (= ~a_t~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 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 (or (and .cse8 .cse20 .cse21 .cse0 .cse16 .cse22 .cse1 .cse18 .cse3 .cse4 .cse6 .cse23) (and .cse8 .cse24 .cse16 .cse0 .cse22 .cse1 .cse18 .cse3 .cse4 .cse6)) .cse2 .cse5 .cse19) (and .cse9 (not (= ~s_run_st~0 0)) .cse0 .cse14 .cse17 .cse3 .cse4 .cse6) (and (let ((.cse25 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse26 (<= 1 ~c_req_a~0)) (.cse27 (<= ~c_req_a~0 1)) (.cse28 (= ULTIMATE.start_m_run_~a~0 1)) (.cse29 (<= ULTIMATE.start_m_run_~req_a~0 1))) (or (and .cse25 .cse21 .cse0 .cse26 .cse22 .cse1 .cse6 .cse23 .cse8 .cse20 .cse27 .cse28 .cse16 .cse18 .cse29) (and .cse25 .cse0 .cse26 .cse22 .cse1 .cse6 .cse8 .cse27 .cse24 .cse28 .cse16 .cse18 .cse29))) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse12 .cse13 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) .cse5 (<= ~c_req_d~0 51))))) [2020-12-09 05:42:57,684 INFO L258 CegarLoopResult]: At program point L102(lines 102 126) the Hoare annotation is: (let ((.cse16 (not (= ~s_run_st~0 0))) (.cse21 (= ~c_m_lock~0 0)) (.cse22 (<= ~m_run_pc~0 0)) (.cse19 (= ~c_req_a~0 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse1 (= ~m_run_pc~0 6)) (.cse20 (= ~a_t~0 0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse3 (<= 1 ~a_t~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse18 (= ~m_run_pc~0 3)) (.cse7 (= ~c_empty_req~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~req_tt_a~0 1)) (and .cse14 .cse15 .cse16 .cse2 (not .cse17) .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse18 .cse12 .cse13 .cse20) (and .cse21 .cse1 .cse15 .cse7 .cse8 .cse10 .cse3 .cse2 .cse11 .cse4 .cse12) (and .cse21 .cse14 .cse15 .cse7 .cse16 .cse2 .cse22 .cse19) (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse20 .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse21 .cse16 .cse2 .cse22 .cse4 .cse19 .cse20 .cse15 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse21 .cse2 .cse22 .cse19 .cse20 .cse14 .cse15 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse15 .cse7 .cse2 .cse4 .cse18) (and .cse1 .cse8 .cse9 .cse10 (or (and .cse15 .cse7 .cse2 .cse11 .cse4 .cse12 .cse13 .cse20) (and .cse15 .cse7 .cse3 .cse2 .cse11 .cse4 .cse12 .cse13))) (and .cse0 .cse3 .cse2 .cse4 .cse18 (<= 51 ~c_req_d~0) .cse7 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,684 INFO L258 CegarLoopResult]: At program point L434(lines 427 453) the Hoare annotation is: (let ((.cse0 (= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse8 (= ~a_t~0 0)))) [2020-12-09 05:42:57,684 INFO L262 CegarLoopResult]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2020-12-09 05:42:57,684 INFO L262 CegarLoopResult]: For program point L236(lines 236 240) no Hoare annotation was computed. [2020-12-09 05:42:57,684 INFO L262 CegarLoopResult]: For program point L963(lines 963 967) no Hoare annotation was computed. [2020-12-09 05:42:57,684 INFO L258 CegarLoopResult]: At program point L171(lines 141 172) the Hoare annotation is: (let ((.cse10 (= 2 ~s_run_pc~0)) (.cse18 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse14 (= ~a_t~0 0)) (.cse0 (<= .cse18 ULTIMATE.start_m_run_~req_d~0)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (not (= ~m_run_st~0 0))) (.cse2 (<= 2 ~c_read_req_ev~0)) (.cse3 (<= ULTIMATE.start_m_run_~req_d~0 .cse18)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse16 (= ~s_run_pc~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (not .cse10)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= ~m_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse15 (not (= ULTIMATE.start_m_run_~req_type~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 6 ~m_run_pc~0)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse12)) .cse14) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (= ~c_m_lock~0 0) .cse8 .cse10 (= ~m_run_pc~0 3) .cse14 .cse5 .cse6 .cse7 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse2 (= ULTIMATE.start_m_run_~a~0 1) .cse9 .cse11 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse8 .cse13 (= ~c_req_a~0 0) .cse12 .cse14 .cse15 .cse0 .cse5 .cse6 .cse16 (= ~c_req_type~0 0) .cse7 .cse1 .cse2 .cse17 .cse3 .cse9 .cse4 .cse11) (and .cse16 .cse6 .cse7 (not (= ~s_run_st~0 0)) .cse8 .cse17 .cse4 .cse13 .cse12 .cse15)))) [2020-12-09 05:42:57,684 INFO L258 CegarLoopResult]: At program point L105(lines 105 125) the Hoare annotation is: (let ((.cse16 (not (= ~s_run_st~0 0))) (.cse21 (= ~c_m_lock~0 0)) (.cse22 (<= ~m_run_pc~0 0)) (.cse19 (= ~c_req_a~0 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse1 (= ~m_run_pc~0 6)) (.cse20 (= ~a_t~0 0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse3 (<= 1 ~a_t~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse18 (= ~m_run_pc~0 3)) (.cse7 (= ~c_empty_req~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~req_tt_a~0 1)) (and .cse14 .cse15 .cse16 .cse2 (not .cse17) .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse18 .cse12 .cse13 .cse20) (and .cse21 .cse1 .cse15 .cse7 .cse8 .cse10 .cse3 .cse2 .cse11 .cse4 .cse12) (and .cse21 .cse14 .cse15 .cse7 .cse16 .cse2 .cse22 .cse19) (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse20 .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse21 .cse16 .cse2 .cse22 .cse4 .cse19 .cse20 .cse15 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse21 .cse2 .cse22 .cse19 .cse20 .cse14 .cse15 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse15 .cse7 .cse2 .cse4 .cse18) (and .cse1 .cse8 .cse9 .cse10 (or (and .cse15 .cse7 .cse2 .cse11 .cse4 .cse12 .cse13 .cse20) (and .cse15 .cse7 .cse3 .cse2 .cse11 .cse4 .cse12 .cse13))) (and .cse0 .cse3 .cse2 .cse4 .cse18 (<= 51 ~c_req_d~0) .cse7 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,684 INFO L262 CegarLoopResult]: For program point L1030(lines 1030 1083) no Hoare annotation was computed. [2020-12-09 05:42:57,684 INFO L258 CegarLoopResult]: At program point L568(lines 561 614) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ~s_memory0~0 50)) (.cse10 (= ~c_write_req_ev~0 1)) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= ~c_empty_req~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= ~m_run_pc~0 3) (= ~c_req_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) .cse8 .cse10 .cse9 (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12 .cse13))) [2020-12-09 05:42:57,684 INFO L262 CegarLoopResult]: For program point L436(lines 436 440) no Hoare annotation was computed. [2020-12-09 05:42:57,685 INFO L262 CegarLoopResult]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2020-12-09 05:42:57,685 INFO L258 CegarLoopResult]: At program point L635-2(lines 635 663) the Hoare annotation is: (let ((.cse16 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse18 (<= 1 ~c_req_a~0)) (.cse19 (<= ~c_req_a~0 1)) (.cse4 (= ~a_t~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse22 (= ~c_req_type~0 0)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse23 (= ~s_run_st~0 0)) (.cse9 (= ~s_memory0~0 50)) (.cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse24 (<= ~c_empty_req~0 0)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse21 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse17 (<= 1 ~a_t~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse1 .cse16 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse17 .cse18 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 .cse5 .cse19 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 (= ~req_tt_a~0 1) .cse20) (and .cse0 .cse1 .cse16 .cse2 .cse18 .cse3 .cse4 .cse21 .cse22 .cse6 .cse7 .cse19 .cse23 .cse9 .cse10 (= ULTIMATE.start_m_run_~a~0 1) .cse24 .cse12 .cse14 .cse15) (and .cse1 .cse8 .cse9 .cse10 (or (and .cse21 .cse5 .cse17 .cse2 .cse12 .cse3 .cse14 .cse15 .cse20) (and .cse21 .cse5 .cse2 .cse12 .cse3 .cse13 .cse14 .cse15 .cse4))) (and .cse0 (<= 0 ~a_t~0) .cse2 .cse3 (= ~c_req_a~0 0) .cse21 .cse22 .cse6 .cse7 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15) (and (= ~c_m_lock~0 0) .cse1 .cse21 .cse5 .cse8 .cse10 .cse17 .cse2 .cse12 .cse3 .cse14 .cse20))) [2020-12-09 05:42:57,685 INFO L258 CegarLoopResult]: At program point L768(lines 761 805) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~c_m_lock~0 0)) (.cse2 (= ~m_run_pc~0 6)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse5 (= .cse4 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (= ~s_memory0~0 50) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse3 (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 (= 51 ~c_rsp_d~0) .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,685 INFO L258 CegarLoopResult]: At program point L702(lines 695 721) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)) (let ((.cse13 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 (= .cse13 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse3 (= .cse13 ~c_rsp_d~0) (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~s_memory0~0 50) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50))))) [2020-12-09 05:42:57,685 INFO L262 CegarLoopResult]: For program point L636(lines 635 663) no Hoare annotation was computed. [2020-12-09 05:42:57,685 INFO L262 CegarLoopResult]: For program point L570(lines 570 574) no Hoare annotation was computed. [2020-12-09 05:42:57,685 INFO L258 CegarLoopResult]: At program point L108(lines 108 124) the Hoare annotation is: (let ((.cse16 (not (= ~s_run_st~0 0))) (.cse21 (= ~c_m_lock~0 0)) (.cse22 (<= ~m_run_pc~0 0)) (.cse19 (= ~c_req_a~0 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse17 (= ~c_req_type~0 0)) (.cse1 (= ~m_run_pc~0 6)) (.cse20 (= ~a_t~0 0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse3 (<= 1 ~a_t~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse18 (= ~m_run_pc~0 3)) (.cse7 (= ~c_empty_req~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~req_tt_a~0 1)) (and .cse14 .cse15 .cse16 .cse2 (not .cse17) .cse18 .cse19) (and .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse18 .cse12 .cse13 .cse20) (and .cse21 .cse1 .cse15 .cse7 .cse8 .cse10 .cse3 .cse2 .cse11 .cse4 .cse12) (and .cse21 .cse14 .cse15 .cse7 .cse16 .cse2 .cse22 .cse19) (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse20 .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse21 .cse16 .cse2 .cse22 .cse4 .cse19 .cse20 .cse15 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse21 .cse2 .cse22 .cse19 .cse20 .cse14 .cse15 .cse17 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse15 .cse7 .cse2 .cse4 .cse18) (and .cse1 .cse8 .cse9 .cse10 (or (and .cse15 .cse7 .cse2 .cse11 .cse4 .cse12 .cse13 .cse20) (and .cse15 .cse7 .cse3 .cse2 .cse11 .cse4 .cse12 .cse13))) (and .cse0 .cse3 .cse2 .cse4 .cse18 (<= 51 ~c_req_d~0) .cse7 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,686 INFO L258 CegarLoopResult]: At program point L901(lines 875 902) the Hoare annotation is: (let ((.cse29 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse19 (<= 1 ~a_t~0)) (.cse20 (<= 1 ~c_req_a~0)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse10 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse23 (<= ~c_req_a~0 1)) (.cse12 (= ~s_memory0~0 50)) (.cse24 (= ULTIMATE.start_m_run_~a~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse21 (= ~c_req_type~0 1)) (.cse22 (= ~m_run_pc~0 3)) (.cse25 (<= ~c_req_d~0 .cse29)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~a_t~0 0)) (.cse26 (<= .cse29 ULTIMATE.start_m_run_~req_d~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse11 (not (= ~m_run_st~0 0))) (.cse13 (<= 2 ~c_read_req_ev~0)) (.cse14 (<= ~c_empty_req~0 0)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse27 (<= ULTIMATE.start_m_run_~req_d~0 .cse29)) (.cse16 (= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse28 (<= .cse29 ~c_req_d~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~req_tt_a~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse2 .cse3 .cse19 .cse20 .cse4 .cse21 .cse22 (<= 51 ~c_req_d~0) .cse7 .cse23 .cse11 .cse12 .cse13 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse14 .cse24 .cse15 .cse17 .cse18 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse2 .cse3 .cse21 .cse22 .cse25 .cse5 .cse6 .cse26 .cse7 (= ~s_run_pc~0 0) .cse11 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse28) (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse2 .cse19 .cse3 .cse20 .cse4 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse17 .cse18 (= ~req_tt_a~0 1)) (and .cse2 .cse3 .cse4 .cse21 .cse22 .cse25 .cse5 .cse6 .cse26 .cse7 .cse11 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse28)))) [2020-12-09 05:42:57,686 INFO L258 CegarLoopResult]: At program point L175-2(lines 175 203) the Hoare annotation is: (let ((.cse17 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse10 (= ~s_run_pc~0 0)) (.cse14 (<= .cse17 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse11 (<= ~m_run_pc~0 0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse13 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse15 (not (= ~m_run_st~0 0))) (.cse6 (<= 2 ~c_read_req_ev~0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 .cse17)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (= ~a_t~0 0))) (or (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse0 .cse1 (= ~m_run_pc~0 3) .cse2 .cse3 .cse4 .cse5 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse6 (= ULTIMATE.start_m_run_~a~0 1) .cse7 .cse8 .cse9 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse10 .cse4 .cse5 (not (= ~s_run_st~0 0)) .cse0 .cse11 .cse12 .cse13 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse11 (= ~c_req_a~0 0) .cse13 .cse2 .cse14 .cse3 .cse4 .cse10 (= ~c_req_type~0 0) .cse5 .cse15 .cse6 .cse16 .cse7 .cse12 .cse8 .cse9) (and .cse14 (or (and .cse3 .cse4 .cse5 .cse0 .cse7 .cse1 .cse8 .cse9 .cse13 (<= 6 ~m_run_pc~0)) (and .cse3 .cse4 .cse5 .cse0 .cse7 .cse11 .cse1 .cse8 .cse9 .cse13)) .cse15 .cse6 .cse16 .cse12 .cse2)))) [2020-12-09 05:42:57,686 INFO L262 CegarLoopResult]: For program point L770(lines 770 774) no Hoare annotation was computed. [2020-12-09 05:42:57,686 INFO L262 CegarLoopResult]: For program point L704(lines 704 708) no Hoare annotation was computed. [2020-12-09 05:42:57,686 INFO L258 CegarLoopResult]: At program point L1299(lines 1292 1309) the Hoare annotation is: (let ((.cse12 (= ULTIMATE.start_m_run_~a~0 1)) (.cse2 (<= 1 ~a_t~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse17 (= ~m_run_pc~0 6)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse20 (= ~a_t~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (not (= ~m_run_st~0 0))) (.cse10 (= ~s_memory0~0 50)) (.cse11 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and (= ~s_run_pc~0 0) .cse16 .cse1 .cse3 (not (= ~c_req_type~0 0)) .cse5 (= ~c_req_a~0 0)) (and .cse16 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse17 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse3 .cse2 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~req_tt_a~0 1)) (and .cse17 .cse9 .cse10 .cse11 (or (and .cse16 .cse6 .cse1 .cse3 .cse2 .cse13 .cse4 .cse14 .cse15 .cse18) (and .cse16 .cse6 .cse1 .cse3 .cse13 .cse19 .cse4 .cse14 .cse15 .cse20))) (and (= ~c_m_lock~0 0) .cse17 .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse9 .cse11 .cse13 .cse14 .cse18) (and .cse0 .cse17 .cse1 .cse3 (= ~req_tt_a~0 0) .cse4 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse19 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse9 .cse10 .cse11 .cse13 .cse19 .cse14 .cse15))) [2020-12-09 05:42:57,686 INFO L258 CegarLoopResult]: At program point L242(lines 235 261) the Hoare annotation is: (let ((.cse31 (<= ~m_run_pc~0 0)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse21 (<= 2 ~c_write_rsp_ev~0)) (.cse30 (= ~m_run_pc~0 3)) (.cse22 (= 2 ~s_run_pc~0)) (.cse33 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse7 (<= .cse33 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (not (= ~m_run_st~0 0))) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 .cse33)) (.cse2 (<= ~c_req_d~0 .cse33)) (.cse19 (<= .cse33 ~c_req_d~0)) (.cse9 (= ~s_run_pc~0 0)) (.cse14 (let ((.cse32 (not .cse22))) (or (and .cse20 .cse21 .cse32 .cse31) (and .cse20 .cse21 .cse32 .cse30)))) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse23 (<= 6 ~m_run_pc~0)) (.cse0 (not (= ~c_req_type~0 0))) (.cse1 (= ~c_req_type~0 1)) (.cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse24 (or (and .cse20 .cse21 .cse30) (and .cse20 .cse21 .cse31))) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse11 (= ~c_write_req_ev~0 1)) (.cse12 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= ~c_empty_req~0 0)) (.cse5 (= ~a_t~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 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 (or (and .cse8 .cse20 .cse21 .cse0 .cse16 .cse22 .cse1 .cse18 .cse3 .cse4 .cse6 .cse23) (and .cse8 .cse24 .cse16 .cse0 .cse22 .cse1 .cse18 .cse3 .cse4 .cse6)) .cse2 .cse5 .cse19) (and .cse9 (not (= ~s_run_st~0 0)) .cse0 .cse14 .cse17 .cse3 .cse4 .cse6) (and (let ((.cse25 (<= 1 ULTIMATE.start_m_run_~req_a~0)) (.cse26 (<= 1 ~c_req_a~0)) (.cse27 (<= ~c_req_a~0 1)) (.cse28 (= ULTIMATE.start_m_run_~a~0 1)) (.cse29 (<= ULTIMATE.start_m_run_~req_a~0 1))) (or (and .cse25 .cse21 .cse0 .cse26 .cse22 .cse1 .cse6 .cse23 .cse8 .cse20 .cse27 .cse28 .cse16 .cse18 .cse29) (and .cse25 .cse0 .cse26 .cse22 .cse1 .cse6 .cse8 .cse27 .cse24 .cse28 .cse16 .cse18 .cse29))) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse12 .cse13 (<= 51 ~c_req_d~0) (<= 51 ULTIMATE.start_m_run_~req_d~0) .cse5 (<= ~c_req_d~0 51))))) [2020-12-09 05:42:57,686 INFO L262 CegarLoopResult]: For program point L176(lines 175 203) no Hoare annotation was computed. [2020-12-09 05:42:57,687 INFO L258 CegarLoopResult]: At program point L969(lines 962 979) the Hoare annotation is: (let ((.cse32 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse4 (<= 1 ~a_t~0)) (.cse5 (<= 1 ~c_req_a~0)) (.cse12 (<= ~c_req_a~0 1)) (.cse15 (= ULTIMATE.start_m_run_~a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse11 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse14 (= ~s_memory0~0 50)) (.cse22 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse19 (= ~c_req_type~0 1)) (.cse20 (= ~m_run_pc~0 3)) (.cse21 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse24 (<= ~c_req_d~0 .cse32)) (.cse25 (= ~c_req_a~0 0)) (.cse26 (= ~a_t~0 0)) (.cse27 (<= .cse32 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse28 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse29 (<= ULTIMATE.start_m_run_~req_d~0 .cse32)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse30 (= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse31 (<= .cse32 ~c_req_d~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse18 (= ~req_tt_a~0 1)) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse20 .cse21 (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse12 .cse13 .cse14 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse15 .cse16 .cse17 .cse18 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse22 .cse23 .cse2 .cse3 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse8 (= ~s_run_pc~0 0) .cse13 .cse28 .cse29 .cse16 .cse30 .cse17 .cse18 .cse31) (and .cse0 .cse1 .cse2 .cse3 (= ~req_tt_a~0 0) .cse6 .cse25 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse28 .cse16 .cse30 .cse17 .cse18) (and .cse22 .cse23 .cse2 .cse3 .cse6 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse8 .cse13 .cse28 .cse29 .cse16 .cse30 .cse17 .cse18 .cse31)))) [2020-12-09 05:42:57,687 INFO L262 CegarLoopResult]: For program point L1300(lines 1252 1341) no Hoare annotation was computed. [2020-12-09 05:42:57,687 INFO L262 CegarLoopResult]: For program point L1234(lines 1234 1238) no Hoare annotation was computed. [2020-12-09 05:42:57,687 INFO L258 CegarLoopResult]: At program point L111(lines 111 123) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse17 (not (= ~s_run_st~0 0))) (.cse14 (= ~c_m_lock~0 0)) (.cse18 (<= ~m_run_pc~0 0)) (.cse19 (= ~c_req_a~0 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse21 (= ~c_req_type~0 0)) (.cse1 (= ~m_run_pc~0 6)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse20 (= ~a_t~0 0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse3 (<= 1 ~a_t~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~req_tt_a~0 1)) (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse10 .cse3 .cse2 .cse11 .cse4 .cse12) (and .cse14 .cse16 .cse15 .cse7 .cse17 .cse2 .cse18 .cse19) (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse20 .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse14 .cse17 .cse2 .cse18 .cse4 .cse19 .cse20 .cse15 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse14 .cse2 .cse18 .cse19 .cse20 .cse16 .cse15 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse8 .cse9 .cse10 (or (and .cse15 .cse7 .cse2 .cse11 .cse4 .cse12 .cse13 .cse20) (and .cse15 .cse7 .cse3 .cse2 .cse11 .cse4 .cse12 .cse13))))) [2020-12-09 05:42:57,687 INFO L262 CegarLoopResult]: For program point L970(lines 962 979) no Hoare annotation was computed. [2020-12-09 05:42:57,687 INFO L258 CegarLoopResult]: At program point L442(lines 435 452) the Hoare annotation is: (let ((.cse0 (= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse8 (= ~a_t~0 0)))) [2020-12-09 05:42:57,687 INFO L262 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-12-09 05:42:57,687 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,687 INFO L262 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-12-09 05:42:57,687 INFO L258 CegarLoopResult]: At program point L1037(lines 1030 1083) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 1 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1)) (let ((.cse15 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (= ~c_req_type~0 1) (= ULTIMATE.start_s_run_~req_type~1 1) .cse14 (<= ~c_req_d~0 .cse15) .cse16 (<= .cse15 ULTIMATE.start_m_run_~req_d~0) (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 .cse15) .cse10 .cse17 .cse11 .cse12 (<= .cse15 ~c_req_d~0))) (and .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse14 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse3 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse16 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse17 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse6 .cse7 .cse8 .cse10 .cse3 .cse17 .cse14 .cse11 .cse12 .cse16))) [2020-12-09 05:42:57,687 INFO L262 CegarLoopResult]: For program point L443(lines 131 477) no Hoare annotation was computed. [2020-12-09 05:42:57,688 INFO L258 CegarLoopResult]: At program point L576(lines 569 613) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ~s_memory0~0 50)) (.cse10 (= ~c_write_req_ev~0 1)) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= ~c_empty_req~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= ~m_run_pc~0 3) (= ~c_req_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) .cse8 .cse10 .cse9 (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12 .cse13))) [2020-12-09 05:42:57,688 INFO L258 CegarLoopResult]: At program point L114(lines 114 122) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse17 (not (= ~s_run_st~0 0))) (.cse14 (= ~c_m_lock~0 0)) (.cse18 (<= ~m_run_pc~0 0)) (.cse19 (= ~c_req_a~0 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse21 (= ~c_req_type~0 0)) (.cse1 (= ~m_run_pc~0 6)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse20 (= ~a_t~0 0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse3 (<= 1 ~a_t~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~req_tt_a~0 1)) (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse10 .cse3 .cse2 .cse11 .cse4 .cse12) (and .cse14 .cse16 .cse15 .cse7 .cse17 .cse2 .cse18 .cse19) (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse20 .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse14 .cse17 .cse2 .cse18 .cse4 .cse19 .cse20 .cse15 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse14 .cse2 .cse18 .cse19 .cse20 .cse16 .cse15 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse8 .cse9 .cse10 (or (and .cse15 .cse7 .cse2 .cse11 .cse4 .cse12 .cse13 .cse20) (and .cse15 .cse7 .cse3 .cse2 .cse11 .cse4 .cse12 .cse13))))) [2020-12-09 05:42:57,688 INFO L262 CegarLoopResult]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2020-12-09 05:42:57,688 INFO L262 CegarLoopResult]: For program point L908(lines 908 961) no Hoare annotation was computed. [2020-12-09 05:42:57,688 INFO L258 CegarLoopResult]: At program point L776(lines 769 804) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~c_m_lock~0 0)) (.cse2 (= ~m_run_pc~0 6)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse5 (= .cse4 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (= ~s_memory0~0 50) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse3 (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 (= 51 ~c_rsp_d~0) .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,688 INFO L258 CegarLoopResult]: At program point L710(lines 703 720) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)) (let ((.cse13 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 (= .cse13 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse3 (= .cse13 ~c_rsp_d~0) (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~s_memory0~0 50) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50))))) [2020-12-09 05:42:57,688 INFO L262 CegarLoopResult]: For program point L578(lines 578 582) no Hoare annotation was computed. [2020-12-09 05:42:57,688 INFO L258 CegarLoopResult]: At program point L314(lines 284 315) the Hoare annotation is: (let ((.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~m_run_st~0 0))) (.cse5 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_read_req_ev~0)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 .cse1 (= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse8 .cse9 (= ~a_t~0 0)))) [2020-12-09 05:42:57,688 INFO L262 CegarLoopResult]: For program point L909(lines 909 913) no Hoare annotation was computed. [2020-12-09 05:42:57,688 INFO L262 CegarLoopResult]: For program point L711(lines 482 834) no Hoare annotation was computed. [2020-12-09 05:42:57,689 INFO L258 CegarLoopResult]: At program point L1240(lines 1233 1250) the Hoare annotation is: (and (= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= ~m_run_pc~0 0) (= ~c_req_a~0 0) (= ~a_t~0 0) (= ~s_run_pc~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~m_run_st~0 0) (= ~s_run_st~0 0) (<= 2 ~c_read_req_ev~0) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0)) [2020-12-09 05:42:57,689 INFO L262 CegarLoopResult]: For program point L1174-1(lines 1167 1346) no Hoare annotation was computed. [2020-12-09 05:42:57,689 INFO L258 CegarLoopResult]: At program point L117(lines 117 121) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse17 (not (= ~s_run_st~0 0))) (.cse14 (= ~c_m_lock~0 0)) (.cse18 (<= ~m_run_pc~0 0)) (.cse19 (= ~c_req_a~0 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse21 (= ~c_req_type~0 0)) (.cse1 (= ~m_run_pc~0 6)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse20 (= ~a_t~0 0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse3 (<= 1 ~a_t~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~req_tt_a~0 1)) (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse10 .cse3 .cse2 .cse11 .cse4 .cse12) (and .cse14 .cse16 .cse15 .cse7 .cse17 .cse2 .cse18 .cse19) (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse20 .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse14 .cse17 .cse2 .cse18 .cse4 .cse19 .cse20 .cse15 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse14 .cse2 .cse18 .cse19 .cse20 .cse16 .cse15 .cse21 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse8 .cse9 .cse10 (or (and .cse15 .cse7 .cse2 .cse11 .cse4 .cse12 .cse13 .cse20) (and .cse15 .cse7 .cse3 .cse2 .cse11 .cse4 .cse12 .cse13))))) [2020-12-09 05:42:57,689 INFO L262 CegarLoopResult]: For program point L778(lines 778 782) no Hoare annotation was computed. [2020-12-09 05:42:57,689 INFO L258 CegarLoopResult]: At program point L382(lines 375 392) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (<= 2 ~c_read_req_ev~0)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 (= ~a_t~0 0)) (and (= ~s_memory1~0 51) .cse4 (<= 1 ~a_t~0) .cse6 .cse8 (<= 51 ~c_req_d~0) .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse5 .cse7 .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,689 INFO L258 CegarLoopResult]: At program point L250(lines 243 260) the Hoare annotation is: (let ((.cse22 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (not (= ~c_req_type~0 0))) (.cse3 (= ~c_req_type~0 1)) (.cse4 (<= ~c_req_d~0 .cse22)) (.cse5 (= ~c_req_a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse8 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse9 (<= .cse22 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse21 (= ~s_run_pc~0 0)) (.cse12 (not (= ~m_run_st~0 0))) (.cse14 (= ~c_write_req_ev~0 1)) (.cse13 (<= 2 ~c_read_req_ev~0)) (.cse15 (<= ~c_empty_req~0 0)) (.cse16 (<= ULTIMATE.start_m_run_~req_d~0 .cse22)) (.cse17 (<= 2 ~c_m_ev~0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse20 (<= .cse22 ~c_req_d~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse11 .cse21 (not (= ~s_run_st~0 0)) .cse0 .cse1 .cse18 .cse5 .cse6 .cse8) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse0 .cse1 (<= 1 ~c_req_a~0) .cse2 .cse3 (<= 51 ~c_req_d~0) .cse7 .cse8 .cse10 .cse11 (<= ~c_req_a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 .cse14 .cse15 (= ULTIMATE.start_m_run_~a~0 1) .cse17 .cse19 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2020-12-09 05:42:57,689 INFO L262 CegarLoopResult]: For program point L383(lines 375 392) no Hoare annotation was computed. [2020-12-09 05:42:57,689 INFO L262 CegarLoopResult]: For program point L251(lines 131 477) no Hoare annotation was computed. [2020-12-09 05:42:57,689 INFO L258 CegarLoopResult]: At program point L1045(lines 1038 1082) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 1 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1)) (let ((.cse15 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (= ~c_req_type~0 1) (= ULTIMATE.start_s_run_~req_type~1 1) .cse14 (<= ~c_req_d~0 .cse15) .cse16 (<= .cse15 ULTIMATE.start_m_run_~req_d~0) (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 .cse15) .cse10 .cse17 .cse11 .cse12 (<= .cse15 ~c_req_d~0))) (and .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse14 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse3 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse16 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse17 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse6 .cse7 .cse8 .cse10 .cse3 .cse17 .cse14 .cse11 .cse12 .cse16))) [2020-12-09 05:42:57,690 INFO L258 CegarLoopResult]: At program point L584(lines 577 612) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_req_type~0 0)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse7 (= ~c_write_req_ev~0 1)) (.cse11 (<= ~c_empty_req~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 0 ~a_t~0) .cse1 (= ~c_req_a~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (and .cse8 .cse9 (= ~m_run_pc~0 3)) (and .cse8 .cse9 (<= ~m_run_pc~0 0))) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse9 (<= 1 ~c_req_a~0) .cse1 (= ~a_t~0 0) .cse2 .cse8 .cse3 .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse10 .cse7 (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12 .cse13))) [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L258 CegarLoopResult]: At program point L915(lines 908 961) the Hoare annotation is: (let ((.cse33 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= 1 ~a_t~0)) (.cse3 (<= 1 ~c_req_a~0)) (.cse9 (<= ~c_req_a~0 1)) (.cse13 (= ULTIMATE.start_m_run_~a~0 1)) (.cse17 (= ~s_memory1~0 51)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (= ~c_req_type~0 0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (<= ~c_req_d~0 .cse33)) (.cse23 (= ~c_req_a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse30 (<= .cse33 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (not (= ~m_run_st~0 0))) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (<= ULTIMATE.start_m_run_~req_d~0 .cse33)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse26 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse32 (<= .cse33 ~c_req_d~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 .cse14 .cse15 .cse16 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse17 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse2 .cse1 .cse3 .cse4 .cse19 .cse8 .cse20 .cse10 .cse21 .cse22 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 (= ~req_tt_a~0 1)) (and .cse17 .cse18 .cse0 .cse1 (= ~req_tt_a~0 0) .cse4 .cse23 .cse24 .cse19 .cse8 .cse20 .cse21 .cse22 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse14 .cse26 .cse15 .cse16) (and .cse27 .cse28 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32) (and .cse27 .cse28 .cse0 .cse1 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 (= ~s_run_pc~0 0) .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32)))) [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L321(lines 321 374) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L1180(lines 1180 1184) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L982(lines 982 996) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L258 CegarLoopResult]: At program point L784(lines 777 803) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~c_m_lock~0 0)) (.cse2 (= ~m_run_pc~0 6)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse5 (= .cse4 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (= ~s_memory0~0 50) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse3 (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 (= 51 ~c_rsp_d~0) .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L586(lines 586 590) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L917(lines 917 921) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L258 CegarLoopResult]: At program point L521(lines 491 522) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ~c_m_lock~0 0) (<= 1 ~a_t~0) .cse1 .cse2 (= ~m_run_pc~0 3) .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 (<= ~c_req_d~0 51)) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse11))) [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L59(lines 59 64) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L786(lines 786 790) no Hoare annotation was computed. [2020-12-09 05:42:57,690 INFO L262 CegarLoopResult]: For program point L1315(lines 1315 1319) no Hoare annotation was computed. [2020-12-09 05:42:57,691 INFO L262 CegarLoopResult]: For program point L1117(lines 1116 1157) no Hoare annotation was computed. [2020-12-09 05:42:57,691 INFO L262 CegarLoopResult]: For program point L61(lines 61 64) no Hoare annotation was computed. [2020-12-09 05:42:57,691 INFO L262 CegarLoopResult]: For program point L458(lines 458 462) no Hoare annotation was computed. [2020-12-09 05:42:57,691 INFO L258 CegarLoopResult]: At program point L128(lines 98 840) the Hoare annotation is: (let ((.cse1 (= ~s_run_pc~0 0)) (.cse0 (= ~c_m_lock~0 0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (<= ~m_run_pc~0 0)) (.cse7 (= ~c_req_a~0 0)) (.cse8 (= ~a_t~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse9 (not (= ~m_run_st~0 0))) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse1 .cse2 (= ~c_req_type~0 0) .cse3 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse4 .cse5 .cse6 (= 2 ~s_run_pc~0) .cse7 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse12))) [2020-12-09 05:42:57,691 INFO L258 CegarLoopResult]: At program point L1053(lines 1046 1081) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 1 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1)) (let ((.cse15 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (= ~c_req_type~0 1) (= ULTIMATE.start_s_run_~req_type~1 1) .cse14 (<= ~c_req_d~0 .cse15) .cse16 (<= .cse15 ULTIMATE.start_m_run_~req_d~0) (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 .cse15) .cse10 .cse17 .cse11 .cse12 (<= .cse15 ~c_req_d~0))) (and .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse14 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse3 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse16 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse17 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse6 .cse7 .cse8 .cse10 .cse3 .cse17 .cse14 .cse11 .cse12 .cse16))) [2020-12-09 05:42:57,691 INFO L258 CegarLoopResult]: At program point L525-2(lines 525 553) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (= ~c_empty_req~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) .cse2 (= ~m_run_pc~0 3) .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 (<= ~c_req_d~0 51)) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse6 .cse7 .cse5 .cse8 .cse9 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse11 .cse12))) [2020-12-09 05:42:57,691 INFO L258 CegarLoopResult]: At program point L1186(lines 1179 1232) the Hoare annotation is: (and (= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= ~m_run_pc~0 0) (= ~c_req_a~0 0) (= ~a_t~0 0) (= ~s_run_pc~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~m_run_st~0 0) (= ~s_run_st~0 0) (<= 2 ~c_read_req_ev~0) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0)) [2020-12-09 05:42:57,691 INFO L262 CegarLoopResult]: For program point L988(lines 988 995) no Hoare annotation was computed. [2020-12-09 05:42:57,691 INFO L258 CegarLoopResult]: At program point L592(lines 585 611) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_req_type~0 0)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse7 (= ~c_write_req_ev~0 1)) (.cse11 (<= ~c_empty_req~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 0 ~a_t~0) .cse1 (= ~c_req_a~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (and .cse8 .cse9 (= ~m_run_pc~0 3)) (and .cse8 .cse9 (<= ~m_run_pc~0 0))) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse9 (<= 1 ~c_req_a~0) .cse1 (= ~a_t~0 0) .cse2 .cse8 .cse3 .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse10 .cse7 (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12 .cse13))) [2020-12-09 05:42:57,691 INFO L262 CegarLoopResult]: For program point L526(lines 525 553) no Hoare annotation was computed. [2020-12-09 05:42:57,691 INFO L262 CegarLoopResult]: For program point L394(lines 394 400) no Hoare annotation was computed. [2020-12-09 05:42:57,692 INFO L258 CegarLoopResult]: At program point L394-1(lines 394 400) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~s_memory0~0 50)) (.cse3 (<= 2 ~c_read_req_ev~0)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0)) (and (= ~s_memory1~0 51) .cse4 (<= 1 ~a_t~0) .cse6 .cse8 (<= 51 ~c_req_d~0) .cse0 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse5 .cse7 .cse9 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,692 INFO L258 CegarLoopResult]: At program point L328(lines 321 374) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10))) [2020-12-09 05:42:57,692 INFO L262 CegarLoopResult]: For program point L1121(lines 1121 1125) no Hoare annotation was computed. [2020-12-09 05:42:57,692 INFO L262 CegarLoopResult]: For program point L1121-1(lines 1116 1157) no Hoare annotation was computed. [2020-12-09 05:42:57,692 INFO L262 CegarLoopResult]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2020-12-09 05:42:57,692 INFO L258 CegarLoopResult]: At program point L923(lines 916 960) the Hoare annotation is: (let ((.cse33 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= 1 ~a_t~0)) (.cse3 (<= 1 ~c_req_a~0)) (.cse9 (<= ~c_req_a~0 1)) (.cse13 (= ULTIMATE.start_m_run_~a~0 1)) (.cse17 (= ~s_memory1~0 51)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (= ~c_req_type~0 0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (<= ~c_req_d~0 .cse33)) (.cse23 (= ~c_req_a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse30 (<= .cse33 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (not (= ~m_run_st~0 0))) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (<= ULTIMATE.start_m_run_~req_d~0 .cse33)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse26 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse32 (<= .cse33 ~c_req_d~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 .cse14 .cse15 .cse16 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse17 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse2 .cse1 .cse3 .cse4 .cse19 .cse8 .cse20 .cse10 .cse21 .cse22 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 (= ~req_tt_a~0 1)) (and .cse17 .cse18 .cse0 .cse1 (= ~req_tt_a~0 0) .cse4 .cse23 .cse24 .cse19 .cse8 .cse20 .cse21 .cse22 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse14 .cse26 .cse15 .cse16) (and .cse27 .cse28 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32) (and .cse27 .cse28 .cse0 .cse1 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 (= ~s_run_pc~0 0) .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32)))) [2020-12-09 05:42:57,692 INFO L262 CegarLoopResult]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2020-12-09 05:42:57,692 INFO L258 CegarLoopResult]: At program point L131-2(lines 131 477) the Hoare annotation is: (let ((.cse9 (not (= ~m_run_st~0 0))) (.cse14 (= ~s_run_pc~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (<= ~m_run_pc~0 0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~c_req_a~0 0)) (.cse0 (= ~c_m_lock~0 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_empty_req~0 1)) (.cse16 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse15 (= ~m_run_pc~0 3)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 (= ~c_req_type~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse2 .cse4 .cse15 (<= 51 ~c_req_d~0) .cse7 .cse8 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse16 .cse10 .cse11 .cse13 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse14 .cse7 .cse8 .cse1 .cse2 .cse3 .cse12 .cse5) (and .cse0 .cse7 .cse8 .cse16 .cse10 (= ULTIMATE.start_m_run_~a~0 1) .cse2 .cse11 .cse4 .cse15 .cse13 .cse6))) [2020-12-09 05:42:57,692 INFO L262 CegarLoopResult]: For program point L858(lines 858 870) no Hoare annotation was computed. [2020-12-09 05:42:57,692 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,692 INFO L258 CegarLoopResult]: At program point L792(lines 785 802) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~c_m_lock~0 0)) (.cse2 (= ~m_run_pc~0 6)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse5 (= .cse4 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (= ~s_memory0~0 50) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse3 (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 (= 51 ~c_rsp_d~0) .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L726(lines 726 730) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L594(lines 594 598) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L330(lines 330 334) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L258 CegarLoopResult]: At program point L1321(lines 1314 1331) the Hoare annotation is: (let ((.cse1 (= ~m_run_pc~0 6)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse17 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~a_t~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (<= 1 ~a_t~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse18 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~req_tt_a~0 0) .cse4 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse9 .cse10 (or (and .cse15 .cse6 .cse2 .cse3 .cse16 .cse11 .cse4 .cse13 .cse14 .cse17) (and .cse15 .cse6 .cse2 .cse3 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5))) (and (= ~s_run_pc~0 0) .cse15 .cse2 .cse3 (not (= ~c_req_type~0 0)) .cse18 (= ~c_req_a~0 0)) (and .cse15 .cse6 .cse2 .cse3 .cse4 .cse18) (and .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 .cse16 (<= 1 ~c_req_a~0) .cse4 (<= 1 ULTIMATE.start_m_run_~req_a___0~0) (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse19 .cse11 .cse13 .cse14 (= ~req_tt_a~0 1)) (and (= ~c_m_lock~0 0) .cse1 .cse15 .cse6 .cse2 .cse10 .cse16 .cse3 .cse11 .cse4 .cse13 .cse17) (and .cse6 .cse9 .cse2 .cse10 .cse3 .cse11 .cse12 .cse4 .cse13 .cse18 .cse14 .cse5) (and .cse0 .cse2 .cse3 .cse16 .cse4 .cse18 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse19 .cse11 .cse13 .cse14 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L132(lines 131 477) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L925(lines 925 929) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L793(lines 482 834) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L1322(lines 1252 1341) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L258 CegarLoopResult]: At program point L464(lines 457 474) the Hoare annotation is: (let ((.cse0 (= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse8 (= ~a_t~0 0)))) [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L266(lines 266 270) no Hoare annotation was computed. [2020-12-09 05:42:57,693 INFO L258 CegarLoopResult]: At program point L861(lines 861 869) the Hoare annotation is: (let ((.cse27 (<= 51 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse31 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse32 (<= ~c_req_d~0 51)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (= ~c_empty_req~0 1)) (.cse23 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse33 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse22 (<= 1 ~a_t~0)) (.cse25 (<= 1 ~c_req_a~0)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse11 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~c_req_a~0 1)) (.cse13 (= ~s_memory0~0 50)) (.cse30 (= ULTIMATE.start_m_run_~a~0 1)) (.cse34 (= ~req_tt_a~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse26 (= ~c_req_type~0 1)) (.cse24 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse12 (not (= ~m_run_st~0 0))) (.cse14 (<= 2 ~c_read_req_ev~0)) (.cse16 (<= ~c_empty_req~0 0)) (.cse17 (<= 2 ~c_m_ev~0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse19 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse13 .cse14 (or (and .cse8 .cse21 .cse2 .cse22 .cse3 .cse17 .cse5 .cse19 .cse20 .cse23) (and .cse8 .cse21 .cse2 .cse3 .cse17 .cse18 .cse5 .cse19 .cse20 .cse7))) (and .cse21 .cse13 .cse14 .cse2 .cse3 .cse17 .cse18 .cse5 .cse24 .cse19 .cse20 .cse7) (and .cse2 .cse3 .cse22 .cse25 .cse5 .cse26 .cse24 .cse27 .cse8 .cse28 .cse12 .cse13 .cse14 .cse29 .cse16 .cse30 .cse17 .cse19 .cse20 .cse31 .cse32) (and .cse8 .cse21 .cse2 .cse3 .cse5 .cse24) (and .cse0 .cse1 .cse33 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 .cse22 .cse25 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 .cse28 .cse21 (= 51 ~c_rsp_d~0) .cse13 .cse14 .cse30 .cse17 .cse19 .cse20 .cse34) (and .cse0 .cse2 .cse22 .cse3 .cse5 .cse24 .cse27 .cse10 .cse11 .cse21 .cse13 .cse29 .cse14 .cse30 .cse17 .cse19 .cse20 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse7 .cse10 .cse11 .cse21 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse20) (and (= ~c_m_lock~0 0) .cse1 .cse8 .cse21 .cse2 .cse14 .cse22 .cse3 .cse17 .cse5 .cse19 .cse23) (and .cse0 .cse1 .cse33 .cse2 .cse22 .cse3 .cse25 .cse5 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse30 .cse16 .cse17 .cse19 .cse20 .cse34) (let ((.cse35 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse2 .cse3 .cse5 .cse26 .cse24 (<= ~c_req_d~0 .cse35) .cse6 .cse7 (<= .cse35 ULTIMATE.start_m_run_~req_d~0) .cse8 .cse12 .cse14 .cse16 .cse17 (<= ULTIMATE.start_m_run_~req_d~0 .cse35) .cse18 .cse19 .cse20 (<= .cse35 ~c_req_d~0))))) [2020-12-09 05:42:57,693 INFO L262 CegarLoopResult]: For program point L465(lines 457 474) no Hoare annotation was computed. [2020-12-09 05:42:57,694 INFO L258 CegarLoopResult]: At program point L664(lines 634 665) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= ~c_empty_req~0 1)) (.cse7 (not (= ~m_run_st~0 0))) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 (= ~a_t~0 0) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse4 (<= ~c_req_a~0 1) (= 51 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,694 INFO L258 CegarLoopResult]: At program point L1127(lines 1116 1157) the Hoare annotation is: (let ((.cse27 (= ~s_run_st~0 0)) (.cse10 (= ~m_run_st~0 0)) (.cse50 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse5 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0)) (.cse17 (= ULTIMATE.start_s_memory_read_~x~0 50)) (.cse3 (= ~req_tt_a~0 0)) (.cse22 (= ~c_req_type~0 0)) (.cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse41 (<= ~c_req_d~0 .cse50)) (.cse42 (<= .cse50 ULTIMATE.start_m_run_~req_d~0)) (.cse43 (<= ULTIMATE.start_m_run_~req_d~0 .cse50)) (.cse44 (<= .cse50 ~c_req_d~0)) (.cse37 (= ~c_m_lock~0 0)) (.cse19 (= ~s_run_pc~0 0)) (.cse38 (<= ~m_run_pc~0 0)) (.cse24 (= ~c_req_a~0 0)) (.cse39 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse15 (= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (= ~a_t~0 0)) (.cse40 (= ~c_req_type~0 1)) (.cse29 (not .cse10)) (.cse31 (<= ~c_empty_req~0 0)) (.cse45 (<= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse1 (= ~m_run_pc~0 6)) (.cse46 (= ULTIMATE.start_s_memory_read_~i 1)) (.cse26 (<= 1 ~c_req_a~0)) (.cse47 (<= 1 ULTIMATE.start_m_run_~req_a___0~0)) (.cse48 (= 51 ULTIMATE.start_s_memory_read_~x~0)) (.cse28 (<= ~c_req_a~0 1)) (.cse49 (= 51 ~c_rsp_d~0)) (.cse32 (= ~req_tt_a~0 1)) (.cse20 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse21 (not .cse27)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (<= 1 ~a_t~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse23 (= ~m_run_pc~0 3)) (.cse33 (<= 51 ~c_req_d~0)) (.cse9 (= ~c_empty_req~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (<= 2 ~c_read_req_ev~0)) (.cse34 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse30 (= ULTIMATE.start_m_run_~a~0 1)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse35 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse36 (<= ~c_req_d~0 51))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse21 .cse2 (not .cse22) .cse23 .cse24) (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse25 .cse2 .cse26 .cse4 .cse20 .cse22 .cse27 .cse7 .cse8 .cse28 .cse29 .cse11 .cse12 .cse30 .cse31 .cse14 .cse16 .cse18 .cse32) (and .cse27 .cse9 .cse11 .cse12 .cse2 .cse14 .cse4 .cse15 .cse16 .cse23 .cse18 .cse6) (and .cse0 .cse2 .cse25 .cse4 .cse23 .cse33 .cse27 .cse9 .cse7 .cse8 .cse11 .cse12 .cse34 .cse30 .cse14 .cse16 .cse18 .cse35 .cse36) (and .cse37 .cse2 .cse38 .cse24 .cse6 .cse19 .cse20 .cse22 .cse9 .cse10 .cse12 .cse14 .cse16) (and .cse37 .cse1 .cse20 .cse9 .cse12 .cse2 .cse25 .cse14 .cse4 .cse16 .cse39) (and .cse37 .cse21 .cse2 .cse4 .cse38 .cse24 .cse6 .cse20 .cse22 .cse9 .cse10 .cse12 .cse14 .cse16) (and .cse2 .cse40 .cse23 .cse41 .cse24 .cse6 .cse42 .cse19 .cse20 .cse29 .cse12 .cse31 .cse43 .cse14 .cse15 .cse16 .cse18 .cse44) (and .cse0 .cse45 .cse1 .cse46 .cse25 .cse2 .cse26 .cse4 .cse47 .cse48 .cse7 .cse8 .cse28 .cse27 .cse9 .cse49 .cse11 .cse12 .cse30 .cse14 .cse16 .cse18 .cse32) (and .cse21 .cse2 .cse4 .cse23 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse6 .cse20 .cse22 .cse27 .cse7 .cse8 .cse29 .cse11 .cse12 .cse13 .cse31 .cse14 .cse15 .cse16 .cse18) (and .cse2 .cse4 .cse40 .cse23 .cse41 .cse24 .cse6 .cse42 .cse20 .cse27 .cse29 .cse12 .cse31 .cse14 .cse43 .cse15 .cse16 .cse18 .cse44) (and .cse37 .cse19 .cse20 .cse9 .cse10 .cse21 .cse2 .cse38 .cse24) (and .cse1 .cse11 (or (and .cse20 .cse9 .cse25 .cse2 .cse14 .cse4 .cse16 .cse18 .cse39) (and .cse20 .cse9 .cse2 .cse14 .cse4 .cse15 .cse16 .cse18 .cse6)) .cse12) (and .cse25 .cse2 .cse26 .cse4 .cse40 .cse23 .cse33 .cse20 .cse27 .cse28 .cse29 .cse11 .cse12 .cse34 .cse31 .cse30 .cse14 .cse16 .cse18 .cse35 .cse36) (and .cse0 .cse45 .cse1 .cse46 .cse2 .cse25 .cse26 .cse4 .cse47 .cse48 .cse9 .cse10 .cse28 .cse7 .cse8 .cse11 .cse49 .cse12 .cse30 .cse14 .cse16 .cse18 .cse32) (and .cse20 .cse9 .cse2 .cse4 .cse23) (and .cse0 .cse21 .cse2 .cse25 .cse4 .cse23 .cse33 .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse34 .cse30 .cse14 .cse16 .cse18 .cse35 .cse36)))) [2020-12-09 05:42:57,694 INFO L258 CegarLoopResult]: At program point L1061(lines 1054 1080) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 1 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1)) (let ((.cse15 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (= ~c_req_type~0 1) (= ULTIMATE.start_s_run_~req_type~1 1) .cse14 (<= ~c_req_d~0 .cse15) .cse16 (<= .cse15 ULTIMATE.start_m_run_~req_d~0) (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 .cse15) .cse10 .cse17 .cse11 .cse12 (<= .cse15 ~c_req_d~0))) (and .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse14 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse3 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse16 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse17 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse6 .cse7 .cse8 .cse10 .cse3 .cse17 .cse14 .cse11 .cse12 .cse16))) [2020-12-09 05:42:57,694 INFO L262 CegarLoopResult]: For program point L1260(lines 1260 1313) no Hoare annotation was computed. [2020-12-09 05:42:57,694 INFO L258 CegarLoopResult]: At program point L1194(lines 1187 1231) the Hoare annotation is: (and (= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= ~m_run_pc~0 0) (= ~c_req_a~0 0) (= ~a_t~0 0) (= ~s_run_pc~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~m_run_st~0 0) (= ~s_run_st~0 0) (<= 2 ~c_read_req_ev~0) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0)) [2020-12-09 05:42:57,694 INFO L262 CegarLoopResult]: For program point L71(lines 71 76) no Hoare annotation was computed. [2020-12-09 05:42:57,695 INFO L258 CegarLoopResult]: At program point L864(lines 864 868) the Hoare annotation is: (let ((.cse27 (<= 51 ~c_req_d~0)) (.cse29 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse31 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse32 (<= ~c_req_d~0 51)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse21 (= ~c_empty_req~0 1)) (.cse23 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse33 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse22 (<= 1 ~a_t~0)) (.cse25 (<= 1 ~c_req_a~0)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse11 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse28 (<= ~c_req_a~0 1)) (.cse13 (= ~s_memory0~0 50)) (.cse30 (= ULTIMATE.start_m_run_~a~0 1)) (.cse34 (= ~req_tt_a~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse26 (= ~c_req_type~0 1)) (.cse24 (= ~m_run_pc~0 3)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ~a_t~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse12 (not (= ~m_run_st~0 0))) (.cse14 (<= 2 ~c_read_req_ev~0)) (.cse16 (<= ~c_empty_req~0 0)) (.cse17 (<= 2 ~c_m_ev~0)) (.cse18 (= ULTIMATE.start_m_run_~a~0 0)) (.cse19 (<= 2 ~c_write_req_ev~0)) (.cse20 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse13 .cse14 (or (and .cse8 .cse21 .cse2 .cse22 .cse3 .cse17 .cse5 .cse19 .cse20 .cse23) (and .cse8 .cse21 .cse2 .cse3 .cse17 .cse18 .cse5 .cse19 .cse20 .cse7))) (and .cse21 .cse13 .cse14 .cse2 .cse3 .cse17 .cse18 .cse5 .cse24 .cse19 .cse20 .cse7) (and .cse2 .cse3 .cse22 .cse25 .cse5 .cse26 .cse24 .cse27 .cse8 .cse28 .cse12 .cse13 .cse14 .cse29 .cse16 .cse30 .cse17 .cse19 .cse20 .cse31 .cse32) (and .cse8 .cse21 .cse2 .cse3 .cse5 .cse24) (and .cse0 .cse1 .cse33 (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 .cse22 .cse25 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse11 .cse28 .cse21 (= 51 ~c_rsp_d~0) .cse13 .cse14 .cse30 .cse17 .cse19 .cse20 .cse34) (and .cse0 .cse2 .cse22 .cse3 .cse5 .cse24 .cse27 .cse10 .cse11 .cse21 .cse13 .cse29 .cse14 .cse30 .cse17 .cse19 .cse20 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse7 .cse10 .cse11 .cse21 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse20) (and (= ~c_m_lock~0 0) .cse1 .cse8 .cse21 .cse2 .cse14 .cse22 .cse3 .cse17 .cse5 .cse19 .cse23) (and .cse0 .cse1 .cse33 .cse2 .cse22 .cse3 .cse25 .cse5 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse30 .cse16 .cse17 .cse19 .cse20 .cse34) (let ((.cse35 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse2 .cse3 .cse5 .cse26 .cse24 (<= ~c_req_d~0 .cse35) .cse6 .cse7 (<= .cse35 ULTIMATE.start_m_run_~req_d~0) .cse8 .cse12 .cse14 .cse16 .cse17 (<= ULTIMATE.start_m_run_~req_d~0 .cse35) .cse18 .cse19 .cse20 (<= .cse35 ~c_req_d~0))))) [2020-12-09 05:42:57,695 INFO L258 CegarLoopResult]: At program point L732(lines 725 742) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)) (let ((.cse12 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 (= .cse12 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse3 (= .cse12 ~c_rsp_d~0) (= ~a_t~0 0) .cse4 .cse7 .cse5 .cse6 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50))))) [2020-12-09 05:42:57,695 INFO L258 CegarLoopResult]: At program point L600(lines 593 610) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (= ~c_write_req_ev~0 1)) (.cse11 (<= ~c_empty_req~0 0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 0 ~a_t~0) .cse1 .cse2 (= ~c_req_a~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) .cse8 .cse9 .cse10 (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12 .cse13))) [2020-12-09 05:42:57,695 INFO L258 CegarLoopResult]: At program point L336(lines 329 373) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10))) [2020-12-09 05:42:57,695 INFO L262 CegarLoopResult]: For program point L1261(lines 1261 1265) no Hoare annotation was computed. [2020-12-09 05:42:57,695 INFO L258 CegarLoopResult]: At program point L204(lines 174 205) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse14 (= ~a_t~0 0)) (.cse0 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (not (= ~m_run_st~0 0))) (.cse2 (<= 2 ~c_read_req_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse6 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse15 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse8 (<= ~m_run_pc~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (and .cse0 .cse1 .cse2 (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (<= 6 ~m_run_pc~0))) .cse12 .cse13 .cse14) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse5 .cse7 (= ~m_run_pc~0 3) .cse14 .cse3 .cse4 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse2 (= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse9 .cse10 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse5 .cse8 (= ~c_req_a~0 0) .cse14 .cse11 .cse0 .cse3 .cse15 .cse4 (= ~c_req_type~0 0) .cse1 .cse2 .cse12 .cse6 .cse13 .cse9 .cse10) (and .cse15 .cse4 (not (= ~s_run_st~0 0)) .cse5 .cse13 .cse8 .cse11 (not (= ULTIMATE.start_m_run_~req_type~0 0)))))) [2020-12-09 05:42:57,695 INFO L262 CegarLoopResult]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L258 CegarLoopResult]: At program point L931(lines 924 959) the Hoare annotation is: (let ((.cse33 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= 1 ~a_t~0)) (.cse3 (<= 1 ~c_req_a~0)) (.cse9 (<= ~c_req_a~0 1)) (.cse13 (= ULTIMATE.start_m_run_~a~0 1)) (.cse17 (= ~s_memory1~0 51)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (= ~c_req_type~0 0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (<= ~c_req_d~0 .cse33)) (.cse23 (= ~c_req_a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse30 (<= .cse33 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (not (= ~m_run_st~0 0))) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (<= ULTIMATE.start_m_run_~req_d~0 .cse33)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse26 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse32 (<= .cse33 ~c_req_d~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 .cse14 .cse15 .cse16 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse17 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse2 .cse1 .cse3 .cse4 .cse19 .cse8 .cse20 .cse10 .cse21 .cse22 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 (= ~req_tt_a~0 1)) (and .cse17 .cse18 .cse0 .cse1 (= ~req_tt_a~0 0) .cse4 .cse23 .cse24 .cse19 .cse8 .cse20 .cse21 .cse22 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse14 .cse26 .cse15 .cse16) (and .cse27 .cse28 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32) (and .cse27 .cse28 .cse0 .cse1 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 (= ~s_run_pc~0 0) .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32)))) [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L733(lines 725 742) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L601(lines 482 834) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L403(lines 403 456) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L73(lines 73 76) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L998-1(lines 873 1103) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L404(lines 404 408) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L338(lines 338 342) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L258 CegarLoopResult]: At program point L272(lines 265 282) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (not (= ~c_req_type~0 0))) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse2 .cse3 (= ~c_req_type~0 1) (<= ~c_req_d~0 .cse8) .cse5 (= ~a_t~0 0) .cse6 .cse7 (<= .cse8 ULTIMATE.start_m_run_~req_d~0) (= ULTIMATE.start_m_run_~req_type~0 1) .cse0 .cse1 (= ~c_write_req_ev~0 1) (<= 2 ~c_read_req_ev~0) (<= ~c_empty_req~0 0) (<= ULTIMATE.start_m_run_~req_d~0 .cse8) (<= 2 ~c_m_ev~0) .cse4 (<= 1 ~c_m_lock~0) (<= .cse8 ~c_req_d~0))))) [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L1131(lines 1131 1138) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L999(lines 998 1022) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L933(lines 933 937) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point L273(lines 265 282) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,696 INFO L258 CegarLoopResult]: At program point L142-2(lines 142 170) the Hoare annotation is: (let ((.cse19 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse10 (= ~s_run_pc~0 0)) (.cse0 (= ~c_m_lock~0 0)) (.cse11 (not (= ~s_run_st~0 0))) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse13 (<= ~m_run_pc~0 0)) (.cse14 (= ~c_req_a~0 0)) (.cse15 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse3 (= ~a_t~0 0)) (.cse16 (<= .cse19 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse17 (not (= ~m_run_st~0 0))) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse18 (<= ULTIMATE.start_m_run_~req_d~0 .cse19)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0))) (or (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse0 .cse1 .cse2 (= ~m_run_pc~0 3) .cse3 .cse4 .cse5 .cse6 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse7 (= ULTIMATE.start_m_run_~a~0 1) .cse8 .cse9 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0)) (and .cse4 .cse0 .cse10 .cse5 .cse6 .cse11 .cse1 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse3 .cse4 .cse16 .cse5 .cse10 (= ~c_req_type~0 0) .cse6 .cse17 .cse7 .cse18 .cse8 .cse12 .cse9) (and .cse0 .cse11 .cse1 .cse2 .cse13 .cse14 .cse15 .cse3 .cse16 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse8 .cse12 .cse9)))) [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L671(lines 671 724) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L143(lines 142 170) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L672(lines 672 676) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L258 CegarLoopResult]: At program point L1267(lines 1260 1313) the Hoare annotation is: (let ((.cse12 (= ULTIMATE.start_m_run_~a~0 1)) (.cse3 (<= 1 ~a_t~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse17 (= ~m_run_pc~0 6)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse20 (= ~a_t~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (not (= ~m_run_st~0 0))) (.cse10 (= ~s_memory0~0 50)) (.cse11 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and (= ~s_run_pc~0 0) .cse16 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse5 (= ~c_req_a~0 0)) (and .cse16 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse17 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ~c_req_a~0 1) .cse8 (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~req_tt_a~0 1)) (and .cse17 .cse9 .cse10 .cse11 (or (and .cse16 .cse8 .cse1 .cse2 .cse3 .cse13 .cse4 .cse14 .cse15 .cse18) (and .cse16 .cse8 .cse1 .cse2 .cse13 .cse19 .cse4 .cse14 .cse15 .cse20))) (and (= ~c_m_lock~0 0) .cse17 .cse1 .cse3 .cse2 .cse4 .cse16 .cse8 .cse9 .cse11 .cse13 .cse14 .cse18) (and .cse0 .cse17 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse20 .cse8 .cse6 .cse7 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse19 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse2 .cse4 .cse5 .cse20 .cse8 .cse9 .cse10 .cse11 .cse13 .cse19 .cse14 .cse15))) [2020-12-09 05:42:57,697 INFO L258 CegarLoopResult]: At program point L1069(lines 1062 1079) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 1 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 1)) (.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse16 (= ~a_t~0 0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1)) (let ((.cse15 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse13 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (= ~c_req_type~0 1) (= ULTIMATE.start_s_run_~req_type~1 1) .cse14 (<= ~c_req_d~0 .cse15) .cse16 (<= .cse15 ULTIMATE.start_m_run_~req_d~0) (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~req_d~0 .cse15) .cse10 .cse17 .cse11 .cse12 (<= .cse15 ~c_req_d~0))) (and .cse13 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 .cse14 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse3 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse16 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse17 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse6 .cse7 .cse8 .cse10 .cse3 .cse17 .cse14 .cse11 .cse12 .cse16))) [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L262 CegarLoopResult]: For program point L211(lines 211 264) no Hoare annotation was computed. [2020-12-09 05:42:57,697 INFO L258 CegarLoopResult]: At program point L1202(lines 1195 1230) the Hoare annotation is: (and (= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= ~m_run_pc~0 0) (= ~c_req_a~0 0) (= ~a_t~0 0) (= ~s_run_pc~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~m_run_st~0 0) (= ~s_run_st~0 0) (<= 2 ~c_read_req_ev~0) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0)) [2020-12-09 05:42:57,698 INFO L262 CegarLoopResult]: For program point L1070(lines 873 1103) no Hoare annotation was computed. [2020-12-09 05:42:57,698 INFO L258 CegarLoopResult]: At program point L13-3(lines 1 1373) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 .cse10 (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)) (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse7 .cse8 .cse6 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-09 05:42:57,698 INFO L258 CegarLoopResult]: At program point L13-4(lines 69 79) the Hoare annotation is: (let ((.cse5 (= ~a_t~0 0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse14 (= 2 ~s_run_pc~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 (= ~c_req_type~0 1) .cse2 .cse3 (<= ~c_req_d~0 .cse4) .cse5 (<= .cse4 ULTIMATE.start_m_run_~req_d~0) .cse6 (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 (<= ULTIMATE.start_m_run_~req_d~0 .cse4) .cse10 .cse11 .cse12 .cse13 (<= .cse4 ~c_req_d~0))) (and .cse1 .cse14 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~a_t~0) .cse1 .cse14 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse8 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse9 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse12 .cse13 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,698 INFO L258 CegarLoopResult]: At program point L410(lines 403 456) the Hoare annotation is: (let ((.cse0 (= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse8 (= ~a_t~0 0)))) [2020-12-09 05:42:57,698 INFO L258 CegarLoopResult]: At program point L344(lines 337 372) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10))) [2020-12-09 05:42:57,698 INFO L262 CegarLoopResult]: For program point L1335(lines 1335 1339) no Hoare annotation was computed. [2020-12-09 05:42:57,698 INFO L262 CegarLoopResult]: For program point L1335-1(lines 1167 1346) no Hoare annotation was computed. [2020-12-09 05:42:57,698 INFO L262 CegarLoopResult]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2020-12-09 05:42:57,698 INFO L262 CegarLoopResult]: For program point L212(lines 212 216) no Hoare annotation was computed. [2020-12-09 05:42:57,698 INFO L258 CegarLoopResult]: At program point L939(lines 932 958) the Hoare annotation is: (let ((.cse33 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= 1 ~a_t~0)) (.cse3 (<= 1 ~c_req_a~0)) (.cse9 (<= ~c_req_a~0 1)) (.cse13 (= ULTIMATE.start_m_run_~a~0 1)) (.cse17 (= ~s_memory1~0 51)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (= ~c_req_type~0 0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (<= ~c_req_d~0 .cse33)) (.cse23 (= ~c_req_a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse30 (<= .cse33 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (not (= ~m_run_st~0 0))) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (<= ULTIMATE.start_m_run_~req_d~0 .cse33)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse26 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse32 (<= .cse33 ~c_req_d~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 .cse14 .cse15 .cse16 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse17 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse2 .cse1 .cse3 .cse4 .cse19 .cse8 .cse20 .cse10 .cse21 .cse22 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 (= ~req_tt_a~0 1)) (and .cse17 .cse18 .cse0 .cse1 (= ~req_tt_a~0 0) .cse4 .cse23 .cse24 .cse19 .cse8 .cse20 .cse21 .cse22 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse14 .cse26 .cse15 .cse16) (and .cse27 .cse28 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32) (and .cse27 .cse28 .cse0 .cse1 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 (= ~s_run_pc~0 0) .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32)))) [2020-12-09 05:42:57,699 INFO L258 CegarLoopResult]: At program point L873-1(lines 857 1108) the Hoare annotation is: (let ((.cse10 (not (= ~s_run_st~0 0))) (.cse12 (= ~c_req_a~0 0)) (.cse15 (= ~s_run_pc~0 0)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse16 (= ~m_run_st~0 0)) (.cse18 (= ~s_memory1~0 51)) (.cse19 (= ~m_run_pc~0 6)) (.cse1 (<= 1 ~a_t~0)) (.cse20 (= 2 ~s_run_pc~0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ULTIMATE.start_m_run_~a~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (= ~s_memory0~0 50)) (.cse5 (<= 2 ~c_read_req_ev~0)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse2 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse13 (= ~a_t~0 0))) (or (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse2 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse3 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse4 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (let ((.cse11 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse10 .cse0 (= ~c_req_type~0 1) .cse2 (<= ~c_req_d~0 .cse11) .cse12 .cse13 (<= .cse11 ULTIMATE.start_m_run_~req_d~0) .cse14 .cse15 (not .cse16) .cse5 (<= ~c_empty_req~0 0) (<= ULTIMATE.start_m_run_~req_d~0 .cse11) .cse7 .cse17 .cse8 .cse9 (<= .cse11 ~c_req_d~0))) (and (= ~c_m_lock~0 0) .cse10 .cse0 (<= ~m_run_pc~0 0) .cse12 .cse13 .cse15 .cse14 (= ~c_req_type~0 0) .cse3 .cse16 .cse5 .cse7 .cse8) (and .cse18 .cse19 .cse0 (= ~req_tt_a~0 0) .cse20 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse13 .cse21 .cse22 .cse3 .cse4 .cse5 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse17 .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9) (and .cse18 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse19 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse0 (<= 1 ~c_req_a~0) .cse20 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse21 .cse22 (<= ~c_req_a~0 1) .cse3 (= 51 ~c_rsp_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse9 (= ~req_tt_a~0 1)) (and .cse3 .cse4 .cse5 .cse0 .cse7 .cse17 .cse2 .cse8 .cse9 .cse13))) [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L808(lines 808 812) no Hoare annotation was computed. [2020-12-09 05:42:57,699 INFO L258 CegarLoopResult]: At program point L478(lines 130 479) the Hoare annotation is: (and (= ~s_memory1~0 51) (= ~c_m_lock~0 0) (<= 1 ~a_t~0) (<= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (<= 51 ~c_req_d~0) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 2 ~c_read_req_ev~0) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L412(lines 412 416) no Hoare annotation was computed. [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L346(lines 346 350) no Hoare annotation was computed. [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L941(lines 941 945) no Hoare annotation was computed. [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L876-1(lines 873 1103) no Hoare annotation was computed. [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L744(lines 744 750) no Hoare annotation was computed. [2020-12-09 05:42:57,699 INFO L258 CegarLoopResult]: At program point L744-1(lines 744 750) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (let ((.cse3 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 (= .cse3 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse4 (= ~a_t~0 0) (= .cse3 ~c_rsp_d~0) .cse5 .cse6 .cse7 .cse8 (= ~s_memory0~0 50) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50))) (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse6 .cse7 .cse8 (<= ~c_req_a~0 1) (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,699 INFO L258 CegarLoopResult]: At program point L678(lines 671 724) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)) (let ((.cse13 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 (= .cse13 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse3 (= .cse13 ~c_rsp_d~0) (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~s_memory0~0 50) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50))))) [2020-12-09 05:42:57,699 INFO L262 CegarLoopResult]: For program point L877(lines 876 900) no Hoare annotation was computed. [2020-12-09 05:42:57,700 INFO L258 CegarLoopResult]: At program point L1142(lines 1116 1157) the Hoare annotation is: (let ((.cse31 (= ~m_run_st~0 0)) (.cse13 (= ~s_run_st~0 0)) (.cse44 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse9 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse25 (= ~req_tt_a~0 1)) (.cse32 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse4 (= ~c_req_type~0 0)) (.cse34 (<= ~c_req_d~0 .cse44)) (.cse35 (<= .cse44 ULTIMATE.start_m_run_~req_d~0)) (.cse36 (<= ULTIMATE.start_m_run_~req_d~0 .cse44)) (.cse37 (<= .cse44 ~c_req_d~0)) (.cse29 (= ~c_m_lock~0 0)) (.cse0 (= ~s_run_pc~0 0)) (.cse2 (not .cse13)) (.cse30 (<= ~m_run_pc~0 0)) (.cse6 (= ~c_req_a~0 0)) (.cse10 (<= 1 ~a_t~0)) (.cse11 (<= 1 ~c_req_a~0)) (.cse33 (= ~c_req_type~0 1)) (.cse40 (<= 51 ~c_req_d~0)) (.cse16 (<= ~c_req_a~0 1)) (.cse17 (not .cse31)) (.cse41 (<= ULTIMATE.start_m_run_~req_d~0 51)) (.cse21 (<= ~c_empty_req~0 0)) (.cse20 (= ULTIMATE.start_m_run_~a~0 1)) (.cse42 (<= 51 ULTIMATE.start_m_run_~req_d~0)) (.cse43 (<= ~c_req_d~0 51)) (.cse7 (= ~s_memory1~0 51)) (.cse8 (= ~m_run_pc~0 6)) (.cse38 (= ~req_tt_a~0 0)) (.cse28 (= ~a_t~0 0)) (.cse14 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse15 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse18 (= ~s_memory0~0 50)) (.cse19 (<= 2 ~c_read_req_ev~0)) (.cse39 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse22 (<= 2 ~c_m_ev~0)) (.cse27 (= ULTIMATE.start_m_run_~a~0 0)) (.cse23 (<= 2 ~c_write_req_ev~0)) (.cse24 (<= 1 ~c_m_lock~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse26 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse3 .cse11 .cse12 .cse1 .cse4 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse26 .cse18 .cse19 .cse3 .cse22 .cse12 .cse27 .cse23 .cse5 .cse24 .cse28) (and .cse29 .cse3 .cse30 .cse6 .cse28 .cse0 .cse1 .cse4 .cse26 .cse31 .cse19 .cse22 .cse23) (and .cse29 .cse8 .cse1 .cse26 .cse19 .cse3 .cse10 .cse22 .cse12 .cse23 .cse32) (and .cse7 .cse8 .cse9 (= ULTIMATE.start_s_memory_read_~i 1) .cse3 .cse10 .cse11 .cse12 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse26 .cse14 .cse15 .cse16 .cse18 (= 51 ~c_rsp_d~0) .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse8 .cse18 .cse19 (or (and .cse1 .cse26 .cse10 .cse3 .cse22 .cse12 .cse23 .cse24 .cse32) (and .cse1 .cse26 .cse3 .cse22 .cse12 .cse27 .cse23 .cse24 .cse28))) (and .cse29 .cse2 .cse3 .cse12 .cse30 .cse6 .cse28 .cse1 .cse4 .cse26 .cse31 .cse19 .cse22 .cse23) (and .cse3 .cse33 .cse5 .cse34 .cse6 .cse28 .cse35 .cse0 .cse1 .cse17 .cse19 .cse21 .cse36 .cse22 .cse27 .cse23 .cse24 .cse37) (and .cse7 .cse8 .cse3 .cse38 .cse12 .cse6 .cse28 .cse1 .cse4 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse39 .cse21 .cse22 .cse27 .cse23 .cse24) (and .cse3 .cse12 .cse33 .cse5 .cse34 .cse6 .cse28 .cse35 .cse1 .cse13 .cse17 .cse19 .cse21 .cse22 .cse36 .cse27 .cse23 .cse24 .cse37) (and .cse29 .cse0 .cse1 .cse26 .cse31 .cse2 .cse3 .cse30 .cse6) (and .cse7 .cse3 .cse10 .cse12 .cse5 .cse40 .cse26 .cse14 .cse15 .cse18 .cse19 .cse41 .cse20 .cse22 .cse23 .cse24 .cse42 .cse43) (and .cse10 .cse3 .cse11 .cse12 .cse33 .cse5 .cse40 .cse1 .cse13 .cse16 .cse17 .cse18 .cse19 .cse41 .cse21 .cse20 .cse22 .cse23 .cse24 .cse42 .cse43) (and .cse7 .cse8 .cse3 .cse38 .cse12 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse28 .cse14 .cse15 .cse26 .cse18 .cse19 .cse39 .cse22 .cse27 .cse23 .cse24 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse26 .cse3 .cse12 .cse5)))) [2020-12-09 05:42:57,700 INFO L262 CegarLoopResult]: For program point L680(lines 680 684) no Hoare annotation was computed. [2020-12-09 05:42:57,700 INFO L258 CegarLoopResult]: At program point L482-2(lines 482 834) the Hoare annotation is: (let ((.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_memory1~0 51)) (.cse8 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse9 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse10 (= ~s_memory0~0 50)) (.cse1 (= ~c_m_lock~0 0)) (.cse15 (= ~m_run_pc~0 6)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_read_req_ev~0)) (.cse2 (<= 1 ~a_t~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse16 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 2 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13 (<= ~c_req_d~0 51)) (and .cse1 .cse6 .cse7 .cse2 .cse3 .cse12 .cse4 .cse5 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse16 .cse4 (= ~a_t~0 0) .cse6 .cse8 .cse9 .cse7 .cse10 .cse11 (= ULTIMATE.start_m_run_~a~0 1) .cse12 .cse13) (and .cse1 .cse15 .cse6 .cse7 .cse11 .cse2 .cse3 .cse12 .cse16 .cse4 .cse13 .cse14))) [2020-12-09 05:42:57,700 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 05:42:57,700 INFO L258 CegarLoopResult]: At program point L1275(lines 1268 1312) the Hoare annotation is: (let ((.cse12 (= ULTIMATE.start_m_run_~a~0 1)) (.cse3 (<= 1 ~a_t~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse17 (= ~m_run_pc~0 6)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse20 (= ~a_t~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (not (= ~m_run_st~0 0))) (.cse10 (= ~s_memory0~0 50)) (.cse11 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and (= ~s_run_pc~0 0) .cse16 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse5 (= ~c_req_a~0 0)) (and .cse16 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse17 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ~c_req_a~0 1) .cse8 (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~req_tt_a~0 1)) (and .cse17 .cse9 .cse10 .cse11 (or (and .cse16 .cse8 .cse1 .cse2 .cse3 .cse13 .cse4 .cse14 .cse15 .cse18) (and .cse16 .cse8 .cse1 .cse2 .cse13 .cse19 .cse4 .cse14 .cse15 .cse20))) (and (= ~c_m_lock~0 0) .cse17 .cse1 .cse3 .cse2 .cse4 .cse16 .cse8 .cse9 .cse11 .cse13 .cse14 .cse18) (and .cse0 .cse17 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse20 .cse8 .cse6 .cse7 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse19 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse2 .cse4 .cse5 .cse20 .cse8 .cse9 .cse10 .cse11 .cse13 .cse19 .cse14 .cse15))) [2020-12-09 05:42:57,700 INFO L258 CegarLoopResult]: At program point L218(lines 211 264) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse7 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse11 (not (= ~m_run_st~0 0))) (.cse13 (<= 2 ~c_read_req_ev~0)) (.cse12 (= ~c_write_req_ev~0 1)) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse20 (= 2 ~s_run_pc~0)) (.cse1 (= ~c_req_type~0 1)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse14 (<= ~c_empty_req~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse3 (<= ~c_req_d~0 .cse21)) (.cse5 (= ~a_t~0 0)) (.cse19 (<= .cse21 ~c_req_d~0)) (.cse9 (= ~s_run_pc~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~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 (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse0 (<= 1 ~c_req_a~0) .cse20 .cse1 (= ~m_run_pc~0 3) (<= 51 ~c_req_d~0) .cse5 .cse8 .cse10 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (= ~s_memory0~0 50) .cse13 .cse12 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse14 .cse16 .cse18 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse7 .cse11 .cse13 .cse12 (or (and .cse8 .cse10 .cse0 .cse16 .cse20 .cse1 .cse18 .cse4 .cse6 (<= 6 ~m_run_pc~0)) (and .cse8 .cse10 .cse0 .cse16 .cse20 .cse1 .cse2 .cse18 .cse4 .cse6)) .cse14 .cse15 .cse17 .cse3 .cse5 .cse19) (and .cse9 .cse10 (not (= ~s_run_st~0 0)) .cse0 (not (= ~c_req_type~0 0)) .cse2 .cse17 .cse4 .cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0)))))) [2020-12-09 05:42:57,700 INFO L262 CegarLoopResult]: For program point L483(lines 482 834) no Hoare annotation was computed. [2020-12-09 05:42:57,700 INFO L265 CegarLoopResult]: At program point L1342(lines 1164 1347) the Hoare annotation is: true [2020-12-09 05:42:57,701 INFO L258 CegarLoopResult]: At program point L285-2(lines 285 313) the Hoare annotation is: (let ((.cse7 (= 2 ~s_run_pc~0)) (.cse26 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (= ~s_run_st~0 0)) (.cse9 (<= 51 ~c_req_d~0)) (.cse24 (not (= ~m_run_st~0 0))) (.cse11 (= ~s_memory0~0 50)) (.cse17 (<= ~c_req_d~0 51)) (.cse4 (not (= ~c_req_type~0 0))) (.cse8 (= ~c_req_type~0 1)) (.cse18 (<= ~c_req_d~0 .cse26)) (.cse6 (= ~c_req_a~0 0)) (.cse10 (= ~a_t~0 0)) (.cse19 (<= .cse26 ULTIMATE.start_m_run_~req_d~0)) (.cse0 (= ~s_run_pc~0 0)) (.cse12 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= ~c_empty_req~0 0)) (.cse20 (<= ULTIMATE.start_m_run_~req_d~0 .cse26)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse5 (not .cse7)) (.cse21 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse22 (<= .cse26 ~c_req_d~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse23 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse25 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6) (and .cse3 (<= 1 ~c_req_a~0) .cse4 .cse7 .cse8 .cse9 .cse10 .cse1 .cse2 (<= ~c_req_a~0 1) .cse11 .cse12 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 (= ULTIMATE.start_m_run_~a~0 1) .cse14 .cse15 .cse16 (<= 51 ULTIMATE.start_m_run_~req_d~0) .cse17) (and .cse3 .cse4 .cse7 .cse8 .cse18 .cse6 .cse10 .cse19 .cse1 .cse2 .cse12 .cse13 .cse20 .cse14 .cse21 .cse15 .cse16 .cse22) (and .cse23 .cse24 .cse11 .cse12 .cse3 .cse14 .cse7 .cse21 .cse25 .cse15 .cse16 .cse10) (and (= ~s_memory1~0 51) (<= 1 ~a_t~0) .cse3 .cse7 .cse25 .cse9 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse23 .cse24 .cse11 .cse12 .cse14 .cse15 .cse16 (<= 1 ULTIMATE.start_m_run_~a~0) .cse17) (and .cse3 .cse4 .cse8 .cse18 .cse6 .cse10 .cse19 .cse0 .cse1 .cse12 .cse13 .cse20 .cse14 .cse5 .cse21 .cse15 .cse16 .cse22) (and .cse1 .cse23 .cse3 .cse7 .cse25)))) [2020-12-09 05:42:57,701 INFO L258 CegarLoopResult]: At program point L1210(lines 1203 1229) the Hoare annotation is: (and (= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= ~m_run_pc~0 0) (= ~c_req_a~0 0) (= ~a_t~0 0) (= ~s_run_pc~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~m_run_st~0 0) (= ~s_run_st~0 0) (<= 2 ~c_read_req_ev~0) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0)) [2020-12-09 05:42:57,701 INFO L258 CegarLoopResult]: At program point L814(lines 807 824) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~c_m_lock~0 0)) (.cse2 (= ~m_run_pc~0 6)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse5 (= .cse4 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (= ~s_memory0~0 50) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse3 (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 (= 51 ~c_rsp_d~0) .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,701 INFO L262 CegarLoopResult]: For program point L616(lines 616 620) no Hoare annotation was computed. [2020-12-09 05:42:57,701 INFO L258 CegarLoopResult]: At program point L418(lines 411 455) the Hoare annotation is: (let ((.cse0 (= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse8 (= ~a_t~0 0)))) [2020-12-09 05:42:57,701 INFO L258 CegarLoopResult]: At program point L352(lines 345 371) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10))) [2020-12-09 05:42:57,701 INFO L262 CegarLoopResult]: For program point L286(lines 285 313) no Hoare annotation was computed. [2020-12-09 05:42:57,701 INFO L262 CegarLoopResult]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2020-12-09 05:42:57,701 INFO L262 CegarLoopResult]: For program point L220(lines 220 224) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L258 CegarLoopResult]: At program point L947(lines 940 957) the Hoare annotation is: (let ((.cse33 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (<= 1 ~a_t~0)) (.cse3 (<= 1 ~c_req_a~0)) (.cse9 (<= ~c_req_a~0 1)) (.cse13 (= ULTIMATE.start_m_run_~a~0 1)) (.cse17 (= ~s_memory1~0 51)) (.cse18 (= ~m_run_pc~0 6)) (.cse19 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse20 (= ~c_req_type~0 0)) (.cse21 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse22 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse12 (= ~s_memory0~0 50)) (.cse4 (= 2 ~s_run_pc~0)) (.cse27 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse28 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (not (= ~s_run_st~0 0))) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (<= ~c_req_d~0 .cse33)) (.cse23 (= ~c_req_a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse30 (<= .cse33 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (not (= ~m_run_st~0 0))) (.cse25 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse31 (<= ULTIMATE.start_m_run_~req_d~0 .cse33)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse26 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse32 (<= .cse33 ~c_req_d~0))) (or (and (<= 51 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse13 .cse14 .cse15 .cse16 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse17 .cse18 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) .cse0 .cse2 .cse1 .cse3 .cse4 .cse19 .cse8 .cse20 .cse10 .cse21 .cse22 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 (= ~req_tt_a~0 1)) (and .cse17 .cse18 .cse0 .cse1 (= ~req_tt_a~0 0) .cse4 .cse23 .cse24 .cse19 .cse8 .cse20 .cse21 .cse22 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse25 .cse14 .cse26 .cse15 .cse16) (and .cse27 .cse28 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32) (and .cse27 .cse28 .cse0 .cse1 .cse5 .cse6 .cse7 .cse29 .cse23 .cse24 .cse30 .cse8 (= ~s_run_pc~0 0) .cse10 .cse11 .cse25 .cse31 .cse14 .cse26 .cse15 .cse16 .cse32)))) [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L815(lines 807 824) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L1146(lines 1146 1153) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L948(lines 873 1103) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L420(lines 420 424) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L354(lines 354 358) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L258 CegarLoopResult]: At program point L686(lines 679 723) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)) (let ((.cse13 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 (= .cse13 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse3 (= .cse13 ~c_rsp_d~0) (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~s_memory0~0 50) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50))))) [2020-12-09 05:42:57,702 INFO L258 CegarLoopResult]: At program point L554(lines 524 555) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 .cse2 .cse3 (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 1) .cse9 .cse10 .cse11) (and .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= ~m_run_pc~0 3) .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 .cse11 (<= ~c_req_d~0 51)))) [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L753(lines 753 806) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L754(lines 754 758) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L262 CegarLoopResult]: For program point L688(lines 688 692) no Hoare annotation was computed. [2020-12-09 05:42:57,702 INFO L258 CegarLoopResult]: At program point L622(lines 615 632) the Hoare annotation is: false [2020-12-09 05:42:57,702 INFO L258 CegarLoopResult]: At program point L1283(lines 1276 1311) the Hoare annotation is: (let ((.cse12 (= ULTIMATE.start_m_run_~a~0 1)) (.cse2 (<= 1 ~a_t~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse17 (= ~m_run_pc~0 6)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse20 (= ~a_t~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (not (= ~m_run_st~0 0))) (.cse10 (= ~s_memory0~0 50)) (.cse11 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and (= ~s_run_pc~0 0) .cse16 .cse1 .cse3 (not (= ~c_req_type~0 0)) .cse5 (= ~c_req_a~0 0)) (and .cse16 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse17 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse3 .cse2 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~req_tt_a~0 1)) (and .cse17 .cse9 .cse10 .cse11 (or (and .cse16 .cse6 .cse1 .cse3 .cse2 .cse13 .cse4 .cse14 .cse15 .cse18) (and .cse16 .cse6 .cse1 .cse3 .cse13 .cse19 .cse4 .cse14 .cse15 .cse20))) (and (= ~c_m_lock~0 0) .cse17 .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse9 .cse11 .cse13 .cse14 .cse18) (and .cse0 .cse17 .cse1 .cse3 (= ~req_tt_a~0 0) .cse4 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse19 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse9 .cse10 .cse11 .cse13 .cse19 .cse14 .cse15))) [2020-12-09 05:42:57,703 INFO L258 CegarLoopResult]: At program point L226(lines 219 263) the Hoare annotation is: (let ((.cse21 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse9 (= ~s_run_pc~0 0)) (.cse7 (<= .cse21 ULTIMATE.start_m_run_~req_d~0)) (.cse11 (not (= ~m_run_st~0 0))) (.cse13 (<= 2 ~c_read_req_ev~0)) (.cse12 (= ~c_write_req_ev~0 1)) (.cse14 (<= ~c_empty_req~0 0)) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse20 (= 2 ~s_run_pc~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (<= ~m_run_pc~0 0)) (.cse18 (<= 1 ~c_m_lock~0)) (.cse4 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~req_d~0 .cse21)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (<= ~c_req_d~0 .cse21)) (.cse5 (= ~a_t~0 0)) (.cse19 (<= .cse21 ~c_req_d~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse9 .cse10 (not (= ~s_run_st~0 0)) .cse0 (not (= ~c_req_type~0 0)) .cse2 .cse17 .cse4 .cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) .cse0 (<= 1 ~c_req_a~0) .cse20 .cse1 (= ~m_run_pc~0 3) (<= 51 ~c_req_d~0) .cse5 .cse8 .cse10 (<= ~c_req_a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse12 .cse13 (= ULTIMATE.start_m_run_~a~0 1) .cse14 .cse16 .cse18 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse7 .cse11 .cse13 .cse12 .cse14 (or (and .cse8 .cse10 .cse0 .cse16 .cse20 .cse1 .cse18 .cse4 .cse6 (<= 6 ~m_run_pc~0)) (and .cse8 .cse10 .cse0 .cse16 .cse20 .cse1 .cse2 .cse18 .cse4 .cse6)) .cse15 .cse17 .cse3 .cse5 .cse19)))) [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L1085(lines 1085 1089) no Hoare annotation was computed. [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L623(lines 615 632) no Hoare annotation was computed. [2020-12-09 05:42:57,703 INFO L258 CegarLoopResult]: At program point L1218(lines 1211 1228) the Hoare annotation is: (and (= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= ~m_run_pc~0 0) (= ~c_req_a~0 0) (= ~a_t~0 0) (= ~s_run_pc~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~m_run_st~0 0) (= ~s_run_st~0 0) (<= 2 ~c_read_req_ev~0) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0)) [2020-12-09 05:42:57,703 INFO L258 CegarLoopResult]: At program point L426(lines 419 454) the Hoare annotation is: (let ((.cse0 (= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse4 .cse5 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse6 .cse7 .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 (= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse8 (= ~a_t~0 0)))) [2020-12-09 05:42:57,703 INFO L258 CegarLoopResult]: At program point L492-2(lines 492 520) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_empty_req~0 1)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 (<= 1 ~a_t~0) .cse2 .cse3 (= ~m_run_pc~0 3) .cse4 (<= 51 ~c_req_d~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (<= ~c_req_d~0 51)) (and .cse0 .cse1 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse8 .cse6 .cse7 .cse9 .cse10 (= ULTIMATE.start_m_run_~a~0 1) .cse11 .cse12))) [2020-12-09 05:42:57,703 INFO L258 CegarLoopResult]: At program point L360(lines 353 370) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= ~m_run_pc~0 3)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_read_req_ev~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and (= ~s_memory1~0 51) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (<= 51 ~c_req_d~0) .cse3 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10))) [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L228(lines 228 232) no Hoare annotation was computed. [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L1219(lines 1167 1346) no Hoare annotation was computed. [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L493(lines 492 520) no Hoare annotation was computed. [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L361(lines 131 477) no Hoare annotation was computed. [2020-12-09 05:42:57,703 INFO L262 CegarLoopResult]: For program point L428(lines 428 432) no Hoare annotation was computed. [2020-12-09 05:42:57,704 INFO L258 CegarLoopResult]: At program point L1023(lines 997 1024) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse15 (<= 1 ~a_t~0)) (.cse16 (= ULTIMATE.start_m_run_~a~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse17 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse18 (= ~m_run_pc~0 3)) (.cse4 (= ~a_t~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 .cse12 .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse14) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse15 .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 .cse10 .cse16 .cse11 .cse13 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse14 (= ~req_tt_a~0 1)) (and .cse17 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse15 .cse3 .cse18 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse9 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse10 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse16 .cse11 .cse13 .cse14 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse5 .cse6 .cse9 .cse10 .cse2 .cse11 .cse12 .cse3 .cse18 .cse13 .cse14 .cse4) (let ((.cse19 (+ ULTIMATE.start_m_run_~a~0 50))) (and .cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse2 (= ~c_req_type~0 1) (= ULTIMATE.start_s_run_~req_type~1 1) .cse18 (<= ~c_req_d~0 .cse19) .cse4 (<= .cse19 ULTIMATE.start_m_run_~req_d~0) (= ~s_run_pc~0 0) .cse6 .cse9 .cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse19) .cse11 .cse12 .cse13 .cse14 (<= .cse19 ~c_req_d~0))))) [2020-12-09 05:42:57,704 INFO L262 CegarLoopResult]: For program point L561(lines 561 614) no Hoare annotation was computed. [2020-12-09 05:42:57,704 INFO L262 CegarLoopResult]: For program point L99(lines 99 127) no Hoare annotation was computed. [2020-12-09 05:42:57,704 INFO L262 CegarLoopResult]: For program point L826(lines 826 832) no Hoare annotation was computed. [2020-12-09 05:42:57,704 INFO L258 CegarLoopResult]: At program point L826-1(lines 826 832) the Hoare annotation is: (let ((.cse1 (= ~m_run_pc~0 6)) (.cse7 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ULTIMATE.start_m_run_~rsp_d___0~0)) (.cse4 (<= 2 ~c_read_req_ev~0)) (.cse0 (= ~c_m_lock~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse5 (<= 1 ~a_t~0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~s_memory1~0 51) .cse0 .cse1 .cse6 .cse7 .cse9 (= ~a_t~0 0) .cse2 (<= ULTIMATE.start_s_memory_write_~v 51) (<= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (= ~s_memory0~0 50) .cse4 .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 (= ~m_run_pc~0 3) .cse10 .cse11))) [2020-12-09 05:42:57,704 INFO L258 CegarLoopResult]: At program point L760(lines 753 806) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~c_m_lock~0 0)) (.cse2 (= ~m_run_pc~0 6)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse8 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_read_req_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse5 (= .cse4 ~c_rsp_d~0) (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (= ~s_memory0~0 50) .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse3 (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse9 (= 51 ~c_rsp_d~0) .cse10 .cse11 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-09 05:42:57,704 INFO L258 CegarLoopResult]: At program point L694(lines 687 722) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse6 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 ~c_rsp_d~0) .cse8 .cse9 .cse10 .cse11 .cse12 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)) (let ((.cse13 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and .cse0 .cse1 .cse2 (= .cse13 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) .cse3 (= .cse13 ~c_rsp_d~0) (= ~a_t~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~s_memory0~0 50) .cse9 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50))))) [2020-12-09 05:42:57,704 INFO L262 CegarLoopResult]: For program point L562(lines 562 566) no Hoare annotation was computed. [2020-12-09 05:42:57,704 INFO L258 CegarLoopResult]: At program point L1091(lines 1084 1101) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (= ~m_run_pc~0 6)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse5 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (<= 1 ~a_t~0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_read_req_ev~0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse15 (= ~m_run_pc~0 3)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse13 (= ~a_t~0 0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 (<= 1 ~c_req_a~0) .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 (= 51 ~c_rsp_d~0) .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse3 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse14 .cse11 .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse15 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 (= ~s_memory1~0 ULTIMATE.start_s_run_~req_d~1) .cse7 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse8 .cse9 .cse10 .cse11 .cse12 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and .cse6 .cse7 .cse8 .cse10 .cse14 .cse15 .cse11 .cse12 .cse13))) [2020-12-09 05:42:57,705 INFO L258 CegarLoopResult]: At program point L1158(lines 1110 1163) the Hoare annotation is: (let ((.cse12 (= ULTIMATE.start_m_run_~a~0 1)) (.cse3 (<= 1 ~a_t~0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse0 (= ~s_memory1~0 51)) (.cse17 (= ~m_run_pc~0 6)) (.cse6 (<= ULTIMATE.start_s_memory_write_~v 51)) (.cse7 (<= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse20 (= ~a_t~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (not (= ~m_run_st~0 0))) (.cse10 (= ~s_memory0~0 50)) (.cse11 (<= 2 ~c_read_req_ev~0)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse19 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 51 ~c_req_d~0) .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse12 .cse13 .cse14 .cse15 (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 51)) (and (= ~s_run_pc~0 0) .cse16 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse5 (= ~c_req_a~0 0)) (and .cse16 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse0 (<= ULTIMATE.start_m_run_~req_a___0~0 1) .cse17 (= ULTIMATE.start_s_memory_read_~i 1) .cse1 .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) (<= 1 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse7 (<= ~c_req_a~0 1) .cse8 (= 51 ~c_rsp_d~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~req_tt_a~0 1)) (and .cse17 .cse9 .cse10 .cse11 (or (and .cse16 .cse8 .cse1 .cse2 .cse3 .cse13 .cse4 .cse14 .cse15 .cse18) (and .cse16 .cse8 .cse1 .cse2 .cse13 .cse19 .cse4 .cse14 .cse15 .cse20))) (and (= ~c_m_lock~0 0) .cse17 .cse1 .cse3 .cse2 .cse4 .cse16 .cse8 .cse9 .cse11 .cse13 .cse14 .cse18) (and .cse0 .cse17 .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) .cse20 .cse8 .cse6 .cse7 .cse9 .cse10 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse19 .cse14 .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse2 .cse4 .cse5 .cse20 .cse8 .cse9 .cse10 .cse11 .cse13 .cse19 .cse14 .cse15))) [2020-12-09 05:42:57,705 INFO L262 CegarLoopResult]: For program point L1092(lines 1084 1101) no Hoare annotation was computed. [2020-12-09 05:42:57,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:42:57 BoogieIcfgContainer [2020-12-09 05:42:57,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:42:57,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:42:57,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:42:57,813 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:42:57,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:33:42" (3/4) ... [2020-12-09 05:42:57,815 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 05:42:57,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2020-12-09 05:42:57,832 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-09 05:42:57,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-09 05:42:57,835 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 05:42:57,945 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e198c8da-66fb-4d17-a8ab-be21db4cc385/bin/utaipan/witness.graphml [2020-12-09 05:42:57,945 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:42:57,945 INFO L168 Benchmark]: Toolchain (without parser) took 556744.47 ms. Allocated memory was 107.0 MB in the beginning and 7.9 GB in the end (delta: 7.8 GB). Free memory was 67.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 6.1 GB. Max. memory is 16.1 GB. [2020-12-09 05:42:57,945 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 107.0 MB. Free memory is still 84.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:42:57,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.21 ms. Allocated memory is still 107.0 MB. Free memory was 67.3 MB in the beginning and 74.8 MB in the end (delta: -7.5 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. [2020-12-09 05:42:57,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.30 ms. Allocated memory is still 107.0 MB. Free memory was 74.4 MB in the beginning and 71.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 05:42:57,946 INFO L168 Benchmark]: Boogie Preprocessor took 33.88 ms. Allocated memory is still 107.0 MB. Free memory was 71.0 MB in the beginning and 68.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:42:57,946 INFO L168 Benchmark]: RCFGBuilder took 961.61 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 67.7 MB in the beginning and 97.5 MB in the end (delta: -29.8 MB). Peak memory consumption was 52.6 MB. Max. memory is 16.1 GB. [2020-12-09 05:42:57,947 INFO L168 Benchmark]: TraceAbstraction took 555269.49 ms. Allocated memory was 130.0 MB in the beginning and 7.9 GB in the end (delta: 7.8 GB). Free memory was 96.5 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.1 GB. [2020-12-09 05:42:57,947 INFO L168 Benchmark]: Witness Printer took 132.26 ms. Allocated memory is still 7.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2020-12-09 05:42:57,948 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.11 ms. Allocated memory is still 107.0 MB. Free memory is still 84.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 297.21 ms. Allocated memory is still 107.0 MB. Free memory was 67.3 MB in the beginning and 74.8 MB in the end (delta: -7.5 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.30 ms. Allocated memory is still 107.0 MB. Free memory was 74.4 MB in the beginning and 71.0 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.88 ms. Allocated memory is still 107.0 MB. Free memory was 71.0 MB in the beginning and 68.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 961.61 ms. Allocated memory was 107.0 MB in the beginning and 130.0 MB in the end (delta: 23.1 MB). Free memory was 67.7 MB in the beginning and 97.5 MB in the end (delta: -29.8 MB). Peak memory consumption was 52.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 555269.49 ms. Allocated memory was 130.0 MB in the beginning and 7.9 GB in the end (delta: 7.8 GB). Free memory was 96.5 MB in the beginning and 1.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.1 GB. * Witness Printer took 132.26 ms. Allocated memory is still 7.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 826]: Loop Invariant Derived loop invariant: ((((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= a) || (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && 2 == s_run_pc) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev)) || (((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= a) - InvariantResult [Line: 1276]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && 1 <= req_a___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || ((((((((((((c_m_lock == 0 && m_run_pc == 6) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) || ((((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && !(2 == s_run_pc)) && c_req_a == 0) || (((((((((((((((((((2 <= c_write_rsp_ev && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 51 <= c_req_d) && a_t == 0) && c_empty_rsp == 1) && s_run_st == 0) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && c_empty_req <= 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((((((((2 <= c_write_rsp_ev && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_st == 0) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((c_empty_req == 1 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((((((((s_memory1 == 51 && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((((((((((2 <= c_write_rsp_ev && !(c_req_type == 0)) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_rsp == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((c_empty_req == 1 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || (((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_rsp_d == 50) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock)))) || (((((((((((((((s_memory1 == 51 && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((((((((((v == req_d && 50 <= req_d) && req_d <= 50) && c_req_type == 1) && req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 482]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51) || (((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 2 <= a)) || (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && 2 == s_run_pc) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || (((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && req_a___0 + 50 == rsp_d___0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 2 <= a) - InvariantResult [Line: 997]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((c_empty_rsp == 1 && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)) || (((((((((((((((((((v == req_d && 50 <= req_d) && req_d <= 50) && 2 <= c_write_rsp_ev) && c_req_type == 1) && req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_empty_req == 1) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 695]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 1164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((a + 50 <= req_d && !(m_run_st == 0)) && 2 <= c_read_req_ev) && req_d <= a + 50) && a == 0) && (((((((((req_type == 1 && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && req_a == 0) && 6 <= m_run_pc) || ((((((((req_type == 1 && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && m_run_pc <= 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && req_a == 0))) && a_t == 0) || ((((((((((((((((1 <= req_a && c_m_lock == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_a <= 1) && 51 <= req_d)) || ((((((((((((((((((2 <= c_write_rsp_ev && m_run_pc <= 0) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && !(2 == s_run_pc)) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && a == 0) && m_run_pc <= 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 1046]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((((((((((v == req_d && 50 <= req_d) && req_d <= 50) && c_req_type == 1) && req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) || (((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && s_run_pc == 0) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev)) || ((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && c_req_d <= 51)) || ((((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && a == 0) && c_req_a == 0)) || (((((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && a_t == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((a + 50 <= req_d && !(m_run_st == 0)) && 2 <= c_read_req_ev) && (((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && m_run_pc <= 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a == 0) || ((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a == 0) && 6 <= m_run_pc))) && req_d <= a + 50) && a == 0) && a_t == 0) || (((((((((((((((1 <= req_a && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d)) || ((((((((((((((((2 <= c_write_rsp_ev && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && a == 0) && m_run_pc <= 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= req_a && c_m_lock == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_a <= 1) && 51 <= req_d) || ((((((((((req_type == 1 && c_m_lock == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && a == 0) && m_run_pc <= 0) && c_req_a == 0) && req_a == 0)) || (((((((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev)) || (((((((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc <= 0) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= c_write_rsp_ev && c_req_type == 1) && m_run_pc <= 0) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && !(m_run_st == 0)) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc <= 0) && a == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((((((((1 <= req_a && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && req_d <= 51) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((a + 50 <= req_d && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && c_empty_req <= 0) && ((((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && c_req_type == 1) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0) && 6 <= m_run_pc) || (((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc <= 0) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0))) && req_d <= a + 50) && a == 0) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= c_req_d) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= req_a && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((((2 <= c_write_rsp_ev && m_run_pc <= 0) && c_req_a == 0) && req_a == 0) && a_t == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((a + 50 <= req_d && ((((((((((req_type == 1 && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a == 0) && 6 <= m_run_pc) || (((((((((req_type == 1 && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && m_run_pc <= 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a == 0))) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && req_d <= a + 50) && a == 0) && a_t == 0) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || ((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 0 <= a_t) && 2 == s_run_pc) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && v <= 51) && 51 <= v) && s_memory0 == 50) && c_write_req_ev == 1) && (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc == 3) || ((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc <= 0))) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && a_t == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 1 <= c_m_lock) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && 1 <= a) && c_req_d <= 51) || ((((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && a_t == 0) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || (((((((((((c_empty_req == 1 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && 1 <= a) && c_req_d <= 51) || ((((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && a_t == 0) - InvariantResult [Line: 1203]: Loop Invariant Derived loop invariant: ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || ((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 0 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && c_empty_req <= 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && a_t == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1233]: Loop Invariant Derived loop invariant: ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev - InvariantResult [Line: 1211]: Loop Invariant Derived loop invariant: ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || (((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_rsp_d == 50) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock))) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_req_type == 0) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && !(m_run_st == 0)) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && ((((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc <= 0) || (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc == 3))) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((a + 50 <= req_d && !(m_run_st == 0)) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && a == 0) && ((((((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && c_req_type == 1) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && 6 <= m_run_pc) || (((((((((req_type == 1 && (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc == 3) || ((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc <= 0))) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0) && !(req_type == 0)))) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= c_req_d)) || (((((((s_run_pc == 0 && !(s_run_st == 0)) && !(c_req_type == 0)) && ((((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc <= 0) || (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc == 3))) && a == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((((((((((1 <= req_a && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && !(req_type == 0)) && 6 <= m_run_pc) && req_type == 1) && c_empty_rsp == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) || ((((((((((((1 <= req_a && !(c_req_type == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc == 3) || ((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc <= 0))) && a == 1) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1)) && s_memory0 == 50) && req_d <= 51) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && 51 <= c_req_d) && 51 <= req_d) && a_t == 0) && c_req_d <= 51) - InvariantResult [Line: 1284]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && 1 <= req_a___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || ((((((((((((c_m_lock == 0 && m_run_pc == 6) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) || ((((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) || (((m_run_pc == 6 && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || ((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 1 <= req_a___0) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((c_empty_req == 1 && s_memory0 == 50) && !(s_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_req_type == 0) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && !(m_run_st == 0)) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && ((((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc <= 0) || (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc == 3))) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((a + 50 <= req_d && !(m_run_st == 0)) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && a == 0) && ((((((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && c_req_type == 1) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && 6 <= m_run_pc) || (((((((((req_type == 1 && (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc == 3) || ((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc <= 0))) && 2 <= c_m_ev) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0) && !(req_type == 0)))) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= c_req_d)) || (((((((s_run_pc == 0 && !(s_run_st == 0)) && !(c_req_type == 0)) && ((((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc <= 0) || (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && !(2 == s_run_pc)) && m_run_pc == 3))) && a == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((((((((((1 <= req_a && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && !(req_type == 0)) && 6 <= m_run_pc) && req_type == 1) && c_empty_rsp == 1) && c_req_a <= 1) && a == 1) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) || ((((((((((((1 <= req_a && !(c_req_type == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc == 3) || ((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc <= 0))) && a == 1) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1)) && s_memory0 == 50) && req_d <= 51) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && 51 <= c_req_d) && 51 <= req_d) && a_t == 0) && c_req_d <= 51) - InvariantResult [Line: 1292]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && 1 <= req_a___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || ((((((((((((c_m_lock == 0 && m_run_pc == 6) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || (((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_rsp_d == 50) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock))) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) || ((((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && 1 <= c_m_lock) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_run_st == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((s_run_st == 0 && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 3) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && s_run_st == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || (((((((((((((((((2 <= c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_rsp == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || ((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 1 <= req_a___0) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_run_st == 0) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && v <= 51) && 51 <= v) && s_run_st == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_run_st == 0) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_st == 0) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || ((((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || (((m_run_pc == 6 && s_memory0 == 50) && (((((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0))) && 2 <= c_read_req_ev)) || ((((((((((((((((((((1 <= a_t && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && s_run_st == 0) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && c_empty_req <= 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 1 <= req_a___0) && 51 == x) && c_empty_req == 1) && m_run_st == 0) && c_req_a <= 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && m_run_st == 0) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((((((((((v == req_d && 50 <= req_d) && req_d <= 50) && c_req_type == 1) && req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && 1 <= a) && c_req_d <= 51) || ((((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && a_t == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || (((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_rsp_d == 50) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock))) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= c_write_rsp_ev && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((c_empty_rsp == 1 && s_run_pc == 0) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && a == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((((((((1 <= req_a && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && 51 <= c_req_d) && a_t == 0) && !(req_type == 0)) && req_type == 1) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && c_empty_req <= 0) && a == 1) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((((2 <= c_write_rsp_ev && !(c_req_type == 0)) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && req_a == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && !(m_run_st == 0)) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 1084]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((c_empty_rsp == 1 && s_run_pc == 0) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && a == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) || (((((((((((((((((((2 <= c_write_rsp_ev && !(c_req_type == 0)) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && req_a == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && c_empty_req <= 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && req_type___0 == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1062]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((((((((((v == req_d && 50 <= req_d) && req_d <= 50) && c_req_type == 1) && req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && 1 <= a) && c_req_d <= 51) || ((((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && a_t == 0) - InvariantResult [Line: 1179]: Loop Invariant Derived loop invariant: ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && s_run_st == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 3) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= a)) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || (((m_run_pc == 6 && s_memory0 == 50) && 2 <= c_read_req_ev) && (((((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || (((((((((((((((((2 <= c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_rsp == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_run_st == 0) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_st == 0) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || ((((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || (((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((((1 <= a_t && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && s_run_st == 0) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && c_empty_req <= 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) - InvariantResult [Line: 864]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || (((m_run_pc == 6 && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || (((((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && c_empty_req <= 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && 1 <= c_m_lock)) || (((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || ((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v == req_d && 50 <= req_d) && req_d <= 50) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && m_run_pc == 3) && req_type == 1) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51) || (((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && req_type___0 == 0) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && 1 <= req_a___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || ((((((((((((c_m_lock == 0 && m_run_pc == 6) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((((((c_empty_rsp == 1 && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 3) && 1 <= c_m_lock) && a_t == 0) || ((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || ((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 861]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || (((m_run_pc == 6 && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || (((((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && c_empty_req <= 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && 1 <= c_m_lock)) || (((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 671]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 777]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) || ((((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= 51) && c_empty_req <= 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || ((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && 2 <= c_m_ev) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 <= c_write_rsp_ev && c_req_type == 1) && m_run_pc <= 0) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && !(m_run_st == 0)) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((((((((((((((1 <= req_a && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_a <= 1) && a <= 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && req_d <= 51) && c_empty_req <= 0) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || ((((((((((a + 50 <= req_d && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && ((((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && c_req_type == 1) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0) && 6 <= m_run_pc) || (((((((((req_type == 1 && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc <= 0) && 1 <= c_m_lock) && c_req_a == 0) && req_a == 0))) && c_empty_req <= 0) && req_d <= a + 50) && a == 0) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc <= 0) && a == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_run_st == 0) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && (((((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || (((((((((((((((((s_memory1 == 51 && 0 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && s_run_st == 0) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= a) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 807]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) || ((((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 924]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((51 <= req_d && req_a == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && !(m_run_st == 0)) && s_memory0 == 50) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && c_empty_req == 1) && !(m_run_st == 0)) && req_a == 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d) - InvariantResult [Line: 1030]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((((((((((v == req_d && 50 <= req_d) && req_d <= 50) && c_req_type == 1) && req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && a_t == 0) && a + 50 <= req_d) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((((((v == req_d && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && s_memory1 == req_d) && 2 <= c_read_req_ev) && req_d <= 51) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51)) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && req_a___0 + 50 == c_rsp_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_req_a <= 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) || ((((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && req_a___0 == 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && c_empty_rsp == 1) && 51 == rsp_d___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && req_type___0 == 0) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && c_empty_req <= 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && req_type___0 == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && c_write_req_ev == 1) && 2 <= c_read_req_ev) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 1 <= c_m_lock) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((c_empty_req == 1 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || (((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_rsp_d == 50) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock)))) || (((((((((((((((s_memory1 == 51 && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 524]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && req_type___0 == 0) && a_t == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || (((((((((((((((((s_memory1 == 51 && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && 1 <= a) && c_req_d <= 51) || ((((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && a_t == 0) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && req_type___0 == 0) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51) || ((((((((((((((((s_memory1 == 51 && c_m_lock == 0) && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && req_type___0 == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) - InvariantResult [Line: 1187]: Loop Invariant Derived loop invariant: ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((c_empty_rsp == 1 && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) && 1 <= c_m_lock) && a_t == 0) || ((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && req_type == 0) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && c_req_d <= 51 - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v == req_d && 51 <= req_d) && 2 <= c_write_rsp_ev) && 1 <= a_t) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory1 == req_d) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || ((((((((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && c_req_d <= a + 50) && c_req_a == 0) && a_t == 0) && a + 50 <= req_d) && c_empty_rsp == 1) && s_run_pc == 0) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && c_empty_req <= 0) && req_d <= a + 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && 1 <= c_m_lock)) || (((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((c_empty_req == 1 && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || ((((((((((((2 <= c_write_rsp_ev && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 0 <= a_t) && 2 == s_run_pc) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && v <= 51) && 51 <= v) && s_memory0 == 50) && c_write_req_ev == 1) && (((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc == 3) || ((c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && m_run_pc <= 0))) && 2 <= c_read_req_ev) && 0 == req_a___0) && c_empty_req <= 0) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 2 <= c_write_rsp_ev) && 1 <= c_req_a) && 2 == s_run_pc) && a_t == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && v <= 51) && 51 <= v) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && c_write_req_ev == 1) && a == 1) && c_empty_req <= 0) && 2 <= c_m_ev) && 1 <= c_m_lock) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && c_m_lock == 0) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && c_empty_req == 1) && v <= 51) && 51 <= v) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_req_ev) && 1 <= a) && c_req_d <= 51) || ((((((((((c_m_lock == 0 && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && m_run_pc == 3) && 2 <= c_write_req_ev) && a_t == 0) - InvariantResult [Line: 1195]: Loop Invariant Derived loop invariant: ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_run_st == 0) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && i == 1) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((c_empty_req == 1 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)) || ((((((((((c_m_lock == 0 && m_run_pc == 6) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || (((((((c_m_lock == 0 && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0)) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && a_t == 0) && v <= 51) && 51 <= v) && c_empty_req == 1) && c_rsp_d == 50) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || (((((((((((((c_m_lock == 0 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && 2 == s_run_pc) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((((((((((c_m_lock == 0 && 2 <= c_write_rsp_ev) && m_run_pc <= 0) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock)))) || (((((((((((((((s_memory1 == 51 && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 1268]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && 1 <= req_a___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || ((((((((((((c_m_lock == 0 && m_run_pc == 6) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && v <= 51) && 51 <= v) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && req_d <= 51) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 51 <= req_d) && c_req_d <= 51) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && !(c_req_type == 0)) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && req_a___0 <= 1) && m_run_pc == 6) && i == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == x) && 1 <= req_a___0) && v <= 51) && 51 <= v) && c_req_a <= 1) && c_empty_req == 1) && 51 == c_rsp_d) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((m_run_pc == 6 && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && ((((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) || (((((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && 2 <= c_m_ev) && a == 0) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a_t == 0)))) || ((((((((((((c_m_lock == 0 && m_run_pc == 6) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_empty_req == 1) && !(m_run_st == 0)) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && 2 <= c_write_rsp_ev) && req_tt_a == 0) && 2 == s_run_pc) && req_a___0 + 50 == c_rsp_d) && a_t == 0) && c_empty_req == 1) && v <= 51) && 51 <= v) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50)) || ((((((((((((!(s_run_st == 0) && 2 <= c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && a_t == 0) && c_empty_req == 1) && !(m_run_st == 0)) && s_memory0 == 50) && 2 <= c_read_req_ev) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 392.8s, OverallIterations: 33, TraceHistogramMax: 8, AutomataDifference: 33.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 162.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19522 SDtfs, 46283 SDslu, 70523 SDs, 0 SdLazy, 6135 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5525 GetRequests, 5027 SyntacticMatches, 24 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21527 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15724occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 144019 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 96 LocationsWithAnnotation, 96 PreInvPairs, 759 NumberOfFragments, 21826 HoareAnnotationTreeSize, 96 FomulaSimplifications, 27625867635 FormulaSimplificationTreeSizeReduction, 48.5s HoareSimplificationTime, 96 FomulaSimplificationsInter, 2303477241 FormulaSimplificationTreeSizeReductionInter, 113.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 7626 NumberOfCodeBlocks, 7626 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 9998 ConstructedInterpolants, 0 QuantifiedInterpolants, 6706802 SizeOfPredicates, 52 NumberOfNonLiveVariables, 7670 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 53 InterpolantComputations, 35 PerfectInterpolantSequences, 5367/7165 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...