./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13a2f963fb17b383a7c5451f284cefc57445bb3b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 00:00:14,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:00:14,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:00:14,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:00:14,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:00:14,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:00:14,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:00:14,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:00:14,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:00:14,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:00:14,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:00:14,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:00:14,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:00:14,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:00:14,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:00:14,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:00:14,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:00:14,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:00:14,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:00:14,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:00:14,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:00:14,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:00:14,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:00:14,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:00:14,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:00:14,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:00:14,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:00:14,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:00:14,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:00:14,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:00:14,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:00:14,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:00:14,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:00:14,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:00:14,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:00:14,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:00:14,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:00:14,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:00:14,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:00:14,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:00:14,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:00:14,530 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:00:14,559 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:00:14,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:00:14,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:00:14,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:00:14,562 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:00:14,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:00:14,563 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:00:14,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:00:14,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:00:14,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:00:14,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:00:14,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:00:14,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:00:14,565 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:00:14,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:00:14,566 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:00:14,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:00:14,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:00:14,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:00:14,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:00:14,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:00:14,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:00:14,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:00:14,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:00:14,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:00:14,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:00:14,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:00:14,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:00:14,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:00:14,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/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_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13a2f963fb17b383a7c5451f284cefc57445bb3b [2020-11-30 00:00:14,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:00:14,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:00:14,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:00:14,899 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:00:14,903 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:00:14,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2020-11-30 00:00:14,990 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/data/2abf34341/39256fe82110411fba321a98abb8d43c/FLAG6b47a769e [2020-11-30 00:00:15,679 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:00:15,680 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2020-11-30 00:00:15,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/data/2abf34341/39256fe82110411fba321a98abb8d43c/FLAG6b47a769e [2020-11-30 00:00:15,977 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/data/2abf34341/39256fe82110411fba321a98abb8d43c [2020-11-30 00:00:15,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:00:15,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:00:15,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:00:15,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:00:15,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:00:16,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:00:15" (1/1) ... [2020-11-30 00:00:16,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b1115d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16, skipping insertion in model container [2020-11-30 00:00:16,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:00:15" (1/1) ... [2020-11-30 00:00:16,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:00:16,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:00:16,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:00:16,464 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:00:16,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:00:16,622 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:00:16,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16 WrapperNode [2020-11-30 00:00:16,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:00:16,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:00:16,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:00:16,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:00:16,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:00:16,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:00:16,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:00:16,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:00:16,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... [2020-11-30 00:00:16,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:00:16,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:00:16,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:00:16,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:00:16,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:00:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:00:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:00:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:00:16,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:00:18,788 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:00:18,788 INFO L298 CfgBuilder]: Removed 49 assume(true) statements. [2020-11-30 00:00:18,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:00:18 BoogieIcfgContainer [2020-11-30 00:00:18,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:00:18,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:00:18,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:00:18,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:00:18,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:00:15" (1/3) ... [2020-11-30 00:00:18,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bc8c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:00:18, skipping insertion in model container [2020-11-30 00:00:18,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:00:16" (2/3) ... [2020-11-30 00:00:18,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bc8c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:00:18, skipping insertion in model container [2020-11-30 00:00:18,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:00:18" (3/3) ... [2020-11-30 00:00:18,806 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2020-11-30 00:00:18,821 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:00:18,827 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-11-30 00:00:18,842 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-30 00:00:18,899 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:00:18,899 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:00:18,899 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:00:18,901 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:00:18,902 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:00:18,903 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:00:18,903 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:00:18,904 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:00:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states. [2020-11-30 00:00:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 00:00:18,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:18,973 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] [2020-11-30 00:00:18,973 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-11-30 00:00:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2020-11-30 00:00:18,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:18,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552017594] [2020-11-30 00:00:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:19,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552017594] [2020-11-30 00:00:19,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:19,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:19,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371013219] [2020-11-30 00:00:19,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:19,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:19,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:19,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:19,312 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 3 states. [2020-11-30 00:00:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:19,991 INFO L93 Difference]: Finished difference Result 724 states and 1309 transitions. [2020-11-30 00:00:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:19,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-11-30 00:00:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:20,014 INFO L225 Difference]: With dead ends: 724 [2020-11-30 00:00:20,014 INFO L226 Difference]: Without dead ends: 444 [2020-11-30 00:00:20,020 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-11-30 00:00:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-11-30 00:00:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 428. [2020-11-30 00:00:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-11-30 00:00:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 674 transitions. [2020-11-30 00:00:20,119 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 674 transitions. Word has length 28 [2020-11-30 00:00:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:20,120 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 674 transitions. [2020-11-30 00:00:20,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 674 transitions. [2020-11-30 00:00:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 00:00:20,124 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:20,124 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] [2020-11-30 00:00:20,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:00:20,125 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-11-30 00:00:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash 958874261, now seen corresponding path program 1 times [2020-11-30 00:00:20,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:20,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298952797] [2020-11-30 00:00:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:20,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298952797] [2020-11-30 00:00:20,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:20,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:20,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833736979] [2020-11-30 00:00:20,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:20,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:20,242 INFO L87 Difference]: Start difference. First operand 428 states and 674 transitions. Second operand 3 states. [2020-11-30 00:00:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:20,499 INFO L93 Difference]: Finished difference Result 1123 states and 1791 transitions. [2020-11-30 00:00:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:20,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-11-30 00:00:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:20,506 INFO L225 Difference]: With dead ends: 1123 [2020-11-30 00:00:20,506 INFO L226 Difference]: Without dead ends: 709 [2020-11-30 00:00:20,509 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-11-30 00:00:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-11-30 00:00:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 693. [2020-11-30 00:00:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-11-30 00:00:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1121 transitions. [2020-11-30 00:00:20,615 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1121 transitions. Word has length 37 [2020-11-30 00:00:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:20,616 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 1121 transitions. [2020-11-30 00:00:20,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1121 transitions. [2020-11-30 00:00:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 00:00:20,629 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:20,629 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] [2020-11-30 00:00:20,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:00:20,630 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-11-30 00:00:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash -633712800, now seen corresponding path program 1 times [2020-11-30 00:00:20,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:20,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138729943] [2020-11-30 00:00:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:20,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138729943] [2020-11-30 00:00:20,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:20,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:20,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506726290] [2020-11-30 00:00:20,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:20,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:20,705 INFO L87 Difference]: Start difference. First operand 693 states and 1121 transitions. Second operand 3 states. [2020-11-30 00:00:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:20,793 INFO L93 Difference]: Finished difference Result 1747 states and 2828 transitions. [2020-11-30 00:00:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:20,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-11-30 00:00:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:20,804 INFO L225 Difference]: With dead ends: 1747 [2020-11-30 00:00:20,804 INFO L226 Difference]: Without dead ends: 1079 [2020-11-30 00:00:20,807 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-11-30 00:00:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2020-11-30 00:00:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1067. [2020-11-30 00:00:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2020-11-30 00:00:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1724 transitions. [2020-11-30 00:00:20,873 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1724 transitions. Word has length 38 [2020-11-30 00:00:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:20,874 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1724 transitions. [2020-11-30 00:00:20,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1724 transitions. [2020-11-30 00:00:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 00:00:20,880 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:20,881 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:20,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:00:20,883 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-11-30 00:00:20,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:20,884 INFO L82 PathProgramCache]: Analyzing trace with hash -568355804, now seen corresponding path program 1 times [2020-11-30 00:00:20,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:20,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966313794] [2020-11-30 00:00:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:20,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966313794] [2020-11-30 00:00:20,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:20,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:00:20,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751889509] [2020-11-30 00:00:20,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:20,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:20,993 INFO L87 Difference]: Start difference. First operand 1067 states and 1724 transitions. Second operand 4 states. [2020-11-30 00:00:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:21,697 INFO L93 Difference]: Finished difference Result 2933 states and 4721 transitions. [2020-11-30 00:00:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:21,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-11-30 00:00:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:21,713 INFO L225 Difference]: With dead ends: 2933 [2020-11-30 00:00:21,713 INFO L226 Difference]: Without dead ends: 1891 [2020-11-30 00:00:21,716 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-11-30 00:00:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2020-11-30 00:00:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1661. [2020-11-30 00:00:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2020-11-30 00:00:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2648 transitions. [2020-11-30 00:00:21,823 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2648 transitions. Word has length 46 [2020-11-30 00:00:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:21,824 INFO L481 AbstractCegarLoop]: Abstraction has 1661 states and 2648 transitions. [2020-11-30 00:00:21,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2648 transitions. [2020-11-30 00:00:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-30 00:00:21,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:21,826 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] [2020-11-30 00:00:21,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:00:21,826 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-11-30 00:00:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2020-11-30 00:00:21,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:21,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62782411] [2020-11-30 00:00:21,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:21,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62782411] [2020-11-30 00:00:21,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:21,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:00:21,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527605535] [2020-11-30 00:00:21,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:21,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:21,973 INFO L87 Difference]: Start difference. First operand 1661 states and 2648 transitions. Second operand 4 states. [2020-11-30 00:00:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:22,731 INFO L93 Difference]: Finished difference Result 4937 states and 7764 transitions. [2020-11-30 00:00:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:00:22,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-11-30 00:00:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:22,757 INFO L225 Difference]: With dead ends: 4937 [2020-11-30 00:00:22,757 INFO L226 Difference]: Without dead ends: 3295 [2020-11-30 00:00:22,760 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-11-30 00:00:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2020-11-30 00:00:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 2921. [2020-11-30 00:00:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2921 states. [2020-11-30 00:00:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4583 transitions. [2020-11-30 00:00:22,915 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4583 transitions. Word has length 52 [2020-11-30 00:00:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:22,916 INFO L481 AbstractCegarLoop]: Abstraction has 2921 states and 4583 transitions. [2020-11-30 00:00:22,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4583 transitions. [2020-11-30 00:00:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-30 00:00:22,918 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:22,918 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] [2020-11-30 00:00:22,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:00:22,919 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-11-30 00:00:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2020-11-30 00:00:22,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:22,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506719903] [2020-11-30 00:00:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:23,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506719903] [2020-11-30 00:00:23,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:23,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:23,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471314091] [2020-11-30 00:00:23,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:23,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:23,049 INFO L87 Difference]: Start difference. First operand 2921 states and 4583 transitions. Second operand 3 states. [2020-11-30 00:00:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:23,266 INFO L93 Difference]: Finished difference Result 6863 states and 10722 transitions. [2020-11-30 00:00:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:23,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-30 00:00:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:23,295 INFO L225 Difference]: With dead ends: 6863 [2020-11-30 00:00:23,295 INFO L226 Difference]: Without dead ends: 3965 [2020-11-30 00:00:23,303 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-11-30 00:00:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2020-11-30 00:00:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3781. [2020-11-30 00:00:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2020-11-30 00:00:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5853 transitions. [2020-11-30 00:00:23,584 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5853 transitions. Word has length 52 [2020-11-30 00:00:23,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:23,588 INFO L481 AbstractCegarLoop]: Abstraction has 3781 states and 5853 transitions. [2020-11-30 00:00:23,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5853 transitions. [2020-11-30 00:00:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-30 00:00:23,593 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:23,593 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-11-30 00:00:23,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:00:23,594 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-11-30 00:00:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1966812716, now seen corresponding path program 1 times [2020-11-30 00:00:23,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:23,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865029792] [2020-11-30 00:00:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:23,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865029792] [2020-11-30 00:00:23,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:23,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:23,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784703235] [2020-11-30 00:00:23,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:23,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:23,713 INFO L87 Difference]: Start difference. First operand 3781 states and 5853 transitions. Second operand 3 states. [2020-11-30 00:00:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:24,368 INFO L93 Difference]: Finished difference Result 9083 states and 14177 transitions. [2020-11-30 00:00:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:24,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-11-30 00:00:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:24,409 INFO L225 Difference]: With dead ends: 9083 [2020-11-30 00:00:24,409 INFO L226 Difference]: Without dead ends: 5325 [2020-11-30 00:00:24,417 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-11-30 00:00:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2020-11-30 00:00:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 4575. [2020-11-30 00:00:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4575 states. [2020-11-30 00:00:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 6818 transitions. [2020-11-30 00:00:24,689 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 6818 transitions. Word has length 57 [2020-11-30 00:00:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:24,689 INFO L481 AbstractCegarLoop]: Abstraction has 4575 states and 6818 transitions. [2020-11-30 00:00:24,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 6818 transitions. [2020-11-30 00:00:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-30 00:00:24,693 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:24,693 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, 1, 1] [2020-11-30 00:00:24,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:00:24,694 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-11-30 00:00:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:24,694 INFO L82 PathProgramCache]: Analyzing trace with hash 913667328, now seen corresponding path program 1 times [2020-11-30 00:00:24,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:24,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205364402] [2020-11-30 00:00:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:24,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205364402] [2020-11-30 00:00:24,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:24,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:24,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311805695] [2020-11-30 00:00:24,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:24,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:24,790 INFO L87 Difference]: Start difference. First operand 4575 states and 6818 transitions. Second operand 3 states. [2020-11-30 00:00:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:25,040 INFO L93 Difference]: Finished difference Result 8993 states and 13413 transitions. [2020-11-30 00:00:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:25,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-11-30 00:00:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:25,072 INFO L225 Difference]: With dead ends: 8993 [2020-11-30 00:00:25,072 INFO L226 Difference]: Without dead ends: 4441 [2020-11-30 00:00:25,081 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-11-30 00:00:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4441 states. [2020-11-30 00:00:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4441 to 4441. [2020-11-30 00:00:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4441 states. [2020-11-30 00:00:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4441 states to 4441 states and 6517 transitions. [2020-11-30 00:00:25,365 INFO L78 Accepts]: Start accepts. Automaton has 4441 states and 6517 transitions. Word has length 59 [2020-11-30 00:00:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:25,366 INFO L481 AbstractCegarLoop]: Abstraction has 4441 states and 6517 transitions. [2020-11-30 00:00:25,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4441 states and 6517 transitions. [2020-11-30 00:00:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-30 00:00:25,370 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:25,370 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, 1, 1, 1] [2020-11-30 00:00:25,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:00:25,371 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-11-30 00:00:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:25,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1092133666, now seen corresponding path program 1 times [2020-11-30 00:00:25,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:25,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54505508] [2020-11-30 00:00:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:25,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54505508] [2020-11-30 00:00:25,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:25,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:25,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794096233] [2020-11-30 00:00:25,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:25,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:25,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:25,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:25,443 INFO L87 Difference]: Start difference. First operand 4441 states and 6517 transitions. Second operand 3 states. [2020-11-30 00:00:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:25,812 INFO L93 Difference]: Finished difference Result 9529 states and 14152 transitions. [2020-11-30 00:00:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:25,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-11-30 00:00:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:25,868 INFO L225 Difference]: With dead ends: 9529 [2020-11-30 00:00:25,869 INFO L226 Difference]: Without dead ends: 5111 [2020-11-30 00:00:25,879 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-11-30 00:00:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2020-11-30 00:00:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 3435. [2020-11-30 00:00:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2020-11-30 00:00:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5103 transitions. [2020-11-30 00:00:26,164 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5103 transitions. Word has length 60 [2020-11-30 00:00:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:26,165 INFO L481 AbstractCegarLoop]: Abstraction has 3435 states and 5103 transitions. [2020-11-30 00:00:26,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5103 transitions. [2020-11-30 00:00:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-30 00:00:26,167 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:26,167 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, 1, 1, 1, 1, 1] [2020-11-30 00:00:26,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:00:26,167 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-11-30 00:00:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1116478291, now seen corresponding path program 1 times [2020-11-30 00:00:26,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:26,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828972178] [2020-11-30 00:00:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:26,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828972178] [2020-11-30 00:00:26,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:26,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:00:26,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386776440] [2020-11-30 00:00:26,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:00:26,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:00:26,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:26,285 INFO L87 Difference]: Start difference. First operand 3435 states and 5103 transitions. Second operand 6 states. [2020-11-30 00:00:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:27,945 INFO L93 Difference]: Finished difference Result 16325 states and 24095 transitions. [2020-11-30 00:00:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 00:00:27,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-11-30 00:00:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:27,984 INFO L225 Difference]: With dead ends: 16325 [2020-11-30 00:00:27,984 INFO L226 Difference]: Without dead ends: 13109 [2020-11-30 00:00:27,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-11-30 00:00:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13109 states. [2020-11-30 00:00:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13109 to 4301. [2020-11-30 00:00:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4301 states. [2020-11-30 00:00:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 6361 transitions. [2020-11-30 00:00:28,393 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 6361 transitions. Word has length 62 [2020-11-30 00:00:28,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:28,394 INFO L481 AbstractCegarLoop]: Abstraction has 4301 states and 6361 transitions. [2020-11-30 00:00:28,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:00:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 6361 transitions. [2020-11-30 00:00:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-30 00:00:28,396 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:28,397 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, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:28,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:00:28,397 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-11-30 00:00:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash 272023049, now seen corresponding path program 1 times [2020-11-30 00:00:28,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:28,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115739040] [2020-11-30 00:00:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:28,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115739040] [2020-11-30 00:00:28,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:28,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:00:28,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269766636] [2020-11-30 00:00:28,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:00:28,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:28,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:00:28,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:28,494 INFO L87 Difference]: Start difference. First operand 4301 states and 6361 transitions. Second operand 7 states. [2020-11-30 00:00:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:30,749 INFO L93 Difference]: Finished difference Result 29739 states and 43762 transitions. [2020-11-30 00:00:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-30 00:00:30,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-11-30 00:00:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:30,833 INFO L225 Difference]: With dead ends: 29739 [2020-11-30 00:00:30,834 INFO L226 Difference]: Without dead ends: 25657 [2020-11-30 00:00:30,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2020-11-30 00:00:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25657 states. [2020-11-30 00:00:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25657 to 4609. [2020-11-30 00:00:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2020-11-30 00:00:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 6771 transitions. [2020-11-30 00:00:31,425 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 6771 transitions. Word has length 63 [2020-11-30 00:00:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:31,426 INFO L481 AbstractCegarLoop]: Abstraction has 4609 states and 6771 transitions. [2020-11-30 00:00:31,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:00:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 6771 transitions. [2020-11-30 00:00:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 00:00:31,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:31,437 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:31,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:00:31,437 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-11-30 00:00:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:31,438 INFO L82 PathProgramCache]: Analyzing trace with hash -784911644, now seen corresponding path program 1 times [2020-11-30 00:00:31,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:31,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734235694] [2020-11-30 00:00:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:31,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734235694] [2020-11-30 00:00:31,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:31,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:31,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454558806] [2020-11-30 00:00:31,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:31,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:31,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:31,490 INFO L87 Difference]: Start difference. First operand 4609 states and 6771 transitions. Second operand 3 states. [2020-11-30 00:00:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:31,885 INFO L93 Difference]: Finished difference Result 9704 states and 14220 transitions. [2020-11-30 00:00:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:31,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-11-30 00:00:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:31,898 INFO L225 Difference]: With dead ends: 9704 [2020-11-30 00:00:31,898 INFO L226 Difference]: Without dead ends: 5116 [2020-11-30 00:00:31,906 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-11-30 00:00:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5116 states. [2020-11-30 00:00:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5116 to 5042. [2020-11-30 00:00:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2020-11-30 00:00:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 7376 transitions. [2020-11-30 00:00:32,275 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 7376 transitions. Word has length 77 [2020-11-30 00:00:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:32,276 INFO L481 AbstractCegarLoop]: Abstraction has 5042 states and 7376 transitions. [2020-11-30 00:00:32,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 7376 transitions. [2020-11-30 00:00:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-30 00:00:32,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:32,280 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, 1, 1, 1] [2020-11-30 00:00:32,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:00:32,280 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-11-30 00:00:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash 192772855, now seen corresponding path program 1 times [2020-11-30 00:00:32,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:32,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427136531] [2020-11-30 00:00:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:32,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427136531] [2020-11-30 00:00:32,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:32,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:00:32,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890226512] [2020-11-30 00:00:32,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:00:32,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:32,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:00:32,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:00:32,334 INFO L87 Difference]: Start difference. First operand 5042 states and 7376 transitions. Second operand 4 states. [2020-11-30 00:00:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:33,335 INFO L93 Difference]: Finished difference Result 13482 states and 19556 transitions. [2020-11-30 00:00:33,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:00:33,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-11-30 00:00:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:33,354 INFO L225 Difference]: With dead ends: 13482 [2020-11-30 00:00:33,355 INFO L226 Difference]: Without dead ends: 8340 [2020-11-30 00:00:33,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-30 00:00:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2020-11-30 00:00:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 7477. [2020-11-30 00:00:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7477 states. [2020-11-30 00:00:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 10736 transitions. [2020-11-30 00:00:34,056 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 10736 transitions. Word has length 88 [2020-11-30 00:00:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:34,056 INFO L481 AbstractCegarLoop]: Abstraction has 7477 states and 10736 transitions. [2020-11-30 00:00:34,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:00:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 10736 transitions. [2020-11-30 00:00:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-30 00:00:34,061 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:34,061 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:34,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:00:34,062 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-11-30 00:00:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:34,062 INFO L82 PathProgramCache]: Analyzing trace with hash 431809287, now seen corresponding path program 1 times [2020-11-30 00:00:34,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:34,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37793513] [2020-11-30 00:00:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:34,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37793513] [2020-11-30 00:00:34,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:34,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:34,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757673651] [2020-11-30 00:00:34,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:34,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:34,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:34,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:34,133 INFO L87 Difference]: Start difference. First operand 7477 states and 10736 transitions. Second operand 3 states. [2020-11-30 00:00:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:34,523 INFO L93 Difference]: Finished difference Result 10796 states and 15541 transitions. [2020-11-30 00:00:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:34,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-11-30 00:00:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:34,528 INFO L225 Difference]: With dead ends: 10796 [2020-11-30 00:00:34,528 INFO L226 Difference]: Without dead ends: 3327 [2020-11-30 00:00:34,537 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-11-30 00:00:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2020-11-30 00:00:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3274. [2020-11-30 00:00:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3274 states. [2020-11-30 00:00:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4409 transitions. [2020-11-30 00:00:34,758 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 4409 transitions. Word has length 95 [2020-11-30 00:00:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:34,758 INFO L481 AbstractCegarLoop]: Abstraction has 3274 states and 4409 transitions. [2020-11-30 00:00:34,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 4409 transitions. [2020-11-30 00:00:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-30 00:00:34,761 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:34,761 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, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:34,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:00:34,762 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-11-30 00:00:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:34,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1805141344, now seen corresponding path program 1 times [2020-11-30 00:00:34,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:34,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285302789] [2020-11-30 00:00:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:34,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285302789] [2020-11-30 00:00:34,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:34,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:34,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710674650] [2020-11-30 00:00:34,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:34,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:34,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:34,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:34,837 INFO L87 Difference]: Start difference. First operand 3274 states and 4409 transitions. Second operand 5 states. [2020-11-30 00:00:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:35,848 INFO L93 Difference]: Finished difference Result 12501 states and 16843 transitions. [2020-11-30 00:00:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:00:35,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-11-30 00:00:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:35,862 INFO L225 Difference]: With dead ends: 12501 [2020-11-30 00:00:35,862 INFO L226 Difference]: Without dead ends: 9401 [2020-11-30 00:00:35,870 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-11-30 00:00:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2020-11-30 00:00:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 3276. [2020-11-30 00:00:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2020-11-30 00:00:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4405 transitions. [2020-11-30 00:00:36,207 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4405 transitions. Word has length 98 [2020-11-30 00:00:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:36,208 INFO L481 AbstractCegarLoop]: Abstraction has 3276 states and 4405 transitions. [2020-11-30 00:00:36,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4405 transitions. [2020-11-30 00:00:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-30 00:00:36,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:36,210 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:36,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:00:36,211 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-11-30 00:00:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1429646299, now seen corresponding path program 1 times [2020-11-30 00:00:36,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:36,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315899000] [2020-11-30 00:00:36,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:36,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315899000] [2020-11-30 00:00:36,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606955048] [2020-11-30 00:00:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:36,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:00:36,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:00:36,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:00:36,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-11-30 00:00:36,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147337012] [2020-11-30 00:00:36,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:36,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:36,706 INFO L87 Difference]: Start difference. First operand 3276 states and 4405 transitions. Second operand 3 states. [2020-11-30 00:00:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:37,209 INFO L93 Difference]: Finished difference Result 3907 states and 5244 transitions. [2020-11-30 00:00:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:37,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-11-30 00:00:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:37,235 INFO L225 Difference]: With dead ends: 3907 [2020-11-30 00:00:37,235 INFO L226 Difference]: Without dead ends: 3903 [2020-11-30 00:00:37,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3903 states. [2020-11-30 00:00:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3903 to 3853. [2020-11-30 00:00:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2020-11-30 00:00:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5168 transitions. [2020-11-30 00:00:37,651 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5168 transitions. Word has length 100 [2020-11-30 00:00:37,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:37,652 INFO L481 AbstractCegarLoop]: Abstraction has 3853 states and 5168 transitions. [2020-11-30 00:00:37,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5168 transitions. [2020-11-30 00:00:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-30 00:00:37,660 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:37,661 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:37,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-30 00:00:37,878 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-11-30 00:00:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1356074224, now seen corresponding path program 1 times [2020-11-30 00:00:37,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:37,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733363245] [2020-11-30 00:00:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:38,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733363245] [2020-11-30 00:00:38,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594109601] [2020-11-30 00:00:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:38,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:00:38,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:00:38,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:00:38,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-11-30 00:00:38,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334575985] [2020-11-30 00:00:38,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:38,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:38,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:38,313 INFO L87 Difference]: Start difference. First operand 3853 states and 5168 transitions. Second operand 3 states. [2020-11-30 00:00:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:38,675 INFO L93 Difference]: Finished difference Result 6855 states and 9241 transitions. [2020-11-30 00:00:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:38,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2020-11-30 00:00:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:38,682 INFO L225 Difference]: With dead ends: 6855 [2020-11-30 00:00:38,682 INFO L226 Difference]: Without dead ends: 3011 [2020-11-30 00:00:38,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2020-11-30 00:00:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 2790. [2020-11-30 00:00:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2020-11-30 00:00:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3680 transitions. [2020-11-30 00:00:38,998 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3680 transitions. Word has length 153 [2020-11-30 00:00:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:38,998 INFO L481 AbstractCegarLoop]: Abstraction has 2790 states and 3680 transitions. [2020-11-30 00:00:38,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3680 transitions. [2020-11-30 00:00:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-11-30 00:00:39,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:39,003 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:39,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-11-30 00:00:39,230 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-11-30 00:00:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:39,230 INFO L82 PathProgramCache]: Analyzing trace with hash 677479033, now seen corresponding path program 1 times [2020-11-30 00:00:39,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:39,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156431434] [2020-11-30 00:00:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:00:39,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156431434] [2020-11-30 00:00:39,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535141551] [2020-11-30 00:00:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:39,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:00:39,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-30 00:00:39,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:00:39,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-11-30 00:00:39,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660075071] [2020-11-30 00:00:39,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:39,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:39,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:39,551 INFO L87 Difference]: Start difference. First operand 2790 states and 3680 transitions. Second operand 3 states. [2020-11-30 00:00:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:39,981 INFO L93 Difference]: Finished difference Result 5411 states and 7176 transitions. [2020-11-30 00:00:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:39,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-11-30 00:00:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:39,987 INFO L225 Difference]: With dead ends: 5411 [2020-11-30 00:00:39,987 INFO L226 Difference]: Without dead ends: 2790 [2020-11-30 00:00:39,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2020-11-30 00:00:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2790. [2020-11-30 00:00:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2020-11-30 00:00:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3584 transitions. [2020-11-30 00:00:40,326 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3584 transitions. Word has length 156 [2020-11-30 00:00:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:40,327 INFO L481 AbstractCegarLoop]: Abstraction has 2790 states and 3584 transitions. [2020-11-30 00:00:40,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3584 transitions. [2020-11-30 00:00:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-11-30 00:00:40,332 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:40,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:40,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-11-30 00:00:40,546 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-11-30 00:00:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:40,547 INFO L82 PathProgramCache]: Analyzing trace with hash -103612344, now seen corresponding path program 1 times [2020-11-30 00:00:40,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:40,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954390882] [2020-11-30 00:00:40,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:00:40,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954390882] [2020-11-30 00:00:40,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626100812] [2020-11-30 00:00:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:40,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 00:00:40,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-30 00:00:40,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:00:40,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-11-30 00:00:40,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8427058] [2020-11-30 00:00:40,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:40,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:40,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:40,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:40,933 INFO L87 Difference]: Start difference. First operand 2790 states and 3584 transitions. Second operand 3 states. [2020-11-30 00:00:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:41,915 INFO L93 Difference]: Finished difference Result 6302 states and 8253 transitions. [2020-11-30 00:00:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:41,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-11-30 00:00:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:41,922 INFO L225 Difference]: With dead ends: 6302 [2020-11-30 00:00:41,922 INFO L226 Difference]: Without dead ends: 3681 [2020-11-30 00:00:41,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:00:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2020-11-30 00:00:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3590. [2020-11-30 00:00:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2020-11-30 00:00:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 4497 transitions. [2020-11-30 00:00:42,295 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 4497 transitions. Word has length 157 [2020-11-30 00:00:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:42,295 INFO L481 AbstractCegarLoop]: Abstraction has 3590 states and 4497 transitions. [2020-11-30 00:00:42,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4497 transitions. [2020-11-30 00:00:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-11-30 00:00:42,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:42,299 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, 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] [2020-11-30 00:00:42,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:42,526 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-11-30 00:00:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash 507618642, now seen corresponding path program 1 times [2020-11-30 00:00:42,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:42,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722940290] [2020-11-30 00:00:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:00:42,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722940290] [2020-11-30 00:00:42,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423637052] [2020-11-30 00:00:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:42,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 00:00:42,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-30 00:00:43,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:00:43,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2020-11-30 00:00:43,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954115434] [2020-11-30 00:00:43,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:00:43,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:00:43,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:00:43,125 INFO L87 Difference]: Start difference. First operand 3590 states and 4497 transitions. Second operand 10 states. [2020-11-30 00:00:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:45,819 INFO L93 Difference]: Finished difference Result 19008 states and 23932 transitions. [2020-11-30 00:00:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-30 00:00:45,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2020-11-30 00:00:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:45,836 INFO L225 Difference]: With dead ends: 19008 [2020-11-30 00:00:45,836 INFO L226 Difference]: Without dead ends: 15587 [2020-11-30 00:00:45,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 173 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2020-11-30 00:00:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15587 states. [2020-11-30 00:00:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15587 to 5085. [2020-11-30 00:00:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5085 states. [2020-11-30 00:00:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5085 states to 5085 states and 6396 transitions. [2020-11-30 00:00:46,428 INFO L78 Accepts]: Start accepts. Automaton has 5085 states and 6396 transitions. Word has length 159 [2020-11-30 00:00:46,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:46,429 INFO L481 AbstractCegarLoop]: Abstraction has 5085 states and 6396 transitions. [2020-11-30 00:00:46,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:00:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5085 states and 6396 transitions. [2020-11-30 00:00:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-11-30 00:00:46,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:46,434 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:46,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:46,662 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-11-30 00:00:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:46,662 INFO L82 PathProgramCache]: Analyzing trace with hash 423282635, now seen corresponding path program 1 times [2020-11-30 00:00:46,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:46,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406650056] [2020-11-30 00:00:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 101 proven. 101 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:00:46,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406650056] [2020-11-30 00:00:46,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313835214] [2020-11-30 00:00:46,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:47,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 00:00:47,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:00:47,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:00:47,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2020-11-30 00:00:47,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134981863] [2020-11-30 00:00:47,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:00:47,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:00:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:00:47,178 INFO L87 Difference]: Start difference. First operand 5085 states and 6396 transitions. Second operand 7 states. [2020-11-30 00:00:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:48,007 INFO L93 Difference]: Finished difference Result 11178 states and 14067 transitions. [2020-11-30 00:00:48,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:00:48,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 257 [2020-11-30 00:00:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:48,016 INFO L225 Difference]: With dead ends: 11178 [2020-11-30 00:00:48,016 INFO L226 Difference]: Without dead ends: 6259 [2020-11-30 00:00:48,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:00:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2020-11-30 00:00:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 4955. [2020-11-30 00:00:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2020-11-30 00:00:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 6221 transitions. [2020-11-30 00:00:48,535 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 6221 transitions. Word has length 257 [2020-11-30 00:00:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:48,536 INFO L481 AbstractCegarLoop]: Abstraction has 4955 states and 6221 transitions. [2020-11-30 00:00:48,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:00:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 6221 transitions. [2020-11-30 00:00:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2020-11-30 00:00:48,539 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:48,539 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, 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] [2020-11-30 00:00:48,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:48,766 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-11-30 00:00:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:48,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1375120129, now seen corresponding path program 1 times [2020-11-30 00:00:48,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:48,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926886117] [2020-11-30 00:00:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-11-30 00:00:48,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926886117] [2020-11-30 00:00:48,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:48,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:48,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991625224] [2020-11-30 00:00:48,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:48,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:48,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:48,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:48,930 INFO L87 Difference]: Start difference. First operand 4955 states and 6221 transitions. Second operand 3 states. [2020-11-30 00:00:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:49,261 INFO L93 Difference]: Finished difference Result 5810 states and 7180 transitions. [2020-11-30 00:00:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:49,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2020-11-30 00:00:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:49,265 INFO L225 Difference]: With dead ends: 5810 [2020-11-30 00:00:49,265 INFO L226 Difference]: Without dead ends: 910 [2020-11-30 00:00:49,268 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-11-30 00:00:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2020-11-30 00:00:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 907. [2020-11-30 00:00:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2020-11-30 00:00:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 980 transitions. [2020-11-30 00:00:49,356 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 980 transitions. Word has length 258 [2020-11-30 00:00:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:49,356 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 980 transitions. [2020-11-30 00:00:49,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 980 transitions. [2020-11-30 00:00:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2020-11-30 00:00:49,358 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:49,358 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:49,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 00:00:49,359 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-11-30 00:00:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:49,359 INFO L82 PathProgramCache]: Analyzing trace with hash 406486491, now seen corresponding path program 1 times [2020-11-30 00:00:49,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:49,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900610510] [2020-11-30 00:00:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-11-30 00:00:49,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900610510] [2020-11-30 00:00:49,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:49,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:00:49,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376886266] [2020-11-30 00:00:49,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:00:49,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:00:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:00:49,647 INFO L87 Difference]: Start difference. First operand 907 states and 980 transitions. Second operand 7 states. [2020-11-30 00:00:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:50,247 INFO L93 Difference]: Finished difference Result 1870 states and 2021 transitions. [2020-11-30 00:00:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 00:00:50,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2020-11-30 00:00:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:50,252 INFO L225 Difference]: With dead ends: 1870 [2020-11-30 00:00:50,252 INFO L226 Difference]: Without dead ends: 1573 [2020-11-30 00:00:50,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-30 00:00:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-11-30 00:00:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 905. [2020-11-30 00:00:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2020-11-30 00:00:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 974 transitions. [2020-11-30 00:00:50,396 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 974 transitions. Word has length 259 [2020-11-30 00:00:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:50,397 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 974 transitions. [2020-11-30 00:00:50,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:00:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 974 transitions. [2020-11-30 00:00:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-11-30 00:00:50,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:50,401 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-30 00:00:50,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 00:00:50,402 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-11-30 00:00:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash -262886271, now seen corresponding path program 1 times [2020-11-30 00:00:50,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:50,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026000329] [2020-11-30 00:00:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2020-11-30 00:00:50,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026000329] [2020-11-30 00:00:50,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:50,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:00:50,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54716145] [2020-11-30 00:00:50,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:00:50,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:00:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:00:50,564 INFO L87 Difference]: Start difference. First operand 905 states and 974 transitions. Second operand 5 states. [2020-11-30 00:00:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:50,823 INFO L93 Difference]: Finished difference Result 1424 states and 1536 transitions. [2020-11-30 00:00:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:00:50,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 260 [2020-11-30 00:00:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:50,826 INFO L225 Difference]: With dead ends: 1424 [2020-11-30 00:00:50,826 INFO L226 Difference]: Without dead ends: 1125 [2020-11-30 00:00:50,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:00:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2020-11-30 00:00:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 887. [2020-11-30 00:00:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2020-11-30 00:00:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 941 transitions. [2020-11-30 00:00:50,926 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 941 transitions. Word has length 260 [2020-11-30 00:00:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:50,927 INFO L481 AbstractCegarLoop]: Abstraction has 887 states and 941 transitions. [2020-11-30 00:00:50,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:00:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 941 transitions. [2020-11-30 00:00:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2020-11-30 00:00:50,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:50,931 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, 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] [2020-11-30 00:00:50,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 00:00:50,931 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-11-30 00:00:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1917736399, now seen corresponding path program 1 times [2020-11-30 00:00:50,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:50,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410534595] [2020-11-30 00:00:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2020-11-30 00:00:51,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410534595] [2020-11-30 00:00:51,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:51,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:00:51,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765847630] [2020-11-30 00:00:51,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:00:51,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:51,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:00:51,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:00:51,087 INFO L87 Difference]: Start difference. First operand 887 states and 941 transitions. Second operand 3 states. [2020-11-30 00:00:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:51,224 INFO L93 Difference]: Finished difference Result 1397 states and 1479 transitions. [2020-11-30 00:00:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:00:51,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2020-11-30 00:00:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:51,225 INFO L225 Difference]: With dead ends: 1397 [2020-11-30 00:00:51,225 INFO L226 Difference]: Without dead ends: 768 [2020-11-30 00:00:51,226 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-11-30 00:00:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2020-11-30 00:00:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 618. [2020-11-30 00:00:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-11-30 00:00:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 656 transitions. [2020-11-30 00:00:51,292 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 656 transitions. Word has length 318 [2020-11-30 00:00:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:51,293 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 656 transitions. [2020-11-30 00:00:51,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:00:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 656 transitions. [2020-11-30 00:00:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2020-11-30 00:00:51,295 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:51,295 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, 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] [2020-11-30 00:00:51,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-30 00:00:51,295 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-11-30 00:00:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1896150639, now seen corresponding path program 1 times [2020-11-30 00:00:51,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:51,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020919637] [2020-11-30 00:00:51,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-11-30 00:00:51,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020919637] [2020-11-30 00:00:51,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367258154] [2020-11-30 00:00:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:00:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:52,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-30 00:00:52,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 39 proven. 119 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-11-30 00:00:52,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:00:52,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2020-11-30 00:00:52,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962032191] [2020-11-30 00:00:52,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 00:00:52,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:52,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 00:00:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2020-11-30 00:00:52,473 INFO L87 Difference]: Start difference. First operand 618 states and 656 transitions. Second operand 19 states. [2020-11-30 00:00:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:53,703 INFO L93 Difference]: Finished difference Result 782 states and 836 transitions. [2020-11-30 00:00:53,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 00:00:53,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 318 [2020-11-30 00:00:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:53,705 INFO L225 Difference]: With dead ends: 782 [2020-11-30 00:00:53,705 INFO L226 Difference]: Without dead ends: 780 [2020-11-30 00:00:53,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=1443, Unknown=0, NotChecked=0, Total=1722 [2020-11-30 00:00:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-11-30 00:00:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 618. [2020-11-30 00:00:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-11-30 00:00:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 655 transitions. [2020-11-30 00:00:53,792 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 655 transitions. Word has length 318 [2020-11-30 00:00:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:53,792 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 655 transitions. [2020-11-30 00:00:53,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 00:00:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 655 transitions. [2020-11-30 00:00:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2020-11-30 00:00:53,794 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:53,795 INFO L422 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:53,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-30 00:00:53,996 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-11-30 00:00:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash -623480570, now seen corresponding path program 1 times [2020-11-30 00:00:53,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:53,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309036488] [2020-11-30 00:00:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-30 00:00:54,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309036488] [2020-11-30 00:00:54,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124999140] [2020-11-30 00:00:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/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-11-30 00:00:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:54,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 00:00:54,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 133 proven. 47 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-30 00:00:54,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:00:54,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2020-11-30 00:00:54,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740973751] [2020-11-30 00:00:54,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:00:54,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:54,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:00:54,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:00:54,841 INFO L87 Difference]: Start difference. First operand 618 states and 655 transitions. Second operand 10 states. [2020-11-30 00:00:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:55,319 INFO L93 Difference]: Finished difference Result 803 states and 854 transitions. [2020-11-30 00:00:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-30 00:00:55,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 364 [2020-11-30 00:00:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:55,321 INFO L225 Difference]: With dead ends: 803 [2020-11-30 00:00:55,321 INFO L226 Difference]: Without dead ends: 738 [2020-11-30 00:00:55,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2020-11-30 00:00:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-11-30 00:00:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 616. [2020-11-30 00:00:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2020-11-30 00:00:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 652 transitions. [2020-11-30 00:00:55,395 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 652 transitions. Word has length 364 [2020-11-30 00:00:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:55,395 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 652 transitions. [2020-11-30 00:00:55,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:00:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 652 transitions. [2020-11-30 00:00:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2020-11-30 00:00:55,398 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:00:55,398 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:00:55,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-11-30 00:00:55,599 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-11-30 00:00:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:00:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1735362484, now seen corresponding path program 1 times [2020-11-30 00:00:55,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:00:55,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840927563] [2020-11-30 00:00:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:00:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 86 proven. 332 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:00:56,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840927563] [2020-11-30 00:00:56,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658052751] [2020-11-30 00:00:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/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-11-30 00:00:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:00:56,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 45 conjunts are in the unsatisfiable core [2020-11-30 00:00:56,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:00:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 88 proven. 330 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-30 00:00:57,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:00:57,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 31 [2020-11-30 00:00:57,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858026689] [2020-11-30 00:00:57,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-30 00:00:57,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:00:57,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-30 00:00:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2020-11-30 00:00:57,368 INFO L87 Difference]: Start difference. First operand 616 states and 652 transitions. Second operand 31 states. [2020-11-30 00:00:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:00:58,805 INFO L93 Difference]: Finished difference Result 738 states and 786 transitions. [2020-11-30 00:00:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-30 00:00:58,805 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 424 [2020-11-30 00:00:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:00:58,810 INFO L225 Difference]: With dead ends: 738 [2020-11-30 00:00:58,810 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 00:00:58,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 430 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=505, Invalid=3655, Unknown=0, NotChecked=0, Total=4160 [2020-11-30 00:00:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 00:00:58,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 00:00:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 00:00:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 00:00:58,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 424 [2020-11-30 00:00:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:00:58,814 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 00:00:58,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-30 00:00:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 00:00:58,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 00:00:59,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-11-30 00:00:59,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 00:00:59,688 WARN L193 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 245 [2020-11-30 00:01:00,916 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 407 DAG size of output: 246 [2020-11-30 00:01:01,854 WARN L193 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 320 [2020-11-30 00:01:02,133 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 90 [2020-11-30 00:01:02,520 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 161 [2020-11-30 00:01:02,866 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 240 [2020-11-30 00:01:04,722 WARN L193 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 889 DAG size of output: 674 [2020-11-30 00:01:04,890 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 90 [2020-11-30 00:01:05,173 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 178 [2020-11-30 00:01:05,395 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 90 [2020-11-30 00:01:05,696 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 212 [2020-11-30 00:01:05,955 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 240 [2020-11-30 00:01:06,160 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 199 [2020-11-30 00:01:06,450 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 240 [2020-11-30 00:01:06,712 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 222 [2020-11-30 00:01:07,437 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 257 [2020-11-30 00:01:07,798 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 212 [2020-11-30 00:01:08,088 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 212 [2020-11-30 00:01:08,378 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 240 [2020-11-30 00:01:08,485 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 163 [2020-11-30 00:01:08,709 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 247 [2020-11-30 00:01:08,947 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 240 [2020-11-30 00:01:09,768 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 212 [2020-11-30 00:01:10,451 WARN L193 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 237 [2020-11-30 00:01:10,788 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 212 [2020-11-30 00:01:10,951 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 150 [2020-11-30 00:01:12,922 WARN L193 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 895 DAG size of output: 668 [2020-11-30 00:01:13,151 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 203 [2020-11-30 00:01:13,633 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 234 [2020-11-30 00:01:14,316 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 246 [2020-11-30 00:01:14,562 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 152 [2020-11-30 00:01:14,849 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 212 [2020-11-30 00:01:16,226 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 238 DAG size of output: 88 [2020-11-30 00:01:17,616 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 231 DAG size of output: 101 [2020-11-30 00:01:19,503 WARN L193 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 312 DAG size of output: 108 [2020-11-30 00:01:19,830 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2020-11-30 00:01:20,201 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2020-11-30 00:01:20,715 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2020-11-30 00:01:21,276 WARN L193 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2020-11-30 00:01:21,962 WARN L193 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2020-11-30 00:01:22,144 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 00:01:22,299 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 00:01:22,794 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-11-30 00:01:23,816 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 215 DAG size of output: 94 [2020-11-30 00:01:28,979 WARN L193 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 632 DAG size of output: 151 [2020-11-30 00:01:29,303 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2020-11-30 00:01:30,152 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 97 [2020-11-30 00:01:30,623 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 73 [2020-11-30 00:01:30,941 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2020-11-30 00:01:31,403 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 78 [2020-11-30 00:01:32,363 WARN L193 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 60 [2020-11-30 00:01:32,768 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2020-11-30 00:01:33,065 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-30 00:01:34,057 WARN L193 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 94 [2020-11-30 00:01:34,736 WARN L193 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 78 [2020-11-30 00:01:35,283 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2020-11-30 00:01:35,580 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-30 00:01:36,576 WARN L193 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 94 [2020-11-30 00:01:36,843 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2020-11-30 00:01:37,600 WARN L193 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 78 [2020-11-30 00:01:38,070 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 73 [2020-11-30 00:01:38,488 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2020-11-30 00:01:38,713 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2020-11-30 00:01:40,423 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 245 DAG size of output: 112 [2020-11-30 00:01:40,596 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-30 00:01:41,153 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 79 [2020-11-30 00:01:42,114 WARN L193 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 60 [2020-11-30 00:01:42,506 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2020-11-30 00:01:43,489 WARN L193 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 60 [2020-11-30 00:01:43,723 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-30 00:01:44,031 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-30 00:01:45,033 WARN L193 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 94 [2020-11-30 00:01:45,469 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 85 [2020-11-30 00:01:46,763 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 224 DAG size of output: 96 [2020-11-30 00:01:47,069 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-30 00:01:48,063 WARN L193 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 94 [2020-11-30 00:01:48,641 WARN L193 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2020-11-30 00:01:48,996 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2020-11-30 00:01:49,563 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2020-11-30 00:01:49,739 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-30 00:01:50,315 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 79 [2020-11-30 00:01:50,470 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-11-30 00:01:50,670 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 24 [2020-11-30 00:01:50,841 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-30 00:01:51,354 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 79 [2020-11-30 00:01:51,878 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 79 [2020-11-30 00:01:52,870 WARN L193 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 60 [2020-11-30 00:01:53,143 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-30 00:01:54,297 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 227 DAG size of output: 60 [2020-11-30 00:01:54,834 WARN L193 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 79 [2020-11-30 00:01:55,807 WARN L193 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 60 [2020-11-30 00:01:56,085 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-30 00:01:56,391 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-30 00:01:56,987 WARN L193 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 72 [2020-11-30 00:01:57,291 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-30 00:01:57,451 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 00:01:57,954 WARN L193 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 79 [2020-11-30 00:01:58,216 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 47 [2020-11-30 00:01:58,375 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 00:02:03,795 WARN L193 SmtUtils]: Spent 5.32 s on a formula simplification. DAG size of input: 629 DAG size of output: 151 [2020-11-30 00:02:03,969 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-30 00:02:04,887 WARN L193 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 66 [2020-11-30 00:02:05,059 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-30 00:02:05,230 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-11-30 00:02:06,040 WARN L193 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2020-11-30 00:02:06,312 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-30 00:02:07,811 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 224 DAG size of output: 102 [2020-11-30 00:02:08,080 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-30 00:02:09,454 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 231 DAG size of output: 101 [2020-11-30 00:02:09,726 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2020-11-30 00:02:10,142 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2020-11-30 00:02:10,625 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 79 [2020-11-30 00:02:10,785 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 00:02:11,514 WARN L193 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 69 [2020-11-30 00:02:11,748 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-30 00:02:12,846 WARN L193 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 202 DAG size of output: 60 [2020-11-30 00:02:12,851 INFO L274 CegarLoopResult]: For program point L762(lines 762 766) no Hoare annotation was computed. [2020-11-30 00:02:12,851 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,851 INFO L274 CegarLoopResult]: For program point L696(lines 696 700) no Hoare annotation was computed. [2020-11-30 00:02:12,852 INFO L270 CegarLoopResult]: At program point L1291(lines 1284 1310) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 (<= 1 ~a_t~0) .cse9 .cse8 .cse4 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2020-11-30 00:02:12,853 INFO L270 CegarLoopResult]: At program point L234(lines 227 262) the Hoare annotation is: (let ((.cse13 (= ~m_run_pc~0 0)) (.cse7 (= ~c_empty_rsp~0 1))) (let ((.cse8 (= ~s_run_pc~0 0)) (.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse18 (or (and .cse7 .cse13) (and .cse7 (= ~m_run_pc~0 3)))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse5 (= ~a_t~0 0)) (.cse17 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse7 .cse16 (not (= ~c_req_type~0 0)) .cse1 .cse12 .cse13 .cse3 .cse4 .cse17) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 .cse18 (<= 1 ~c_req_a~0) .cse1 .cse19 .cse2 (= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ~c_req_d~0) .cse5 .cse17 .cse6 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= 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 .cse0 .cse16 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15)))) [2020-11-30 00:02:12,853 INFO L274 CegarLoopResult]: For program point L102(lines 102 126) no Hoare annotation was computed. [2020-11-30 00:02:12,853 INFO L274 CegarLoopResult]: For program point L1093(lines 1093 1097) no Hoare annotation was computed. [2020-11-30 00:02:12,853 INFO L270 CegarLoopResult]: At program point L103(lines 98 840) the Hoare annotation is: false [2020-11-30 00:02:12,853 INFO L270 CegarLoopResult]: At program point L434(lines 427 453) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,853 INFO L274 CegarLoopResult]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2020-11-30 00:02:12,854 INFO L274 CegarLoopResult]: For program point L236(lines 236 240) no Hoare annotation was computed. [2020-11-30 00:02:12,854 INFO L274 CegarLoopResult]: For program point L963(lines 963 967) no Hoare annotation was computed. [2020-11-30 00:02:12,854 INFO L270 CegarLoopResult]: At program point L171(lines 141 172) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0))) (let ((.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse5 (= ~c_req_a~0 0)) (.cse10 (= ~c_req_type~0 0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse18 (= ~s_run_pc~0 0)) (.cse19 (not .cse2)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse16 (= ~m_run_pc~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse17 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse7 (= ~a_t~0 0)) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse15 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse3 .cse4 .cse5 .cse7 .cse6 .cse17 .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15 .cse16) (and .cse18 .cse9 .cse11 .cse1 .cse19 .cse14 .cse3 .cse16 .cse4 .cse6 .cse17) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse3 .cse2 (= ~m_run_pc~0 3) .cse4 (= ULTIMATE.start_s_memory_write_~v 50) .cse7 .cse8 .cse9 (<= ULTIMATE.start_m_run_~a~0 1) .cse11 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse13 .cse15 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0))))) [2020-11-30 00:02:12,854 INFO L274 CegarLoopResult]: For program point L105(lines 105 125) no Hoare annotation was computed. [2020-11-30 00:02:12,854 INFO L274 CegarLoopResult]: For program point L1030(lines 1030 1083) no Hoare annotation was computed. [2020-11-30 00:02:12,855 INFO L270 CegarLoopResult]: At program point L568(lines 561 614) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) (= ~c_req_a~0 0) .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse4 .cse3 .cse2 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 .cse7 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-11-30 00:02:12,855 INFO L274 CegarLoopResult]: For program point L436(lines 436 440) no Hoare annotation was computed. [2020-11-30 00:02:12,855 INFO L270 CegarLoopResult]: At program point L106(lines 98 840) the Hoare annotation is: false [2020-11-30 00:02:12,855 INFO L274 CegarLoopResult]: For program point L1031(lines 1031 1035) no Hoare annotation was computed. [2020-11-30 00:02:12,856 INFO L270 CegarLoopResult]: At program point L635-2(lines 635 663) the Hoare annotation is: (let ((.cse14 (<= 1 ~a_t~0)) (.cse18 (= ~req_tt_a~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse21 (= ~c_req_a~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse22 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse23 (= ULTIMATE.start_m_run_~a~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse1 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse20 (<= 0 ~a_t~0)) (.cse3 (<= 1 ~c_req_a~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse25 (= ~a_t~0 0)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse19 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (<= ~c_req_a~0 1)) (.cse16 (= ~s_memory0~0 50)) (.cse24 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0)) (.cse12 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse2 .cse3 .cse4 .cse5 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 .cse9 .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse17 .cse18) (and .cse13 .cse19 .cse9 .cse2 .cse14 .cse10 .cse5 .cse6 .cse11 .cse12) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse20 .cse4 .cse6 .cse5 .cse21 .cse19 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse16 .cse22 .cse10 .cse23 .cse11 .cse17) (and .cse0 .cse13 .cse1 .cse20 .cse3 .cse6 .cse5 .cse4 .cse15 .cse19 .cse7 .cse8 .cse16 .cse24 .cse10 .cse11 .cse17 .cse18 .cse12) (and .cse19 (<= 0 ULTIMATE.start_m_run_~a~0) .cse20 .cse2 .cse10 .cse6 .cse5 .cse11 .cse17) (and .cse0 .cse13 .cse2 (= ~req_tt_a~0 0) .cse5 .cse6 .cse4 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse25 .cse15 .cse7 .cse9 (= ~c_rsp_d~0 50) .cse16 .cse24 .cse22 .cse10 .cse23 .cse11 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse17 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse13 .cse1 .cse20 .cse3 .cse6 .cse5 .cse4 .cse25 .cse15 .cse19 .cse7 .cse8 .cse16 .cse24 (= ULTIMATE.start_m_run_~a~0 1) .cse10 .cse11 .cse17 .cse12))) [2020-11-30 00:02:12,856 INFO L270 CegarLoopResult]: At program point L768(lines 761 805) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 6 ~m_run_pc~0)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~s_memory0~0 50))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 .cse12 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse13 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) (= ~req_tt_a~0 1)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse11 .cse12 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50)))) [2020-11-30 00:02:12,857 INFO L270 CegarLoopResult]: At program point L702(lines 695 721) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse4 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,857 INFO L274 CegarLoopResult]: For program point L636(lines 635 663) no Hoare annotation was computed. [2020-11-30 00:02:12,857 INFO L274 CegarLoopResult]: For program point L570(lines 570 574) no Hoare annotation was computed. [2020-11-30 00:02:12,857 INFO L274 CegarLoopResult]: For program point L108(lines 108 124) no Hoare annotation was computed. [2020-11-30 00:02:12,858 INFO L270 CegarLoopResult]: At program point L901(lines 875 902) the Hoare annotation is: (let ((.cse8 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_d~0 50)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~a_t~0 0)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse14 (= ~s_memory1~0 51)) (.cse15 (= ~m_run_pc~0 6)) (.cse0 (not (= ~s_run_st~0 0))) (.cse19 (<= 1 ~a_t~0)) (.cse20 (<= 1 ~c_req_a~0)) (.cse16 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse17 (= ~c_req_type~0 0)) (.cse21 (<= ~c_req_a~0 1)) (.cse18 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse16 .cse5 .cse6 .cse7 .cse17 .cse18 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse19 .cse20 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ~c_req_d~0) .cse7 .cse21 .cse18 .cse9 .cse11 .cse12 .cse22 (<= ~c_req_d~0 51)) (and .cse14 .cse15 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse0 .cse19 .cse20 .cse16 .cse1 .cse2 .cse7 .cse17 .cse21 .cse18 .cse9 .cse11 .cse12 (= ~req_tt_a~0 1) .cse22))) [2020-11-30 00:02:12,858 INFO L274 CegarLoopResult]: For program point L637(lines 637 641) no Hoare annotation was computed. [2020-11-30 00:02:12,858 INFO L270 CegarLoopResult]: At program point L109(lines 98 840) the Hoare annotation is: (let ((.cse4 (= 2 ~s_run_pc~0))) (let ((.cse2 (<= 1 ~a_t~0)) (.cse9 (<= 51 ~c_req_d~0)) (.cse15 (<= ~c_req_d~0 51)) (.cse5 (= ~c_req_type~0 1)) (.cse18 (= ~s_run_pc~0 0)) (.cse3 (not (= ~c_req_type~0 0))) (.cse20 (not .cse4)) (.cse16 (= ~c_req_a~0 0)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse17 (= ~a_t~0 0)) (.cse23 (= ~c_empty_req~0 1)) (.cse11 (= ~s_memory0~0 50)) (.cse19 (<= 50 ~c_req_d~0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse21 (<= ~c_req_d~0 50)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse22 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse13 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~c_req_a~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_req_a~0 1) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse3 .cse6 .cse5 .cse7 .cse16 .cse17 .cse18 .cse10 .cse19 .cse20 .cse12 .cse13 .cse14 .cse21) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse22 .cse2 .cse6 .cse4 (= 51 ULTIMATE.start_s_memory_write_~v) .cse7 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse23 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse10 .cse19 .cse12 .cse13 .cse14 .cse21) (and .cse10 .cse23 .cse6 .cse4 .cse7) (and .cse18 .cse10 .cse22 .cse3 .cse20 .cse6 .cse7 .cse16) (and .cse0 .cse1 .cse22 .cse6 .cse4 .cse7 .cse8 .cse17 .cse23 .cse11 .cse19 .cse12 .cse13 .cse14 .cse21) (and .cse10 .cse22 .cse6 .cse4 .cse7 .cse13)))) [2020-11-30 00:02:12,859 INFO L270 CegarLoopResult]: At program point L175-2(lines 175 203) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse0 (= ~s_run_pc~0 0)) (.cse13 (= ~c_req_type~0 0)) (.cse14 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse6 (= ~m_run_pc~0 0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse9 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (<= 2 ~c_m_ev~0)) (.cse16 (<= 2 ~c_write_req_ev~0)) (.cse17 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse3 .cse9 .cse4 .cse10 .cse7 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse15 .cse5 .cse16 .cse6 .cse17) (and .cse8 .cse4 .cse10 .cse11 .cse7 .cse12 .cse0 .cse1 .cse13 .cse2 .cse14 .cse15 .cse5 .cse16 .cse6 .cse17) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 .cse9 .cse4 (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) .cse11 .cse12 .cse1 (<= ULTIMATE.start_m_run_~a~0 1) .cse2 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse15 .cse16 .cse17 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,859 INFO L274 CegarLoopResult]: For program point L770(lines 770 774) no Hoare annotation was computed. [2020-11-30 00:02:12,859 INFO L274 CegarLoopResult]: For program point L704(lines 704 708) no Hoare annotation was computed. [2020-11-30 00:02:12,859 INFO L270 CegarLoopResult]: At program point L1299(lines 1292 1309) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 (<= 1 ~a_t~0) .cse9 .cse8 .cse4 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2020-11-30 00:02:12,860 INFO L270 CegarLoopResult]: At program point L242(lines 235 261) the Hoare annotation is: (let ((.cse13 (= ~m_run_pc~0 0)) (.cse7 (= ~c_empty_rsp~0 1))) (let ((.cse8 (= ~s_run_pc~0 0)) (.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse18 (or (and .cse7 .cse13) (and .cse7 (= ~m_run_pc~0 3)))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse5 (= ~a_t~0 0)) (.cse17 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse7 .cse16 (not (= ~c_req_type~0 0)) .cse1 .cse12 .cse13 .cse3 .cse4 .cse17) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 .cse18 (<= 1 ~c_req_a~0) .cse1 .cse19 .cse2 (= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ~c_req_d~0) .cse5 .cse17 .cse6 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= 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 .cse0 .cse16 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15)))) [2020-11-30 00:02:12,860 INFO L274 CegarLoopResult]: For program point L176(lines 175 203) no Hoare annotation was computed. [2020-11-30 00:02:12,860 INFO L270 CegarLoopResult]: At program point L969(lines 962 979) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~c_req_type~0 0))) (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ~c_req_d~0 50)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse29 (<= 1 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 1 ~a_t~0)) (.cse3 (not .cse25)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (not .cse24)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse26 (= ~s_memory0~0 50)) (.cse31 (< 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 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 .cse21 .cse22 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse26 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse27 .cse2 .cse28 .cse29 .cse4 .cse6 .cse23 .cse24 .cse12 .cse25 .cse30 .cse13 .cse26 .cse16 .cse18 .cse31 .cse19 (= ~req_tt_a~0 1) .cse32) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse2 .cse29 .cse4 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v 50) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 .cse32 .cse28 .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 .cse26 .cse31 .cse19 (<= ~c_req_d~0 51))))) [2020-11-30 00:02:12,860 INFO L274 CegarLoopResult]: For program point L1300(lines 1252 1341) no Hoare annotation was computed. [2020-11-30 00:02:12,861 INFO L274 CegarLoopResult]: For program point L1234(lines 1234 1238) no Hoare annotation was computed. [2020-11-30 00:02:12,861 INFO L274 CegarLoopResult]: For program point L177(lines 177 181) no Hoare annotation was computed. [2020-11-30 00:02:12,861 INFO L274 CegarLoopResult]: For program point L111(lines 111 123) no Hoare annotation was computed. [2020-11-30 00:02:12,861 INFO L274 CegarLoopResult]: For program point L970(lines 962 979) no Hoare annotation was computed. [2020-11-30 00:02:12,861 INFO L270 CegarLoopResult]: At program point L442(lines 435 452) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,863 INFO L274 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-11-30 00:02:12,863 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,863 INFO L274 CegarLoopResult]: For program point L1301(lines 1301 1305) no Hoare annotation was computed. [2020-11-30 00:02:12,863 INFO L274 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-11-30 00:02:12,864 INFO L274 CegarLoopResult]: For program point L1169(lines 1169 1173) no Hoare annotation was computed. [2020-11-30 00:02:12,864 INFO L270 CegarLoopResult]: At program point L112(lines 98 840) the Hoare annotation is: false [2020-11-30 00:02:12,864 INFO L274 CegarLoopResult]: For program point L1169-2(lines 1167 1346) no Hoare annotation was computed. [2020-11-30 00:02:12,865 INFO L270 CegarLoopResult]: At program point L1037(lines 1030 1083) the Hoare annotation is: (let ((.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= ~m_run_pc~0 3)) (.cse19 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse5 (= ~a_t~0 0)) (.cse20 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= ~c_req_d~0 50)) (.cse0 (= ~s_memory1~0 51)) (.cse2 (= ~c_write_rsp_ev~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse14 (<= 1 ~a_t~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse5 .cse6 .cse7 .cse8 (= ~c_rsp_d~0 50) .cse9 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse2 .cse4 .cse3 .cse15 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 .cse9 .cse10 .cse12 .cse13 .cse16 (<= ~c_req_d~0 51)) (and .cse17 .cse18 (not (= ~s_run_st~0 0)) .cse2 (= ~c_req_type~0 1) .cse15 (= ULTIMATE.start_s_run_~req_type~1 1) .cse19 .cse5 (= ~s_run_pc~0 0) .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse17 .cse18 .cse2 .cse3 .cse15 .cse19 .cse5 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse16 .cse1 .cse14 .cse6 .cse9 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,865 INFO L274 CegarLoopResult]: For program point L971(lines 971 975) no Hoare annotation was computed. [2020-11-30 00:02:12,865 INFO L274 CegarLoopResult]: For program point L443(lines 131 477) no Hoare annotation was computed. [2020-11-30 00:02:12,865 INFO L270 CegarLoopResult]: At program point L576(lines 569 613) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) (= ~c_req_a~0 0) .cse5 .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse4 .cse3 .cse2 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 .cse7 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-11-30 00:02:12,866 INFO L274 CegarLoopResult]: For program point L444(lines 444 448) no Hoare annotation was computed. [2020-11-30 00:02:12,866 INFO L274 CegarLoopResult]: For program point L114(lines 114 122) no Hoare annotation was computed. [2020-11-30 00:02:12,866 INFO L274 CegarLoopResult]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2020-11-30 00:02:12,866 INFO L270 CegarLoopResult]: At program point L115(lines 98 840) the Hoare annotation is: false [2020-11-30 00:02:12,866 INFO L274 CegarLoopResult]: For program point L908(lines 908 961) no Hoare annotation was computed. [2020-11-30 00:02:12,867 INFO L270 CegarLoopResult]: At program point L776(lines 769 804) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 6 ~m_run_pc~0)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~s_memory0~0 50))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 .cse12 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse13 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) (= ~req_tt_a~0 1)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse11 .cse12 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50)))) [2020-11-30 00:02:12,867 INFO L270 CegarLoopResult]: At program point L710(lines 703 720) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse4 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,868 INFO L274 CegarLoopResult]: For program point L578(lines 578 582) no Hoare annotation was computed. [2020-11-30 00:02:12,868 INFO L277 CegarLoopResult]: At program point L1371(lines 1348 1373) the Hoare annotation is: true [2020-11-30 00:02:12,868 INFO L270 CegarLoopResult]: At program point L314(lines 284 315) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 (<= 50 ~c_req_d~0) .cse6 (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,868 INFO L274 CegarLoopResult]: For program point L909(lines 909 913) no Hoare annotation was computed. [2020-11-30 00:02:12,868 INFO L274 CegarLoopResult]: For program point L711(lines 482 834) no Hoare annotation was computed. [2020-11-30 00:02:12,869 INFO L270 CegarLoopResult]: At program point L1240(lines 1233 1250) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2020-11-30 00:02:12,869 INFO L274 CegarLoopResult]: For program point L1174-1(lines 1167 1346) no Hoare annotation was computed. [2020-11-30 00:02:12,869 INFO L274 CegarLoopResult]: For program point L117(lines 117 121) no Hoare annotation was computed. [2020-11-30 00:02:12,869 INFO L274 CegarLoopResult]: For program point L778(lines 778 782) no Hoare annotation was computed. [2020-11-30 00:02:12,869 INFO L274 CegarLoopResult]: For program point L712(lines 712 716) no Hoare annotation was computed. [2020-11-30 00:02:12,870 INFO L270 CegarLoopResult]: At program point L382(lines 375 392) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= 51 ~c_req_d~0) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,870 INFO L270 CegarLoopResult]: At program point L250(lines 243 260) the Hoare annotation is: (let ((.cse13 (= ~m_run_pc~0 0)) (.cse7 (= ~c_empty_rsp~0 1))) (let ((.cse8 (= ~s_run_pc~0 0)) (.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (not (= ~s_run_st~0 0))) (.cse18 (or (and .cse7 .cse13) (and .cse7 (= ~m_run_pc~0 3)))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse19 (= 2 ~s_run_pc~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse5 (= ~a_t~0 0)) (.cse17 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 .cse7 .cse16 (not (= ~c_req_type~0 0)) .cse1 .cse12 .cse13 .cse3 .cse4 .cse17) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 .cse18 (<= 1 ~c_req_a~0) .cse1 .cse19 .cse2 (= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ~c_req_d~0) .cse5 .cse17 .cse6 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= 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 .cse0 .cse16 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15)))) [2020-11-30 00:02:12,871 INFO L270 CegarLoopResult]: At program point L118(lines 98 840) the Hoare annotation is: (let ((.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse19 (= ~req_tt_a~0 0)) (.cse20 (= ~c_req_a~0 0)) (.cse21 (= ~a_t~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse3 (<= 1 ~c_req_a~0)) (.cse6 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse22 (<= 6 ~m_run_pc~0)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (<= ~c_req_a~0 1)) (.cse17 (= ~c_empty_req~0 1)) (.cse2 (<= 1 ~a_t~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~s_memory0~0 50)) (.cse16 (= ~req_tt_a~0 1)) (.cse1 (= ~m_run_pc~0 6)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse18 (not (= ~s_run_st~0 0))) (.cse13 (<= 2 ~c_m_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse8 .cse17 .cse18 .cse2 .cse13 .cse4 .cse5 .cse14) (and .cse0 .cse1 .cse18 .cse19 .cse6 .cse4 .cse5 .cse20 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse21 .cse22 .cse7 .cse9 (= ~c_rsp_d~0 50) .cse17 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse19 .cse4 .cse6 .cse5 .cse20 .cse21 .cse8 .cse9 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse11 .cse13 .cse14 .cse15) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) .cse18 .cse3 .cse6 .cse4 .cse5 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse22 .cse9 .cse10 .cse17 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse14 .cse1 .cse2 .cse7 .cse11 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse15 .cse16) (and .cse1 .cse8 (<= 0 ~a_t~0) .cse18 .cse13 .cse4 .cse5 .cse14 .cse15))) [2020-11-30 00:02:12,871 INFO L274 CegarLoopResult]: For program point L383(lines 375 392) no Hoare annotation was computed. [2020-11-30 00:02:12,871 INFO L274 CegarLoopResult]: For program point L251(lines 131 477) no Hoare annotation was computed. [2020-11-30 00:02:12,871 INFO L274 CegarLoopResult]: For program point L1242(lines 1242 1246) no Hoare annotation was computed. [2020-11-30 00:02:12,872 INFO L274 CegarLoopResult]: For program point L384(lines 384 388) no Hoare annotation was computed. [2020-11-30 00:02:12,872 INFO L274 CegarLoopResult]: For program point L252(lines 252 256) no Hoare annotation was computed. [2020-11-30 00:02:12,872 INFO L270 CegarLoopResult]: At program point L1045(lines 1038 1082) the Hoare annotation is: (let ((.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse15 (= ~m_run_pc~0 3)) (.cse19 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse5 (= ~a_t~0 0)) (.cse20 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= ~c_req_d~0 50)) (.cse0 (= ~s_memory1~0 51)) (.cse2 (= ~c_write_rsp_ev~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse14 (<= 1 ~a_t~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse5 .cse6 .cse7 .cse8 (= ~c_rsp_d~0 50) .cse9 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse2 .cse4 .cse3 .cse15 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 .cse9 .cse10 .cse12 .cse13 .cse16 (<= ~c_req_d~0 51)) (and .cse17 .cse18 (not (= ~s_run_st~0 0)) .cse2 (= ~c_req_type~0 1) .cse15 (= ULTIMATE.start_s_run_~req_type~1 1) .cse19 .cse5 (= ~s_run_pc~0 0) .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse17 .cse18 .cse2 .cse3 .cse15 .cse19 .cse5 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 .cse16 .cse1 .cse14 .cse6 .cse9 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,873 INFO L270 CegarLoopResult]: At program point L584(lines 577 612) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) .cse1 (or (and .cse2 (= ~m_run_pc~0 0)) (and .cse2 (= ~m_run_pc~0 3))) .cse3 .cse4 .cse5 (= ~c_req_a~0 0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse7 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-11-30 00:02:12,873 INFO L274 CegarLoopResult]: For program point L1047(lines 1047 1051) no Hoare annotation was computed. [2020-11-30 00:02:12,874 INFO L270 CegarLoopResult]: At program point L915(lines 908 961) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~c_req_type~0 0))) (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ~c_req_d~0 50)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse29 (<= 1 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 1 ~a_t~0)) (.cse3 (not .cse25)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (not .cse24)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse26 (= ~s_memory0~0 50)) (.cse31 (< 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 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 .cse21 .cse22 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse26 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse27 .cse2 .cse28 .cse29 .cse4 .cse6 .cse23 .cse24 .cse12 .cse25 .cse30 .cse13 .cse26 .cse16 .cse18 .cse31 .cse19 (= ~req_tt_a~0 1) .cse32) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse2 .cse29 .cse4 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v 50) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 .cse32 .cse28 .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 .cse26 .cse31 .cse19 (<= ~c_req_d~0 51))))) [2020-11-30 00:02:12,874 INFO L274 CegarLoopResult]: For program point L321(lines 321 374) no Hoare annotation was computed. [2020-11-30 00:02:12,874 INFO L274 CegarLoopResult]: For program point L1180(lines 1180 1184) no Hoare annotation was computed. [2020-11-30 00:02:12,874 INFO L274 CegarLoopResult]: For program point L982(lines 982 996) no Hoare annotation was computed. [2020-11-30 00:02:12,875 INFO L270 CegarLoopResult]: At program point L784(lines 777 803) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 6 ~m_run_pc~0)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~s_memory0~0 50))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 .cse12 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse13 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) (= ~req_tt_a~0 1)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse11 .cse12 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50)))) [2020-11-30 00:02:12,875 INFO L274 CegarLoopResult]: For program point L586(lines 586 590) no Hoare annotation was computed. [2020-11-30 00:02:12,875 INFO L274 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-11-30 00:02:12,875 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 00:02:12,875 INFO L274 CegarLoopResult]: For program point L917(lines 917 921) no Hoare annotation was computed. [2020-11-30 00:02:12,876 INFO L270 CegarLoopResult]: At program point L521(lines 491 522) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse9 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse11 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) (= ~c_req_type~0 0) .cse5 (= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50) (= ~m_run_pc~0 6) .cse8 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 .cse11 (= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse3 .cse4 .cse2 (= ~m_run_pc~0 3) .cse8 (<= 51 ~c_req_d~0) .cse9 .cse10 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 0) .cse7 (<= ~c_req_d~0 51)))) [2020-11-30 00:02:12,876 INFO L274 CegarLoopResult]: For program point L59(lines 59 64) no Hoare annotation was computed. [2020-11-30 00:02:12,876 INFO L274 CegarLoopResult]: For program point L786(lines 786 790) no Hoare annotation was computed. [2020-11-30 00:02:12,876 INFO L274 CegarLoopResult]: For program point L1315(lines 1315 1319) no Hoare annotation was computed. [2020-11-30 00:02:12,876 INFO L274 CegarLoopResult]: For program point L1117(lines 1116 1157) no Hoare annotation was computed. [2020-11-30 00:02:12,876 INFO L274 CegarLoopResult]: For program point L61(lines 61 64) no Hoare annotation was computed. [2020-11-30 00:02:12,877 INFO L274 CegarLoopResult]: For program point L458(lines 458 462) no Hoare annotation was computed. [2020-11-30 00:02:12,877 INFO L270 CegarLoopResult]: At program point L128(lines 98 840) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse2 (= ~c_req_type~0 0)) (.cse4 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse12 (not (= ~s_run_st~0 0))) (.cse5 (not .cse13)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse12 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse12 .cse5 .cse6 .cse8 .cse9)))) [2020-11-30 00:02:12,877 INFO L270 CegarLoopResult]: At program point L1053(lines 1046 1081) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (= ~c_write_rsp_ev~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 (<= ~c_req_a~0 1) .cse9 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse5 .cse8 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse11 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,878 INFO L270 CegarLoopResult]: At program point L525-2(lines 525 553) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) (<= 51 ~c_req_d~0) .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .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)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) (= ~c_req_type~0 0) (= ~c_rsp_d~0 50) .cse7 (= ULTIMATE.start_m_run_~a~0 1) (= ULTIMATE.start_s_run_~req_a~1 0) .cse9 .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50) (= ~m_run_pc~0 6) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 .cse8 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11))) [2020-11-30 00:02:12,878 INFO L270 CegarLoopResult]: At program point L1186(lines 1179 1232) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2020-11-30 00:02:12,878 INFO L274 CegarLoopResult]: For program point L988(lines 988 995) no Hoare annotation was computed. [2020-11-30 00:02:12,879 INFO L270 CegarLoopResult]: At program point L592(lines 585 611) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) .cse1 (or (and .cse2 (= ~m_run_pc~0 0)) (and .cse2 (= ~m_run_pc~0 3))) .cse3 .cse4 .cse5 (= ~c_req_a~0 0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse7 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-11-30 00:02:12,879 INFO L274 CegarLoopResult]: For program point L526(lines 525 553) no Hoare annotation was computed. [2020-11-30 00:02:12,879 INFO L274 CegarLoopResult]: For program point L394(lines 394 400) no Hoare annotation was computed. [2020-11-30 00:02:12,880 INFO L270 CegarLoopResult]: At program point L394-1(lines 394 400) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 (<= 51 ~c_req_d~0) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)))) [2020-11-30 00:02:12,880 INFO L270 CegarLoopResult]: At program point L328(lines 321 374) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= 51 ~c_req_d~0) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,880 INFO L274 CegarLoopResult]: For program point L1253(line 1253) no Hoare annotation was computed. [2020-11-30 00:02:12,880 INFO L274 CegarLoopResult]: For program point L1121(lines 1121 1125) no Hoare annotation was computed. [2020-11-30 00:02:12,880 INFO L274 CegarLoopResult]: For program point L1121-1(lines 1116 1157) no Hoare annotation was computed. [2020-11-30 00:02:12,881 INFO L274 CegarLoopResult]: For program point L1055(lines 1055 1059) no Hoare annotation was computed. [2020-11-30 00:02:12,881 INFO L270 CegarLoopResult]: At program point L923(lines 916 960) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~c_req_type~0 0))) (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ~c_req_d~0 50)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse29 (<= 1 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 1 ~a_t~0)) (.cse3 (not .cse25)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (not .cse24)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse26 (= ~s_memory0~0 50)) (.cse31 (< 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 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 .cse21 .cse22 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse26 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse27 .cse2 .cse28 .cse29 .cse4 .cse6 .cse23 .cse24 .cse12 .cse25 .cse30 .cse13 .cse26 .cse16 .cse18 .cse31 .cse19 (= ~req_tt_a~0 1) .cse32) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse2 .cse29 .cse4 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v 50) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 .cse32 .cse28 .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 .cse26 .cse31 .cse19 (<= ~c_req_d~0 51))))) [2020-11-30 00:02:12,881 INFO L274 CegarLoopResult]: For program point L527(lines 527 531) no Hoare annotation was computed. [2020-11-30 00:02:12,882 INFO L274 CegarLoopResult]: For program point L1188(lines 1188 1192) no Hoare annotation was computed. [2020-11-30 00:02:12,882 INFO L270 CegarLoopResult]: At program point L131-2(lines 131 477) the Hoare annotation is: (let ((.cse14 (= 2 ~s_run_pc~0))) (let ((.cse2 (= ~c_req_a~0 0)) (.cse6 (= ~c_req_type~0 0)) (.cse4 (= ~s_run_pc~0 0)) (.cse8 (not .cse14)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse3 (= ~a_t~0 0)) (.cse13 (not (= ~s_run_st~0 0))) (.cse0 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~m_run_pc~0 3)) (.cse1 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse16 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse14 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse5 .cse7 .cse13 .cse8 .cse0 .cse10 .cse12 .cse1) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse13 .cse0 .cse14 .cse15 .cse1 (= ULTIMATE.start_s_memory_write_~v 50) .cse3 .cse5 .cse7 (<= ULTIMATE.start_m_run_~a~0 1) .cse16 (<= 50 ~c_req_d~0) .cse9 .cse11 (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse13 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse0 .cse14 .cse15 .cse1 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 .cse16 .cse9 .cse11 (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51))))) [2020-11-30 00:02:12,882 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-30 00:02:12,882 INFO L274 CegarLoopResult]: For program point L858(lines 858 870) no Hoare annotation was computed. [2020-11-30 00:02:12,883 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,883 INFO L270 CegarLoopResult]: At program point L792(lines 785 802) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 6 ~m_run_pc~0)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~s_memory0~0 50))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 .cse12 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse13 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) (= ~req_tt_a~0 1)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse11 .cse12 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50)))) [2020-11-30 00:02:12,883 INFO L274 CegarLoopResult]: For program point L726(lines 726 730) no Hoare annotation was computed. [2020-11-30 00:02:12,883 INFO L274 CegarLoopResult]: For program point L594(lines 594 598) no Hoare annotation was computed. [2020-11-30 00:02:12,884 INFO L274 CegarLoopResult]: For program point L330(lines 330 334) no Hoare annotation was computed. [2020-11-30 00:02:12,884 INFO L270 CegarLoopResult]: At program point L1321(lines 1314 1331) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 (<= 1 ~a_t~0) .cse9 .cse8 .cse4 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse13 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2020-11-30 00:02:12,884 INFO L274 CegarLoopResult]: For program point L132(lines 131 477) no Hoare annotation was computed. [2020-11-30 00:02:12,885 INFO L270 CegarLoopResult]: At program point L66(lines 55 67) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (<= 6 ~m_run_pc~0)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse10 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~c_req_a~0 0) (= ~a_t~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_s_memory_read_~i 0) .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse3 .cse4 .cse2 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse8 (<= ~c_req_a~0 1) .cse9 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse7 .cse10 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,885 INFO L274 CegarLoopResult]: For program point L925(lines 925 929) no Hoare annotation was computed. [2020-11-30 00:02:12,885 INFO L274 CegarLoopResult]: For program point L793(lines 482 834) no Hoare annotation was computed. [2020-11-30 00:02:12,885 INFO L274 CegarLoopResult]: For program point L1322(lines 1252 1341) no Hoare annotation was computed. [2020-11-30 00:02:12,885 INFO L274 CegarLoopResult]: For program point L133(lines 133 137) no Hoare annotation was computed. [2020-11-30 00:02:12,886 INFO L274 CegarLoopResult]: For program point L794(lines 794 798) no Hoare annotation was computed. [2020-11-30 00:02:12,886 INFO L270 CegarLoopResult]: At program point L464(lines 457 474) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,886 INFO L274 CegarLoopResult]: For program point L1323(lines 1323 1327) no Hoare annotation was computed. [2020-11-30 00:02:12,886 INFO L274 CegarLoopResult]: For program point L266(lines 266 270) no Hoare annotation was computed. [2020-11-30 00:02:12,886 INFO L274 CegarLoopResult]: For program point L861(lines 861 869) no Hoare annotation was computed. [2020-11-30 00:02:12,887 INFO L274 CegarLoopResult]: For program point L465(lines 457 474) no Hoare annotation was computed. [2020-11-30 00:02:12,887 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,887 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,887 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,887 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,887 INFO L274 CegarLoopResult]: For program point L3-4(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,888 INFO L270 CegarLoopResult]: At program point L862(lines 857 1108) the Hoare annotation is: false [2020-11-30 00:02:12,888 INFO L270 CegarLoopResult]: At program point L664(lines 634 665) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse5 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse9 (= ~s_memory0~0 50)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse6 .cse7 .cse8 (= ~c_rsp_d~0 50) .cse9 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse10 (= ULTIMATE.start_m_run_~a~0 0) .cse11 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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) .cse5 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse8 (<= ~c_req_a~0 1) .cse10 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse11 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse9 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,888 INFO L274 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2020-11-30 00:02:12,889 INFO L270 CegarLoopResult]: At program point L1127(lines 1116 1157) the Hoare annotation is: (let ((.cse10 (= ~c_req_type~0 0))) (let ((.cse33 (<= 50 ~c_req_d~0)) (.cse34 (<= ~c_req_d~0 50)) (.cse36 (= ~m_run_pc~0 0)) (.cse35 (not (= ~c_m_lock~0 1))) (.cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse17 (= ~req_tt_a~0 1)) (.cse38 (= ~s_run_pc~0 0)) (.cse26 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse4 (<= 1 ~c_req_a~0)) (.cse39 (not .cse10)) (.cse37 (= ~c_req_type~0 1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse11 (<= ~c_req_a~0 1)) (.cse1 (= ~m_run_pc~0 6)) (.cse20 (= ~req_tt_a~0 0)) (.cse21 (= ~c_req_a~0 0)) (.cse22 (= ~a_t~0 0)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse25 (= ULTIMATE.start_m_run_~a~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse19 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse40 (<= 51 ~c_req_d~0)) (.cse23 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse31 (= ~c_empty_req~0 1)) (.cse32 (= ~m_run_st~0 0)) (.cse12 (= ~s_memory0~0 50)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse41 (<= ~c_req_d~0 51)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse28 (not (= ~s_run_st~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse29 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse19 .cse1 .cse20 .cse5 .cse6 .cse7 .cse21 .cse22 .cse9 .cse10 .cse23 .cse12 .cse24 .cse14 .cse25 .cse15 .cse16) (and .cse26 .cse27 .cse28 .cse7 .cse6 .cse29 .cse30 .cse22 .cse31 .cse32 .cse12 .cse33 .cse14 .cse25 .cse15 .cse16 .cse34) (and .cse28 .cse6 .cse7 .cse35 .cse21 .cse22 .cse9 .cse10 .cse31 .cse32 .cse14 .cse15 .cse36) (and .cse7 .cse37 .cse29 .cse21 .cse22 .cse38 .cse9 .cse33 .cse14 .cse25 .cse15 .cse16 .cse34) (and .cse38 .cse9 .cse31 .cse32 .cse28 .cse7 .cse36 .cse35 .cse21) (and .cse39 .cse7 .cse6 .cse37 .cse29 .cse21 .cse22 .cse9 .cse33 .cse14 .cse25 .cse15 .cse16 .cse34) (and .cse38 .cse9 .cse10 .cse31 .cse14 .cse7 .cse15 .cse36 .cse35 .cse21 .cse22) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 1) .cse28 (= ULTIMATE.start_s_memory_read_~i 1) .cse4 .cse5 .cse7 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse31 .cse11 .cse14 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse18 .cse1 .cse3 .cse8 .cse32 (= 51 ~c_rsp_d~0) .cse12 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 .cse17) (and .cse38 .cse9 .cse28 .cse39 .cse7 .cse29 .cse21) (and .cse1 .cse9 .cse31 .cse28 .cse3 .cse14 .cse6 .cse7 .cse15 .cse18) (and .cse26 .cse27 .cse3 .cse4 .cse39 .cse6 .cse37 .cse7 .cse29 .cse30 .cse40 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse41) (and .cse9 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse28 .cse14 .cse6 .cse7 .cse15 .cse16) (and .cse9 .cse31 .cse6 .cse7 .cse29) (and .cse0 .cse1 .cse28 .cse20 .cse7 .cse6 .cse5 .cse21 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse22 .cse8 .cse10 (= ~c_rsp_d~0 50) .cse31 .cse32 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse19 .cse28 .cse3 .cse7 .cse6 .cse5 .cse29 .cse40 .cse23 .cse31 .cse32 .cse12 .cse14 .cse15 .cse16 .cse18 .cse41) (and .cse9 .cse28 .cse7 .cse6 .cse15 .cse29)))) [2020-11-30 00:02:12,890 INFO L270 CegarLoopResult]: At program point L1061(lines 1054 1080) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (= ~c_write_rsp_ev~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 (<= ~c_req_a~0 1) .cse9 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse5 .cse8 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse11 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,890 INFO L274 CegarLoopResult]: For program point L1260(lines 1260 1313) no Hoare annotation was computed. [2020-11-30 00:02:12,890 INFO L270 CegarLoopResult]: At program point L1194(lines 1187 1231) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2020-11-30 00:02:12,890 INFO L274 CegarLoopResult]: For program point L71(lines 71 76) no Hoare annotation was computed. [2020-11-30 00:02:12,890 INFO L274 CegarLoopResult]: For program point L864(lines 864 868) no Hoare annotation was computed. [2020-11-30 00:02:12,891 INFO L270 CegarLoopResult]: At program point L732(lines 725 742) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse4 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,891 INFO L270 CegarLoopResult]: At program point L600(lines 593 610) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) .cse1 (or (and .cse2 (= ~m_run_pc~0 0)) (and .cse2 (= ~m_run_pc~0 3))) .cse3 .cse4 .cse5 (= ~c_req_a~0 0) .cse6 .cse7 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (<= 1 ~c_req_a~0) (= ~req_tt_a~0 0) .cse3 .cse5 .cse4 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse6 (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse7 (= ~c_rsp_d~0 50) (<= ~c_req_a~0 1) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-11-30 00:02:12,892 INFO L270 CegarLoopResult]: At program point L336(lines 329 373) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= 51 ~c_req_d~0) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,892 INFO L274 CegarLoopResult]: For program point L1261(lines 1261 1265) no Hoare annotation was computed. [2020-11-30 00:02:12,892 INFO L270 CegarLoopResult]: At program point L204(lines 174 205) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (= ~c_req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (= ~m_run_pc~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~a_t~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse8 .cse1 .cse2 .cse12 .cse14 .cse5 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse2 .cse4 .cse6 .cse5 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse3 .cse2 (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) .cse6 .cse7 .cse8 (<= ULTIMATE.start_m_run_~a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse11 .cse13 .cse15 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,893 INFO L274 CegarLoopResult]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2020-11-30 00:02:12,893 INFO L270 CegarLoopResult]: At program point L931(lines 924 959) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~c_req_type~0 0))) (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ~c_req_d~0 50)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse29 (<= 1 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 1 ~a_t~0)) (.cse3 (not .cse25)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (not .cse24)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse26 (= ~s_memory0~0 50)) (.cse31 (< 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 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 .cse21 .cse22 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse26 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse27 .cse2 .cse28 .cse29 .cse4 .cse6 .cse23 .cse24 .cse12 .cse25 .cse30 .cse13 .cse26 .cse16 .cse18 .cse31 .cse19 (= ~req_tt_a~0 1) .cse32) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse2 .cse29 .cse4 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v 50) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 .cse32 .cse28 .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 .cse26 .cse31 .cse19 (<= ~c_req_d~0 51))))) [2020-11-30 00:02:12,894 INFO L270 CegarLoopResult]: At program point L865(lines 857 1108) the Hoare annotation is: (let ((.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~a_t~0 0)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~c_req_type~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse12 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse0 (not (= ~s_run_st~0 0))) (.cse17 (<= 1 ~a_t~0)) (.cse18 (<= 1 ~c_req_a~0)) (.cse14 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse15 (= ~c_req_type~0 0)) (.cse19 (<= ~c_req_a~0 1)) (.cse16 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse20 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) .cse8 .cse9 .cse10 .cse11 (<= ~c_req_d~0 50)) (and .cse12 .cse13 .cse0 (= ~req_tt_a~0 0) .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15 .cse16 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse18 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ~c_req_d~0) .cse7 .cse19 .cse16 .cse8 .cse10 .cse11 .cse20 (<= ~c_req_d~0 51)) (and .cse7 (= ~c_empty_req~0 1) .cse0 .cse1 .cse2 .cse4) (and .cse12 .cse13 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse0 .cse17 .cse18 .cse14 .cse1 .cse2 .cse7 .cse15 .cse19 .cse16 .cse8 .cse10 .cse11 (= ~req_tt_a~0 1) .cse20))) [2020-11-30 00:02:12,894 INFO L274 CegarLoopResult]: For program point L733(lines 725 742) no Hoare annotation was computed. [2020-11-30 00:02:12,894 INFO L274 CegarLoopResult]: For program point L601(lines 482 834) no Hoare annotation was computed. [2020-11-30 00:02:12,894 INFO L274 CegarLoopResult]: For program point L403(lines 403 456) no Hoare annotation was computed. [2020-11-30 00:02:12,894 INFO L274 CegarLoopResult]: For program point L1196(lines 1196 1200) no Hoare annotation was computed. [2020-11-30 00:02:12,895 INFO L274 CegarLoopResult]: For program point L73(lines 73 76) no Hoare annotation was computed. [2020-11-30 00:02:12,895 INFO L274 CegarLoopResult]: For program point L998-1(lines 873 1103) no Hoare annotation was computed. [2020-11-30 00:02:12,895 INFO L274 CegarLoopResult]: For program point L734(lines 734 738) no Hoare annotation was computed. [2020-11-30 00:02:12,895 INFO L274 CegarLoopResult]: For program point L602(lines 602 606) no Hoare annotation was computed. [2020-11-30 00:02:12,895 INFO L274 CegarLoopResult]: For program point L404(lines 404 408) no Hoare annotation was computed. [2020-11-30 00:02:12,895 INFO L274 CegarLoopResult]: For program point L338(lines 338 342) no Hoare annotation was computed. [2020-11-30 00:02:12,896 INFO L270 CegarLoopResult]: At program point L272(lines 265 282) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (= ~m_run_pc~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0)) (and (<= 50 ULTIMATE.start_m_run_~req_d~0) .cse2 (= ~c_req_type~0 1) .cse3 .cse4 (= ~a_t~0 0) (= ULTIMATE.start_m_run_~req_type~0 1) .cse0 .cse5 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~req_d~0 50) (<= 2 ~c_m_ev~0) .cse6 .cse7 (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) (and .cse5 .cse0 .cse1 (not (= ~c_req_type~0 0)) .cse2 .cse6 .cse7 .cse3 .cse4 (not (= ULTIMATE.start_m_run_~req_type~0 0))))) [2020-11-30 00:02:12,896 INFO L274 CegarLoopResult]: For program point L1131(lines 1131 1138) no Hoare annotation was computed. [2020-11-30 00:02:12,896 INFO L274 CegarLoopResult]: For program point L999(lines 998 1022) no Hoare annotation was computed. [2020-11-30 00:02:12,896 INFO L274 CegarLoopResult]: For program point L933(lines 933 937) no Hoare annotation was computed. [2020-11-30 00:02:12,896 INFO L274 CegarLoopResult]: For program point L273(lines 265 282) no Hoare annotation was computed. [2020-11-30 00:02:12,897 INFO L274 CegarLoopResult]: For program point L1000(lines 1000 1004) no Hoare annotation was computed. [2020-11-30 00:02:12,897 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,897 INFO L274 CegarLoopResult]: For program point L274(lines 274 278) no Hoare annotation was computed. [2020-11-30 00:02:12,897 INFO L270 CegarLoopResult]: At program point L142-2(lines 142 170) the Hoare annotation is: (let ((.cse19 (= 2 ~s_run_pc~0))) (let ((.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= ~c_req_a~0 0)) (.cse10 (= ~c_req_type~0 0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse8 (= ~s_run_pc~0 0)) (.cse14 (not .cse19)) (.cse15 (= ULTIMATE.start_m_run_~a~0 0)) (.cse17 (= ~m_run_pc~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse18 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (not (= ~c_m_lock~0 1))) (.cse4 (= ~a_t~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse16 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse19 .cse1 .cse2 .cse3 .cse5 .cse4 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse8 .cse9 .cse11 .cse18 .cse14 .cse15 .cse1 .cse17 .cse2 .cse5 .cse6) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse18 .cse1 .cse19 (= ~m_run_pc~0 3) .cse2 (= ULTIMATE.start_s_memory_write_~v 50) .cse4 .cse7 .cse9 (<= ULTIMATE.start_m_run_~a~0 1) .cse11 (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) (<= 50 ~c_req_d~0) .cse13 .cse16 (<= ULTIMATE.start_m_run_~req_a~0 1) (<= 51 ULTIMATE.start_m_run_~req_d~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0))))) [2020-11-30 00:02:12,898 INFO L274 CegarLoopResult]: For program point L671(lines 671 724) no Hoare annotation was computed. [2020-11-30 00:02:12,898 INFO L274 CegarLoopResult]: For program point L143(lines 142 170) no Hoare annotation was computed. [2020-11-30 00:02:12,898 INFO L274 CegarLoopResult]: For program point L672(lines 672 676) no Hoare annotation was computed. [2020-11-30 00:02:12,898 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 00:02:12,899 INFO L270 CegarLoopResult]: At program point L1267(lines 1260 1313) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 (<= 1 ~a_t~0) .cse9 .cse8 .cse4 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2020-11-30 00:02:12,899 INFO L274 CegarLoopResult]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-11-30 00:02:12,899 INFO L270 CegarLoopResult]: At program point L1069(lines 1062 1079) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (= ~c_write_rsp_ev~0 1)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse8 (= ~s_memory0~0 50)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) .cse8 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= ULTIMATE.start_m_run_~a~0 0) .cse10 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse6 .cse7 (<= ~c_req_a~0 1) .cse9 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse10 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse5 .cse8 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse11 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,899 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-11-30 00:02:12,900 INFO L274 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-11-30 00:02:12,900 INFO L274 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-11-30 00:02:12,900 INFO L274 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-11-30 00:02:12,900 INFO L274 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-11-30 00:02:12,900 INFO L274 CegarLoopResult]: For program point L211(lines 211 264) no Hoare annotation was computed. [2020-11-30 00:02:12,900 INFO L270 CegarLoopResult]: At program point L1202(lines 1195 1230) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2020-11-30 00:02:12,901 INFO L274 CegarLoopResult]: For program point L1070(lines 873 1103) no Hoare annotation was computed. [2020-11-30 00:02:12,901 INFO L270 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 ~s_run_pc~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_req_type~0 0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ~s_memory0~0 50)) (.cse10 (<= 2 ~c_m_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~c_req_a~0 0) (= ~a_t~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_memory_read_~i 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_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~a_t~0) (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) .cse8 .cse9 .cse10 .cse11 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse12 (= ~req_tt_a~0 1) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,901 INFO L270 CegarLoopResult]: At program point L13-4(lines 69 79) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse7 (= ~a_t~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse12 (<= 2 ~c_m_ev~0)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse16 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) (<= 1 ~a_t~0) .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_write_~v) .cse4 .cse5 (<= 51 ~c_req_d~0) .cse8 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse9 .cse10 .cse12 .cse14 .cse15 (<= 1 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~s_run_pc~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2020-11-30 00:02:12,902 INFO L270 CegarLoopResult]: At program point L410(lines 403 456) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,902 INFO L270 CegarLoopResult]: At program point L344(lines 337 372) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= 51 ~c_req_d~0) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,902 INFO L274 CegarLoopResult]: For program point L1335(lines 1335 1339) no Hoare annotation was computed. [2020-11-30 00:02:12,903 INFO L274 CegarLoopResult]: For program point L1335-1(lines 1167 1346) no Hoare annotation was computed. [2020-11-30 00:02:12,903 INFO L274 CegarLoopResult]: For program point L1269(lines 1269 1273) no Hoare annotation was computed. [2020-11-30 00:02:12,903 INFO L274 CegarLoopResult]: For program point L212(lines 212 216) no Hoare annotation was computed. [2020-11-30 00:02:12,903 INFO L274 CegarLoopResult]: For program point L1071(lines 1071 1075) no Hoare annotation was computed. [2020-11-30 00:02:12,904 INFO L270 CegarLoopResult]: At program point L939(lines 932 958) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~c_req_type~0 0))) (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ~c_req_d~0 50)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse29 (<= 1 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 1 ~a_t~0)) (.cse3 (not .cse25)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (not .cse24)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse26 (= ~s_memory0~0 50)) (.cse31 (< 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 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 .cse21 .cse22 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse26 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse27 .cse2 .cse28 .cse29 .cse4 .cse6 .cse23 .cse24 .cse12 .cse25 .cse30 .cse13 .cse26 .cse16 .cse18 .cse31 .cse19 (= ~req_tt_a~0 1) .cse32) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse2 .cse29 .cse4 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v 50) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 .cse32 .cse28 .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 .cse26 .cse31 .cse19 (<= ~c_req_d~0 51))))) [2020-11-30 00:02:12,904 INFO L270 CegarLoopResult]: At program point L873-1(lines 857 1108) the Hoare annotation is: (let ((.cse18 (not (= ~s_run_st~0 0))) (.cse5 (= ~c_req_a~0 0)) (.cse17 (= ~c_empty_rsp~0 1)) (.cse6 (= ~a_t~0 0)) (.cse20 (<= 50 ~c_req_d~0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse21 (<= ~c_req_d~0 50)) (.cse3 (= 2 ~s_run_pc~0)) (.cse7 (<= 6 ~m_run_pc~0)) (.cse9 (= ~c_req_type~0 0)) (.cse1 (= ~m_run_pc~0 6)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse0 (= ~s_memory1~0 51)) (.cse23 (<= 1 ~a_t~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse19 (= ~m_run_pc~0 3)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= ~m_run_st~0 0)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (<= 2 ~c_m_ev~0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse22 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~c_rsp_d~0 50) .cse12 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse13 .cse14 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse17 .cse9 .cse10 .cse18 .cse13 .cse2 .cse15 (= ~m_run_pc~0 0) (not (= ~c_m_lock~0 1)) .cse5 .cse6) (and .cse18 (= ~c_req_type~0 1) .cse2 .cse19 .cse5 .cse6 (= ~s_run_pc~0 0) .cse17 .cse20 .cse13 .cse14 .cse15 .cse16 .cse21) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse2 .cse19 (= ULTIMATE.start_s_memory_write_~v 50) .cse6 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse15 .cse16 .cse21) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse7 .cse9 (<= ~c_req_a~0 1) .cse10 .cse13 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse22 .cse1 .cse23 .cse8 .cse11 .cse12 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 (= ~req_tt_a~0 1)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse23 .cse2 .cse4 .cse19 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22 (<= ~c_req_d~0 51)))) [2020-11-30 00:02:12,904 INFO L274 CegarLoopResult]: For program point L1204(lines 1204 1208) no Hoare annotation was computed. [2020-11-30 00:02:12,904 INFO L274 CegarLoopResult]: For program point L808(lines 808 812) no Hoare annotation was computed. [2020-11-30 00:02:12,905 INFO L270 CegarLoopResult]: At program point L478(lines 130 479) the Hoare annotation is: (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) (not (= ~s_run_st~0 0)) (<= 1 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= 51 ULTIMATE.start_s_memory_write_~v) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (<= 51 ~c_req_d~0) (= ~c_empty_rsp~0 1) (<= ULTIMATE.start_s_run_~req_d~1 51) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 2 ~c_m_ev~0) (<= 2 ~c_write_req_ev~0) (<= 2 ULTIMATE.start_m_run_~a~0) (<= ~c_req_d~0 51)) [2020-11-30 00:02:12,905 INFO L274 CegarLoopResult]: For program point L412(lines 412 416) no Hoare annotation was computed. [2020-11-30 00:02:12,905 INFO L274 CegarLoopResult]: For program point L346(lines 346 350) no Hoare annotation was computed. [2020-11-30 00:02:12,905 INFO L274 CegarLoopResult]: For program point L941(lines 941 945) no Hoare annotation was computed. [2020-11-30 00:02:12,905 INFO L274 CegarLoopResult]: For program point L876-1(lines 873 1103) no Hoare annotation was computed. [2020-11-30 00:02:12,905 INFO L274 CegarLoopResult]: For program point L744(lines 744 750) no Hoare annotation was computed. [2020-11-30 00:02:12,906 INFO L270 CegarLoopResult]: At program point L744-1(lines 744 750) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse2 (not (= ~s_run_st~0 0))) (.cse5 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~m_run_pc~0 6)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse10 (= ~s_memory0~0 50))) (or (and .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~a_t~0 0) .cse6 .cse7 .cse8 .cse9 (= ~c_rsp_d~0 50) .cse10 (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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) .cse5 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse8 (<= ~c_req_a~0 1) .cse9 .cse11 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse12 (<= 1 ULTIMATE.start_m_run_~a~0) .cse1 (<= 1 ~a_t~0) .cse6 .cse7 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse10 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,906 INFO L270 CegarLoopResult]: At program point L678(lines 671 724) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse4 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,907 INFO L274 CegarLoopResult]: For program point L877(lines 876 900) no Hoare annotation was computed. [2020-11-30 00:02:12,907 INFO L270 CegarLoopResult]: At program point L1142(lines 1116 1157) the Hoare annotation is: (let ((.cse10 (= ~c_req_type~0 0))) (let ((.cse35 (<= 50 ~c_req_d~0)) (.cse36 (<= ~c_req_d~0 50)) (.cse2 (= ULTIMATE.start_m_run_~req_a___0~0 1)) (.cse17 (= ~req_tt_a~0 1)) (.cse30 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse4 (<= 1 ~c_req_a~0)) (.cse39 (not .cse10)) (.cse37 (= ~c_req_type~0 1)) (.cse33 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse11 (<= ~c_req_a~0 1)) (.cse1 (= ~m_run_pc~0 6)) (.cse26 (= ~req_tt_a~0 0)) (.cse24 (= ~a_t~0 0)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse13 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse28 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse29 (= ULTIMATE.start_m_run_~a~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse25 (<= 51 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= 1 ~a_t~0)) (.cse5 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse40 (<= 51 ~c_req_d~0)) (.cse27 (<= ULTIMATE.start_s_run_~req_d~1 51)) (.cse34 (= ~m_run_st~0 0)) (.cse12 (= ~s_memory0~0 50)) (.cse14 (<= 2 ~c_m_ev~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse18 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse41 (<= ~c_req_d~0 51)) (.cse38 (= ~s_run_pc~0 0)) (.cse19 (= ~c_empty_req~0 1)) (.cse21 (= ~m_run_pc~0 0)) (.cse22 (not (= ~c_m_lock~0 1))) (.cse23 (= ~c_req_a~0 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse20 (not (= ~s_run_st~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse15 (<= 2 ~c_write_req_ev~0)) (.cse32 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse9 .cse10 .cse19 .cse20 .cse14 .cse6 .cse7 .cse15 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse25 .cse1 .cse26 .cse5 .cse6 .cse7 .cse23 .cse24 .cse9 .cse10 .cse27 .cse12 .cse28 .cse14 .cse29 .cse15 .cse16) (and .cse30 .cse31 .cse20 .cse7 .cse6 .cse32 .cse33 .cse24 .cse19 .cse34 .cse12 .cse35 .cse14 .cse29 .cse15 .cse16 .cse36) (and .cse7 .cse37 .cse32 .cse23 .cse24 .cse38 .cse9 .cse35 .cse14 .cse29 .cse15 .cse16 .cse36) (and .cse39 .cse7 .cse6 .cse37 .cse32 .cse23 .cse24 .cse9 .cse35 .cse14 .cse29 .cse15 .cse16 .cse36) (and .cse38 .cse9 .cse10 .cse19 .cse14 .cse7 .cse15 .cse21 .cse22 .cse23 .cse24) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) .cse2 (<= ULTIMATE.start_s_run_~req_a~1 1) .cse20 (= ULTIMATE.start_s_memory_read_~i 1) .cse4 .cse5 .cse7 .cse6 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse19 .cse11 .cse14 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse15 .cse18 .cse1 .cse3 .cse8 .cse34 (= 51 ~c_rsp_d~0) .cse12 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse16 .cse17) (and .cse38 .cse9 .cse20 .cse39 .cse7 .cse32 .cse23) (and .cse1 .cse9 .cse19 .cse20 .cse3 .cse14 .cse6 .cse7 .cse15 .cse18) (and .cse30 .cse31 .cse3 .cse4 .cse39 .cse6 .cse37 .cse7 .cse32 .cse33 .cse40 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse41) (and .cse9 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse20 .cse14 .cse6 .cse7 .cse15 .cse16) (and .cse9 .cse19 .cse6 .cse7 .cse32) (and .cse0 .cse1 .cse20 .cse26 .cse7 .cse6 .cse5 .cse23 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse24 .cse8 .cse10 (= ~c_rsp_d~0 50) .cse19 .cse34 .cse12 .cse13 .cse28 .cse14 .cse29 .cse15 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse25 .cse20 .cse3 .cse7 .cse6 .cse5 .cse32 .cse40 .cse27 .cse19 .cse34 .cse12 .cse14 .cse15 .cse16 .cse18 .cse41) (and .cse38 .cse9 .cse19 .cse20 .cse7 .cse21 .cse22 .cse23) (and .cse9 .cse20 .cse7 .cse6 .cse15 .cse32)))) [2020-11-30 00:02:12,908 INFO L274 CegarLoopResult]: For program point L878(lines 878 882) no Hoare annotation was computed. [2020-11-30 00:02:12,908 INFO L274 CegarLoopResult]: For program point L680(lines 680 684) no Hoare annotation was computed. [2020-11-30 00:02:12,908 INFO L270 CegarLoopResult]: At program point L482-2(lines 482 834) the Hoare annotation is: (let ((.cse6 (= ~m_run_pc~0 3)) (.cse2 (<= 1 ~a_t~0)) (.cse8 (<= 2 ULTIMATE.start_m_run_~a~0)) (.cse10 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse11 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse5 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse15 (<= 6 ~m_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse0 (= ~c_empty_rsp~0 1)) (.cse13 (= ~s_memory0~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse11 .cse4 .cse5 .cse6 .cse9 (<= 51 ~c_req_d~0) .cse0 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse12 .cse13 .cse3 (= ULTIMATE.start_m_run_~a~0 0) .cse7 (<= ~c_req_d~0 51)) (and .cse14 .cse0 .cse12 .cse1 .cse2 .cse3 .cse5 .cse4 .cse7 .cse8 .cse9 .cse15) (and .cse10 .cse1 (= ~req_tt_a~0 0) .cse11 .cse5 .cse4 (= ~a_t~0 0) .cse15 (= ~c_req_type~0 0) .cse12 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 1) .cse3 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse14 .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse0 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50)))) [2020-11-30 00:02:12,908 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 00:02:12,909 INFO L270 CegarLoopResult]: At program point L1275(lines 1268 1312) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 (<= 1 ~a_t~0) .cse9 .cse8 .cse4 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2020-11-30 00:02:12,909 INFO L270 CegarLoopResult]: At program point L218(lines 211 264) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse15 (<= ~c_req_d~0 50)) (.cse17 (= 2 ~s_run_pc~0)) (.cse1 (= ~c_req_type~0 1)) (.cse4 (= ~a_t~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse16 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (= ~m_run_pc~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse5 (= 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) (and .cse0 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 (<= 1 ~c_req_a~0) .cse17 .cse1 .cse2 (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ~c_req_d~0) .cse4 .cse6 .cse8 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= 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 .cse8 .cse16 (not (= ~c_req_type~0 0)) .cse2 .cse12 .cse13 .cse3 .cse5 (not (= ULTIMATE.start_m_run_~req_type~0 0))))) [2020-11-30 00:02:12,909 INFO L274 CegarLoopResult]: For program point L483(lines 482 834) no Hoare annotation was computed. [2020-11-30 00:02:12,910 INFO L277 CegarLoopResult]: At program point L1342(lines 1164 1347) the Hoare annotation is: true [2020-11-30 00:02:12,910 INFO L270 CegarLoopResult]: At program point L285-2(lines 285 313) the Hoare annotation is: (let ((.cse15 (= 2 ~s_run_pc~0))) (let ((.cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse18 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse24 (= ~m_run_pc~0 3)) (.cse19 (<= 51 ~c_req_d~0)) (.cse23 (= ~c_empty_req~0 1)) (.cse20 (= ~s_memory0~0 50)) (.cse22 (<= ~c_req_d~0 51)) (.cse21 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse5 (= ~s_run_pc~0 0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse9 (not .cse15)) (.cse0 (not (= ~c_req_type~0 0))) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (<= 50 ~c_req_d~0)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_req_type~0 1)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse3 (= ~c_req_a~0 0)) (.cse13 (<= ~c_req_d~0 50)) (.cse4 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse14 .cse2 .cse15 .cse11) (and .cse16 (<= 0 ~a_t~0) .cse17 (<= 1 ~c_req_a~0) .cse2 .cse15 .cse1 .cse18 .cse19 .cse6 (<= ~c_req_a~0 1) .cse20 .cse8 .cse11 .cse12 .cse21 .cse22) (and .cse6 .cse23 .cse2 .cse15 .cse24) (and .cse16 .cse17 .cse14 .cse2 .cse15 .cse24 .cse18 .cse4 .cse23 .cse20 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse14 (<= 1 ~a_t~0) .cse2 .cse15 (= 51 ULTIMATE.start_s_memory_write_~v) .cse24 .cse19 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse23 .cse20 .cse8 .cse11 .cse12 .cse22 .cse21) (and .cse5 .cse6 .cse14 .cse9 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse2 .cse15 .cse1 .cse10 .cse11 .cse12 .cse3 .cse13 .cse4)))) [2020-11-30 00:02:12,910 INFO L270 CegarLoopResult]: At program point L1210(lines 1203 1229) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2020-11-30 00:02:12,911 INFO L270 CegarLoopResult]: At program point L814(lines 807 824) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 6 ~m_run_pc~0)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~s_memory0~0 50))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 .cse12 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse13 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) (= ~req_tt_a~0 1)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse11 .cse12 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50)))) [2020-11-30 00:02:12,911 INFO L274 CegarLoopResult]: For program point L616(lines 616 620) no Hoare annotation was computed. [2020-11-30 00:02:12,911 INFO L274 CegarLoopResult]: For program point L484(lines 484 488) no Hoare annotation was computed. [2020-11-30 00:02:12,912 INFO L270 CegarLoopResult]: At program point L418(lines 411 455) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,912 INFO L270 CegarLoopResult]: At program point L352(lines 345 371) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= 51 ~c_req_d~0) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,912 INFO L274 CegarLoopResult]: For program point L286(lines 285 313) no Hoare annotation was computed. [2020-11-30 00:02:12,912 INFO L274 CegarLoopResult]: For program point L1277(lines 1277 1281) no Hoare annotation was computed. [2020-11-30 00:02:12,912 INFO L274 CegarLoopResult]: For program point L220(lines 220 224) no Hoare annotation was computed. [2020-11-30 00:02:12,913 INFO L270 CegarLoopResult]: At program point L947(lines 940 957) the Hoare annotation is: (let ((.cse24 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse25 (= ~c_req_type~0 0))) (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~a_t~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse15 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse20 (<= ~c_req_d~0 50)) (.cse21 (= ~s_memory1~0 51)) (.cse22 (= ~m_run_pc~0 6)) (.cse23 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse27 (<= ULTIMATE.start_s_run_~req_a~1 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse29 (<= 1 ~c_req_a~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse30 (<= ~c_req_a~0 1)) (.cse13 (= ~c_empty_req~0 1)) (.cse16 (<= 2 ~c_m_ev~0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse32 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse28 (<= 1 ~a_t~0)) (.cse3 (not .cse25)) (.cse5 (= ~c_req_type~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (not .cse24)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse26 (= ~s_memory0~0 50)) (.cse31 (< 0 ULTIMATE.start_s_run_~req_a~1)) (.cse19 (<= 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 .cse21 .cse22 .cse2 (= ~req_tt_a~0 0) .cse4 .cse6 .cse23 .cse10 .cse11 .cse24 .cse12 .cse25 .cse13 .cse26 .cse14 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse8 .cse7 .cse10 .cse11 (= ~s_run_pc~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse22 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse27 .cse2 .cse28 .cse29 .cse4 .cse6 .cse23 .cse24 .cse12 .cse25 .cse30 .cse13 .cse26 .cse16 .cse18 .cse31 .cse19 (= ~req_tt_a~0 1) .cse32) (and (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse27 .cse2 .cse29 .cse4 .cse6 .cse7 (= ULTIMATE.start_s_memory_write_~v 50) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse30 .cse13 .cse16 .cse18 .cse32 .cse28 .cse3 .cse5 .cse8 .cse9 (<= 51 ~c_req_d~0) .cse12 .cse26 .cse31 .cse19 (<= ~c_req_d~0 51))))) [2020-11-30 00:02:12,913 INFO L274 CegarLoopResult]: For program point L815(lines 807 824) no Hoare annotation was computed. [2020-11-30 00:02:12,913 INFO L274 CegarLoopResult]: For program point L287(lines 287 291) no Hoare annotation was computed. [2020-11-30 00:02:12,914 INFO L274 CegarLoopResult]: For program point L1212(lines 1212 1216) no Hoare annotation was computed. [2020-11-30 00:02:12,914 INFO L274 CegarLoopResult]: For program point L1146(lines 1146 1153) no Hoare annotation was computed. [2020-11-30 00:02:12,914 INFO L274 CegarLoopResult]: For program point L948(lines 873 1103) no Hoare annotation was computed. [2020-11-30 00:02:12,914 INFO L274 CegarLoopResult]: For program point L816(lines 816 820) no Hoare annotation was computed. [2020-11-30 00:02:12,914 INFO L274 CegarLoopResult]: For program point L420(lines 420 424) no Hoare annotation was computed. [2020-11-30 00:02:12,921 INFO L274 CegarLoopResult]: For program point L354(lines 354 358) no Hoare annotation was computed. [2020-11-30 00:02:12,921 INFO L274 CegarLoopResult]: For program point L949(lines 949 953) no Hoare annotation was computed. [2020-11-30 00:02:12,922 INFO L270 CegarLoopResult]: At program point L686(lines 679 723) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse4 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,923 INFO L270 CegarLoopResult]: At program point L554(lines 524 555) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_m_ev~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) (<= 51 ~c_req_d~0) .cse5 .cse6 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse7 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse8 (= ULTIMATE.start_m_run_~a~0 0) .cse9 .cse10 (<= ~c_req_d~0 51)) (and .cse0 (= ~m_run_pc~0 6) (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (= ~req_tt_a~0 0) .cse4 .cse3 .cse2 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= ~a_t~0 0) .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 (= ~c_req_type~0 0) (= ~c_rsp_d~0 50) .cse7 (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse8 .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-11-30 00:02:12,923 INFO L274 CegarLoopResult]: For program point L753(lines 753 806) no Hoare annotation was computed. [2020-11-30 00:02:12,923 INFO L274 CegarLoopResult]: For program point L754(lines 754 758) no Hoare annotation was computed. [2020-11-30 00:02:12,923 INFO L274 CegarLoopResult]: For program point L688(lines 688 692) no Hoare annotation was computed. [2020-11-30 00:02:12,923 INFO L270 CegarLoopResult]: At program point L622(lines 615 632) the Hoare annotation is: (and (= ~c_empty_rsp~0 1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 2 ~c_m_ev~0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (<= 1 ~c_m_lock~0)) [2020-11-30 00:02:12,924 INFO L270 CegarLoopResult]: At program point L1283(lines 1276 1311) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 (<= 1 ~a_t~0) .cse9 .cse8 .cse4 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2020-11-30 00:02:12,924 INFO L270 CegarLoopResult]: At program point L226(lines 219 263) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse15 (<= ~c_req_d~0 50)) (.cse17 (= 2 ~s_run_pc~0)) (.cse1 (= ~c_req_type~0 1)) (.cse4 (= ~a_t~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= 2 ~c_m_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse7 (= ~s_run_pc~0 0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse16 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (= ~m_run_pc~0 0)) (.cse3 (= ~c_req_a~0 0)) (.cse5 (= 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) (and .cse0 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= 1 ULTIMATE.start_m_run_~req_a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse16 (<= 1 ~c_req_a~0) .cse17 .cse1 .cse2 (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (<= 51 ~c_req_d~0) .cse4 .cse6 .cse8 (<= ~c_req_a~0 1) (<= ULTIMATE.start_m_run_~a~0 1) (= ~s_memory0~0 50) (<= ULTIMATE.start_m_run_~req_d~0 51) .cse11 .cse14 (<= 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 .cse8 .cse16 (not (= ~c_req_type~0 0)) .cse2 .cse12 .cse13 .cse3 .cse5 (not (= ULTIMATE.start_m_run_~req_type~0 0))))) [2020-11-30 00:02:12,924 INFO L274 CegarLoopResult]: For program point L1085(lines 1085 1089) no Hoare annotation was computed. [2020-11-30 00:02:12,924 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-30 00:02:12,925 INFO L274 CegarLoopResult]: For program point L623(lines 615 632) no Hoare annotation was computed. [2020-11-30 00:02:12,925 INFO L270 CegarLoopResult]: At program point L1218(lines 1211 1228) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and (= ~s_run_pc~0 0) .cse0 (= ~c_req_type~0 0) .cse1 (<= 2 ~c_m_ev~0) .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5 (= ~a_t~0 0)) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5))) [2020-11-30 00:02:12,925 INFO L274 CegarLoopResult]: For program point L624(lines 624 628) no Hoare annotation was computed. [2020-11-30 00:02:12,925 INFO L270 CegarLoopResult]: At program point L426(lines 419 454) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (= ~s_memory0~0 50)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) (= 51 ULTIMATE.start_s_memory_write_~v) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse7 .cse8 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,926 INFO L270 CegarLoopResult]: At program point L492-2(lines 492 520) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse9 (= ULTIMATE.start_m_run_~req_type___0~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse11 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_m_ev~0)) (.cse7 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 (= ULTIMATE.start_m_run_~req_a___0~0 1) .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) (= ~c_req_type~0 0) .cse5 (= ~c_rsp_d~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= ULTIMATE.start_m_run_~a~0 1) .cse6 .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50) (= ~m_run_pc~0 6) .cse8 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 .cse11 (= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 (<= 1 ~a_t~0) .cse3 .cse2 .cse4 (= ~m_run_pc~0 3) .cse8 (<= 51 ~c_req_d~0) .cse9 .cse10 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= ULTIMATE.start_m_run_~a~0 0) .cse7 (<= ~c_req_d~0 51)))) [2020-11-30 00:02:12,926 INFO L270 CegarLoopResult]: At program point L360(lines 353 370) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_s_memory_write_~v 50) (= ~a_t~0 0) .cse4 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse9 (<= ~c_req_d~0 50)) (and (= ~s_memory1~0 51) (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 1 ~a_t~0) .cse1 .cse2 (= 51 ULTIMATE.start_s_memory_write_~v) .cse3 (<= 51 ~c_req_d~0) .cse4 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_req_d~0 51) (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-11-30 00:02:12,926 INFO L274 CegarLoopResult]: For program point L1285(lines 1285 1289) no Hoare annotation was computed. [2020-11-30 00:02:12,927 INFO L274 CegarLoopResult]: For program point L228(lines 228 232) no Hoare annotation was computed. [2020-11-30 00:02:12,927 INFO L274 CegarLoopResult]: For program point L1219(lines 1167 1346) no Hoare annotation was computed. [2020-11-30 00:02:12,927 INFO L274 CegarLoopResult]: For program point L493(lines 492 520) no Hoare annotation was computed. [2020-11-30 00:02:12,927 INFO L274 CegarLoopResult]: For program point L361(lines 131 477) no Hoare annotation was computed. [2020-11-30 00:02:12,927 INFO L274 CegarLoopResult]: For program point L1220(lines 1220 1224) no Hoare annotation was computed. [2020-11-30 00:02:12,927 INFO L274 CegarLoopResult]: For program point L494(lines 494 498) no Hoare annotation was computed. [2020-11-30 00:02:12,928 INFO L274 CegarLoopResult]: For program point L428(lines 428 432) no Hoare annotation was computed. [2020-11-30 00:02:12,928 INFO L274 CegarLoopResult]: For program point L362(lines 362 366) no Hoare annotation was computed. [2020-11-30 00:02:12,928 INFO L270 CegarLoopResult]: At program point L1023(lines 997 1024) the Hoare annotation is: (let ((.cse16 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse19 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse21 (<= 50 ~c_req_d~0)) (.cse23 (<= ~c_req_d~0 50)) (.cse10 (= ~m_run_pc~0 6)) (.cse20 (= ~a_t~0 0)) (.cse4 (<= 6 ~m_run_pc~0)) (.cse12 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse5 (= ~c_req_type~0 0)) (.cse22 (= ULTIMATE.start_m_run_~a~0 0)) (.cse0 (= ~s_memory1~0 51)) (.cse11 (<= 1 ~a_t~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse18 (= ~m_run_pc~0 3)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_empty_req~0 1)) (.cse14 (= ~s_memory0~0 50)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse9 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse1 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse4 .cse5 (<= ~c_req_a~0 1) .cse6 .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< 0 ULTIMATE.start_s_run_~req_a~1) .cse15 (= ~req_tt_a~0 1)) (and .cse16 .cse17 (not (= ~s_run_st~0 0)) .cse1 (= ~c_req_type~0 1) .cse18 (= ULTIMATE.start_s_run_~req_type~1 1) .cse19 .cse20 (= ~s_run_pc~0 0) .cse6 .cse14 .cse21 .cse7 .cse22 .cse8 .cse15 .cse23) (and .cse16 .cse17 .cse2 .cse1 .cse18 .cse19 .cse20 .cse13 .cse6 .cse14 .cse21 .cse7 .cse22 .cse8 .cse15 .cse23) (and .cse0 .cse10 (= ~req_tt_a~0 0) .cse1 .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse20 .cse4 .cse12 .cse13 .cse5 .cse6 .cse14 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse22 .cse8 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse11 .cse2 .cse1 .cse3 .cse18 (<= 51 ~c_req_d~0) .cse13 (<= ULTIMATE.start_s_run_~req_d~1 51) .cse6 .cse14 .cse7 .cse8 .cse15 .cse9 (<= ~c_req_d~0 51)))) [2020-11-30 00:02:12,928 INFO L274 CegarLoopResult]: For program point L561(lines 561 614) no Hoare annotation was computed. [2020-11-30 00:02:12,929 INFO L274 CegarLoopResult]: For program point L99(lines 99 127) no Hoare annotation was computed. [2020-11-30 00:02:12,929 INFO L274 CegarLoopResult]: For program point L826(lines 826 832) no Hoare annotation was computed. [2020-11-30 00:02:12,929 INFO L270 CegarLoopResult]: At program point L826-1(lines 826 832) the Hoare annotation is: (let ((.cse2 (= ~c_empty_req~0 1)) (.cse0 (= ~m_run_pc~0 6)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (<= 1 ~a_t~0)) (.cse5 (<= 2 ~c_m_ev~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (<= 1 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~s_memory1~0 51) .cse3 (= ~req_tt_a~0 0) .cse6 .cse7 (= 51 ULTIMATE.start_s_memory_write_~v) (= ~a_t~0 0) (= ~c_req_type~0 0) .cse2 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse5 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse0 .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse1 (= ~s_memory0~0 50) (= |ULTIMATE.start_s_memory_read_#res| 50)) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse6 (= ~m_run_pc~0 3) .cse8 .cse9 .cse10))) [2020-11-30 00:02:12,930 INFO L270 CegarLoopResult]: At program point L760(lines 753 806) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 6 ~m_run_pc~0)) (.cse6 (= ~c_req_type~0 0)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse13 (= ~s_memory0~0 50))) (or (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse2 .cse3 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 .cse7 (<= ~c_req_a~0 1) (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 .cse12 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse13 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) (= ~req_tt_a~0 1)) (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 .cse7 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) .cse11 .cse12 .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50)))) [2020-11-30 00:02:12,930 INFO L270 CegarLoopResult]: At program point L694(lines 687 722) the Hoare annotation is: (let ((.cse0 (= ~s_memory1~0 51)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse5 (= ~c_req_type~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_m_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~m_run_pc~0 6)) (.cse10 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse12 (= ~s_memory0~0 50)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 .cse4 (= ~a_t~0 0) .cse5 .cse6 (= ~c_rsp_d~0 50) (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= ULTIMATE.start_m_run_~a~0 0) .cse8 (= ULTIMATE.start_s_memory_read_~x~0 50) .cse9 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse10 .cse11 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= 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 (<= 1 ~c_req_a~0) .cse4 .cse2 .cse3 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse5 .cse6 (<= ~c_req_a~0 1) .cse7 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse8 (<= 1 ULTIMATE.start_m_run_~a~0) .cse9 (<= 1 ~a_t~0) .cse10 .cse11 (= 51 ULTIMATE.start_m_run_~rsp_d___0~0) .cse12 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse13 (= ~req_tt_a~0 1)))) [2020-11-30 00:02:12,930 INFO L274 CegarLoopResult]: For program point L562(lines 562 566) no Hoare annotation was computed. [2020-11-30 00:02:12,931 INFO L270 CegarLoopResult]: At program point L1091(lines 1084 1101) the Hoare annotation is: (let ((.cse10 (= 2 ~s_run_pc~0)) (.cse12 (= ~c_empty_req~0 1)) (.cse15 (= ~m_run_st~0 0))) (let ((.cse9 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 1 ~a_t~0)) (.cse1 (let ((.cse18 (= ~m_run_pc~0 3))) (or (and .cse12 .cse15 .cse10 .cse18) (and (= ~s_run_pc~0 0) .cse12 .cse15 (not (= ~s_run_st~0 0)) .cse18)))) (.cse0 (= ~s_memory1~0 51)) (.cse13 (= ~m_run_pc~0 6)) (.cse3 (= ~c_write_rsp_ev~0 1)) (.cse4 (= 51 ULTIMATE.start_s_memory_write_~v)) (.cse16 (= ~a_t~0 0)) (.cse14 (= ULTIMATE.start_s_run_~req_type~1 0)) (.cse11 (= ~c_req_type~0 0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_m_ev~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 51 ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 .cse3 .cse4 (<= 51 ~c_req_d~0) (<= ULTIMATE.start_s_run_~req_d~1 51) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_req_d~0 51)) (and .cse0 (= 51 ULTIMATE.start_s_run_~rsp_d~1) (= ULTIMATE.start_m_run_~req_a___0~0 1) (<= ULTIMATE.start_s_run_~req_a~1 1) (= ULTIMATE.start_s_memory_read_~i 1) (<= 1 ~c_req_a~0) .cse3 .cse10 .cse4 (= 51 ULTIMATE.start_s_memory_read_~x~0) .cse11 (<= ~c_req_a~0 1) .cse12 .cse6 (= 51 |ULTIMATE.start_s_memory_read_#res|) .cse7 .cse9 .cse13 .cse2 .cse14 .cse15 .cse5 (= 51 ~c_rsp_d~0) (< 0 ULTIMATE.start_s_run_~req_a~1) .cse8 (= ~req_tt_a~0 1)) (and .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 (= ULTIMATE.start_s_memory_write_~v 50) .cse16 .cse5 (<= 50 ~c_req_d~0) .cse6 .cse17 .cse7 .cse8 (<= ~c_req_d~0 50)) (and .cse0 .cse13 (= ~req_tt_a~0 0) .cse3 .cse4 .cse10 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse16 .cse14 .cse11 .cse12 (= ~c_rsp_d~0 50) .cse15 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 .cse17 .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) .cse8)))) [2020-11-30 00:02:12,931 INFO L270 CegarLoopResult]: At program point L1158(lines 1110 1163) the Hoare annotation is: (let ((.cse3 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse9 (<= 2 ~c_m_ev~0)) (.cse8 (= 2 ~s_run_pc~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse6 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse2 .cse9 .cse8 .cse4 .cse10 .cse11 .cse12 .cse6 (= ~a_t~0 0)) (and .cse13 .cse1 .cse7 .cse2 (<= 1 ~a_t~0) .cse9 .cse8 .cse4 .cse10 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse13 (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) .cse2 .cse9 .cse8 .cse4 .cse10 (<= 1 ~c_m_lock~0)) (and .cse1 .cse2 .cse4 .cse8 .cse10 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse11 .cse12 .cse6))) [2020-11-30 00:02:12,931 INFO L274 CegarLoopResult]: For program point L1092(lines 1084 1101) no Hoare annotation was computed. [2020-11-30 00:02:13,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:02:13 BoogieIcfgContainer [2020-11-30 00:02:13,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:02:13,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:02:13,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:02:13,136 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:02:13,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:00:18" (3/4) ... [2020-11-30 00:02:13,140 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 00:02:13,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-11-30 00:02:13,186 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-11-30 00:02:13,188 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:02:13,190 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 00:02:13,227 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 1 <= a_t) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && m_run_pc == 6) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((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_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2020-11-30 00:02:13,227 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 1 <= a_t) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && m_run_pc == 6) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((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_m_lock == 1)) && c_req_a == 0)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2020-11-30 00:02:13,230 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((!(s_run_st == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((50 <= req_d && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) [2020-11-30 00:02:13,232 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((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) && v == 50) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((50 <= req_d && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) [2020-11-30 00:02:13,232 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51)) || (((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1)) && 6 <= m_run_pc)) || (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2020-11-30 00:02:13,240 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && 51 == v) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) [2020-11-30 00:02:13,241 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || (((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51) [2020-11-30 00:02:13,241 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || (((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51) [2020-11-30 00:02:13,241 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 == v) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((50 <= req_d && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,242 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 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 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && a == 1) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) [2020-11-30 00:02:13,242 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 == v) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((50 <= req_d && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,245 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && c_req_a == 0) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) [2020-11-30 00:02:13,245 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((s_memory1 == 51 && 51 <= req_d) && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 == v) && 51 <= c_req_d) && req_d <= 51) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3)) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && v == 50) && a_t == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 51 == v) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && m_run_st == 0) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock) [2020-11-30 00:02:13,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 0 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 0 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) [2020-11-30 00:02:13,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,247 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) [2020-11-30 00:02:13,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && i == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) [2020-11-30 00:02:13,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) [2020-11-30 00:02:13,248 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) [2020-11-30 00:02:13,249 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) [2020-11-30 00:02:13,249 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,249 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,250 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,250 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,250 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,250 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) [2020-11-30 00:02:13,251 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) [2020-11-30 00:02:13,251 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2020-11-30 00:02:13,252 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2020-11-30 00:02:13,252 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2020-11-30 00:02:13,252 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2020-11-30 00:02:13,252 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2020-11-30 00:02:13,252 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) [2020-11-30 00:02:13,253 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 1 <= a) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || (((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 1 <= a) [2020-11-30 00:02:13,429 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1d34d329-6102-4b49-824d-8fbd484375ed/bin/uautomizer/witness.graphml [2020-11-30 00:02:13,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:02:13,431 INFO L168 Benchmark]: Toolchain (without parser) took 117442.69 ms. Allocated memory was 98.6 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 67.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 78.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:02:13,432 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 98.6 MB. Free memory was 58.1 MB in the beginning and 58.1 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:02:13,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.04 ms. Allocated memory is still 98.6 MB. Free memory was 67.3 MB in the beginning and 66.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:02:13,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.11 ms. Allocated memory is still 98.6 MB. Free memory was 66.1 MB in the beginning and 62.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:02:13,434 INFO L168 Benchmark]: Boogie Preprocessor took 97.40 ms. Allocated memory is still 98.6 MB. Free memory was 62.9 MB in the beginning and 59.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:02:13,435 INFO L168 Benchmark]: RCFGBuilder took 1957.02 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 59.4 MB in the beginning and 87.9 MB in the end (delta: -28.5 MB). Peak memory consumption was 38.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:02:13,435 INFO L168 Benchmark]: TraceAbstraction took 114341.07 ms. Allocated memory was 123.7 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 87.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. [2020-11-30 00:02:13,436 INFO L168 Benchmark]: Witness Printer took 294.19 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:02:13,439 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.74 ms. Allocated memory is still 98.6 MB. Free memory was 58.1 MB in the beginning and 58.1 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 631.04 ms. Allocated memory is still 98.6 MB. Free memory was 67.3 MB in the beginning and 66.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 110.11 ms. Allocated memory is still 98.6 MB. Free memory was 66.1 MB in the beginning and 62.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.40 ms. Allocated memory is still 98.6 MB. Free memory was 62.9 MB in the beginning and 59.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1957.02 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 59.4 MB in the beginning and 87.9 MB in the end (delta: -28.5 MB). Peak memory consumption was 38.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 114341.07 ms. Allocated memory was 123.7 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 87.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 16.1 GB. * Witness Printer took 294.19 ms. Allocated memory is still 1.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 26.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(c_req_type == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || ((((((((((((((((50 <= req_d && 0 <= a_t) && req_d <= 50) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && c_req_a == 0)) || (((((((((((c_empty_rsp == 1 && 50 <= c_req_d) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50) && a_t == 0) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 == v) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((50 <= req_d && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 997]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((((((((((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) && v == 50) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((50 <= req_d && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) - InvariantResult [Line: 1164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1046]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((2 == c_write_rsp_ev && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && !(2 == s_run_pc)) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) || ((((((((((((!(s_run_st == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && !(c_m_lock == 1))) || (((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && a <= 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_d <= 50) && 1 <= a)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && c_req_d <= 51) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && req_a == 0) && !(req_type == 0)) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && 2 <= c_m_ev) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) || ((((((((((((((((50 <= req_d && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= req_d && req_d <= 50) && 1 <= a_t) && !(c_req_type == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && !(2 == s_run_pc)) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51)) || ((((((((((((!(c_req_type == 0) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((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) && req_a == 0) && !(req_type == 0)) || ((((((((((((((((50 <= req_d && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || (((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || ((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 1203]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1233]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1211]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 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) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((((((((51 <= req_d && req_a <= 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && v == 50) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && 1 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 1 <= a_t) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && m_run_pc == 6) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((!(s_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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_m_ev) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((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_m_lock == 1)) && c_req_a == 0)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 1084]: Loop Invariant Derived loop invariant: (((((((((((((((s_memory1 == 51 && 51 <= req_d) && ((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3))) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 == v) && 51 <= c_req_d) && req_d <= 51) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) || (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((((((((((c_empty_req == 1 && m_run_st == 0) && 2 == s_run_pc) && m_run_pc == 3) || ((((s_run_pc == 0 && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && m_run_pc == 3)) && 50 <= req_d) && req_d <= 50) && c_write_rsp_ev == 1) && v == 50) && a_t == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 51 == v) && 2 == s_run_pc) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && m_run_st == 0) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock) - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 1062]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || (((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((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_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) - InvariantResult [Line: 671]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 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) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((((((((51 <= req_d && req_a <= 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && v == 50) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && 1 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s_run_st == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((!(s_run_st == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((!(s_run_st == 0) && 1 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((50 <= req_d && !(s_run_st == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_a <= 1) && a <= 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 924]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 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) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((((((((51 <= req_d && req_a <= 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && v == 50) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && 1 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 634]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s_run_st == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((!(s_run_st == 0) && 1 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && 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) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 569]: Loop Invariant Derived loop invariant: (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 524]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && c_req_a == 0) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 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) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= a) || (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((!(s_run_st == 0) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((50 <= req_d && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 1268]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((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_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 826]: Loop Invariant Derived loop invariant: (((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 1 <= a) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50)) || (((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 1 <= a) - InvariantResult [Line: 1276]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((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_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 932]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 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) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((((((((51 <= req_d && req_a <= 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && v == 50) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && 1 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 482]: Loop Invariant Derived loop invariant: (((((((((((c_empty_rsp == 1 && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51)) || (((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= a) && !(c_m_lock == 1)) && 6 <= m_run_pc)) || (((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 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) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((((((((51 <= req_d && req_a <= 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && v == 50) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && 1 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 695]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 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) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((((((((((((((((((51 <= req_d && req_a <= 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && v == 50) && req_d <= 51) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= a) && 1 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && m_run_pc == 3) && !(req_type == 0)) && 51 <= c_req_d) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && c_req_d <= 51) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) || (((((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0) && req_a == 0) && !(req_type == 0)) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && 2 <= c_m_ev) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && a <= 1) && c_empty_req == 1) && s_memory0 == 50) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 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))) || ((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || (((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && a <= 1) && s_memory0 == 50) && req_d <= 51) && 50 <= c_req_d) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 50) && 1 <= a) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((50 <= req_d && !(s_run_st == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 1 <= c_req_a) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_a <= 1) && a <= 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 1 <= c_m_lock - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && !(s_run_st == 0)) && 1 <= c_req_a) && req_tt_a == 0) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && rsp_d == 50) && a_t == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_rsp_d == 50) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && v == 50) && 51 <= c_req_d) && a_t == 0) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && a <= 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || ((((((((((((((((50 <= req_d && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1284]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((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_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 761]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 1314]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((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_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && v == 50) && 51 <= c_req_d) && a_t == 0) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && a <= 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || ((((((((((((((((50 <= req_d && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1292]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((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_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 725]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && i == 0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && req_a <= 1) && i == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) || (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((((((((((1 <= req_a && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && v == 50) && 51 <= c_req_d) && a_t == 0) && !(req_type == 0)) && req_type == 1) && c_req_a <= 1) && a <= 1) && s_memory0 == 50) && req_d <= 51) && 2 <= c_m_ev) && 1 <= c_m_lock) && req_a <= 1) && 51 <= req_d) && c_req_d <= 51) && 1 <= a)) || ((((((((((((((((50 <= req_d && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && a_t == 0) && !(req_type == 0)) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) || (((((((((((((((50 <= req_d && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && a_t == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && 2 <= c_m_ev) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 1179]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 1 <= a_t) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && m_run_pc == 6) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 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) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((2 == c_write_rsp_ev && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((!(c_req_type == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || ((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && !(s_run_st == 0)) && i == 1) && 1 <= c_req_a) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && m_run_st == 0) && 51 == c_rsp_d) && s_memory0 == 50) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && 1 <= a_t) && 1 <= c_req_a) && !(c_req_type == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && 51 <= c_req_d) && c_empty_rsp == 1) && c_req_a <= 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((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_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 1) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || ((((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && v == 50) && a_t == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || (((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && 6 <= m_run_pc) && req_type == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && 51 == v) && 2 == c_write_rsp_ev) && c_req_a == 0) && a_t == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1)) || ((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 777]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 0 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 51) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 0 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a)) || ((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_a___0 == 1) && 0 <= a_t) && 1 <= c_req_a) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && s_memory0 == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) - InvariantResult [Line: 807]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1030]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && c_write_rsp_ev == 1) && 2 == s_run_pc) && 51 == v) && c_req_a == 0) && rsp_d == 50) && a_t == 0) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((s_memory1 == 51 && 51 <= req_d) && 1 <= a_t) && c_write_rsp_ev == 1) && 51 == v) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && 1 <= a) && c_req_d <= 51)) || (((((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && c_write_rsp_ev == 1) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && a_t == 0) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((50 <= req_d && req_d <= 50) && c_write_rsp_ev == 1) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && a_t == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && c_write_rsp_ev == 1) && 1 <= c_req_a) && 2 == s_run_pc) && 51 == v) && 51 == x) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 2 <= c_m_ev) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && req_type == 0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((s_memory1 == 51 && 51 == rsp_d) && req_a___0 == 1) && req_a <= 1) && i == 1) && !(s_run_st == 0)) && 1 <= c_req_a) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == x) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_req_a <= 1) && 51 == \result) && 2 <= c_write_req_ev) && 1 <= a) && m_run_pc == 6) && 1 <= a_t) && !(c_m_lock == 1)) && req_type == 0) && c_empty_rsp == 1) && 51 == rsp_d___0) && s_memory0 == 50) && 51 == c_rsp_d) && 0 < req_a) && req_tt_a == 1) || ((((((((((((((((((((((((s_memory1 == 51 && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && a_t == 0) && 6 <= m_run_pc) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && rsp_d___0 == 50) && req_a == 0) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && rsp_d == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: (((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 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 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a_t == 0) && c_req_type == 0) && c_rsp_d == 50) && c_empty_req == 1) && a == 1) && req_a == 0) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && rsp_d == 50) && c_req_a == 0) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) && 1 <= c_m_lock) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((s_memory1 == 51 && req_a___0 == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && a_t == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && req_a == 0) && a == 1) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && x == 50) && m_run_pc == 6) && !(c_m_lock == 1)) && c_req_a == 0) && rsp_d == 50) && req_type___0 == 0) && req_type == 0) && c_empty_rsp == 1) && s_memory0 == 50) && \result == 50) || (((((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && req_type___0 == 0) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_m_ev) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 51) - InvariantResult [Line: 1187]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((s_memory1 == 51 && m_run_pc == 6) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && c_req_a == 0) && a_t == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && i == 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) && req_a <= 1) && i == 1) && 1 <= a_t) && 1 <= c_req_a) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 51 == v) && 51 == x) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_req_a <= 1) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 0 < req_a) && 1 <= c_m_lock) && req_tt_a == 1) && 1 <= a) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 51 == v) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_m_ev) && 2 <= c_write_req_ev) && 2 <= a) && c_req_d <= 51 - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((50 <= req_d && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && !(c_m_lock == 1)) && a_t == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) || ((((((((((((((((s_memory1 == 51 && 51 <= req_d) && !(s_run_st == 0)) && 1 <= a_t) && 51 == v) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && 51 <= c_req_d) && c_empty_rsp == 1) && req_d <= 51) && c_empty_req == 1) && s_memory0 == 50) && 2 <= c_write_req_ev) && c_req_d <= 51) && 1 <= a) - InvariantResult [Line: 1195]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && 2 <= c_m_ev) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) && a_t == 0) || (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1110]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((((c_empty_rsp == 1 && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) && a_t == 0)) || (((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 1 <= a_t) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= a)) || (((((((((c_empty_rsp == 1 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 2 <= c_m_ev) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((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_m_lock == 1)) && c_req_a == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 277 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 40.1s, OverallIterations: 28, TraceHistogramMax: 8, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 73.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15848 SDtfs, 24882 SDslu, 41478 SDs, 0 SdLazy, 4863 SolverSat, 655 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2485 GetRequests, 2203 SyntacticMatches, 10 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7477occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 53740 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 582 NumberOfFragments, 17304 HoareAnnotationTreeSize, 98 FomulaSimplifications, 262542118 FormulaSimplificationTreeSizeReduction, 15.8s HoareSimplificationTime, 98 FomulaSimplificationsInter, 18246819 FormulaSimplificationTreeSizeReductionInter, 57.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 6183 NumberOfCodeBlocks, 6183 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6146 ConstructedInterpolants, 0 QuantifiedInterpolants, 4651074 SizeOfPredicates, 59 NumberOfNonLiveVariables, 6570 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 37 InterpolantComputations, 24 PerfectInterpolantSequences, 2167/3372 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...