./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbecaa911234564619645b897eed5716f7c8acd9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:31:10,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:31:10,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:31:10,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:31:10,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:31:10,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:31:10,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:31:10,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:31:10,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:31:10,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:31:10,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:31:10,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:31:10,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:31:10,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:31:10,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:31:10,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:31:10,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:31:10,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:31:10,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:31:10,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:31:10,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:31:10,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:31:10,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:31:10,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:31:10,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:31:10,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:31:10,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:31:10,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:31:10,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:31:10,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:31:10,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:31:10,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:31:10,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:31:10,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:31:10,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:31:10,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:31:10,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:31:10,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:31:10,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:31:10,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:31:10,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:31:10,807 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:31:10,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:31:10,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:31:10,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:31:10,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:31:10,822 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:31:10,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:31:10,822 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:31:10,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:31:10,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:31:10,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:31:10,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:31:10,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:31:10,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:31:10,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:31:10,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:31:10,824 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:31:10,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:31:10,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:31:10,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:31:10,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:31:10,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:31:10,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:31:10,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:31:10,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:31:10,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:31:10,826 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:31:10,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:31:10,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:31:10,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbecaa911234564619645b897eed5716f7c8acd9 [2019-11-20 00:31:10,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:31:10,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:31:10,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:31:10,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:31:10,989 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:31:10,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2019-11-20 00:31:11,055 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/data/2d7e3c111/a48c433053ee4fa5acf397e98ef388f7/FLAGf71b695ac [2019-11-20 00:31:11,444 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:31:11,445 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2019-11-20 00:31:11,459 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/data/2d7e3c111/a48c433053ee4fa5acf397e98ef388f7/FLAGf71b695ac [2019-11-20 00:31:11,794 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/data/2d7e3c111/a48c433053ee4fa5acf397e98ef388f7 [2019-11-20 00:31:11,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:31:11,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:31:11,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:31:11,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:31:11,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:31:11,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:31:11" (1/1) ... [2019-11-20 00:31:11,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2e1f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:11, skipping insertion in model container [2019-11-20 00:31:11,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:31:11" (1/1) ... [2019-11-20 00:31:11,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:31:11,879 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:31:12,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:31:12,256 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:31:12,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:31:12,363 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:31:12,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12 WrapperNode [2019-11-20 00:31:12,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:31:12,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:31:12,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:31:12,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:31:12,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:31:12,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:31:12,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:31:12,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:31:12,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... [2019-11-20 00:31:12,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:31:12,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:31:12,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:31:12,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:31:12,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:31:12,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:31:12,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:31:13,737 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:31:13,737 INFO L285 CfgBuilder]: Removed 39 assume(true) statements. [2019-11-20 00:31:13,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:31:13 BoogieIcfgContainer [2019-11-20 00:31:13,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:31:13,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:31:13,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:31:13,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:31:13,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:31:11" (1/3) ... [2019-11-20 00:31:13,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69530bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:31:13, skipping insertion in model container [2019-11-20 00:31:13,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:31:12" (2/3) ... [2019-11-20 00:31:13,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69530bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:31:13, skipping insertion in model container [2019-11-20 00:31:13,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:31:13" (3/3) ... [2019-11-20 00:31:13,748 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2019-11-20 00:31:13,758 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:31:13,768 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 00:31:13,786 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 00:31:13,811 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:31:13,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:31:13,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:31:13,812 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:31:13,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:31:13,812 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:31:13,812 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:31:13,812 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:31:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2019-11-20 00:31:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:31:13,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:13,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:13,859 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash 991682984, now seen corresponding path program 1 times [2019-11-20 00:31:13,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:13,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26571895] [2019-11-20 00:31:13,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:14,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26571895] [2019-11-20 00:31:14,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:14,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:14,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920540053] [2019-11-20 00:31:14,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:14,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:14,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:14,044 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 3 states. [2019-11-20 00:31:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:14,552 INFO L93 Difference]: Finished difference Result 719 states and 1304 transitions. [2019-11-20 00:31:14,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:14,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 00:31:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:14,576 INFO L225 Difference]: With dead ends: 719 [2019-11-20 00:31:14,578 INFO L226 Difference]: Without dead ends: 446 [2019-11-20 00:31:14,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-20 00:31:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 430. [2019-11-20 00:31:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-11-20 00:31:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 673 transitions. [2019-11-20 00:31:14,704 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 673 transitions. Word has length 27 [2019-11-20 00:31:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:14,705 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 673 transitions. [2019-11-20 00:31:14,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 673 transitions. [2019-11-20 00:31:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 00:31:14,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:14,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:14,717 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:14,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2034129844, now seen corresponding path program 1 times [2019-11-20 00:31:14,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:14,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332636528] [2019-11-20 00:31:14,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:14,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332636528] [2019-11-20 00:31:14,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:14,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:14,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283703052] [2019-11-20 00:31:14,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:14,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:14,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:14,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:14,838 INFO L87 Difference]: Start difference. First operand 430 states and 673 transitions. Second operand 3 states. [2019-11-20 00:31:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:15,028 INFO L93 Difference]: Finished difference Result 1123 states and 1781 transitions. [2019-11-20 00:31:15,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:15,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-20 00:31:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:15,034 INFO L225 Difference]: With dead ends: 1123 [2019-11-20 00:31:15,034 INFO L226 Difference]: Without dead ends: 707 [2019-11-20 00:31:15,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-20 00:31:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 691. [2019-11-20 00:31:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-11-20 00:31:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1112 transitions. [2019-11-20 00:31:15,084 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1112 transitions. Word has length 36 [2019-11-20 00:31:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:15,084 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1112 transitions. [2019-11-20 00:31:15,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1112 transitions. [2019-11-20 00:31:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 00:31:15,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:15,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:15,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:15,088 INFO L82 PathProgramCache]: Analyzing trace with hash -838577631, now seen corresponding path program 1 times [2019-11-20 00:31:15,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:15,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296437303] [2019-11-20 00:31:15,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:15,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296437303] [2019-11-20 00:31:15,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:15,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:15,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797769161] [2019-11-20 00:31:15,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:15,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:15,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:15,183 INFO L87 Difference]: Start difference. First operand 691 states and 1112 transitions. Second operand 3 states. [2019-11-20 00:31:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:15,245 INFO L93 Difference]: Finished difference Result 1749 states and 2817 transitions. [2019-11-20 00:31:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:15,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 00:31:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:15,253 INFO L225 Difference]: With dead ends: 1749 [2019-11-20 00:31:15,253 INFO L226 Difference]: Without dead ends: 1083 [2019-11-20 00:31:15,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-11-20 00:31:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1071. [2019-11-20 00:31:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-11-20 00:31:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1722 transitions. [2019-11-20 00:31:15,302 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1722 transitions. Word has length 37 [2019-11-20 00:31:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:15,302 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 1722 transitions. [2019-11-20 00:31:15,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1722 transitions. [2019-11-20 00:31:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 00:31:15,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:15,310 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:15,310 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:15,311 INFO L82 PathProgramCache]: Analyzing trace with hash -981805896, now seen corresponding path program 1 times [2019-11-20 00:31:15,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:15,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88760679] [2019-11-20 00:31:15,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:15,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88760679] [2019-11-20 00:31:15,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:15,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:15,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547162827] [2019-11-20 00:31:15,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:15,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:15,392 INFO L87 Difference]: Start difference. First operand 1071 states and 1722 transitions. Second operand 3 states. [2019-11-20 00:31:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:15,480 INFO L93 Difference]: Finished difference Result 2861 states and 4598 transitions. [2019-11-20 00:31:15,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:15,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-20 00:31:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:15,491 INFO L225 Difference]: With dead ends: 2861 [2019-11-20 00:31:15,491 INFO L226 Difference]: Without dead ends: 1815 [2019-11-20 00:31:15,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-11-20 00:31:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1669. [2019-11-20 00:31:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-11-20 00:31:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2644 transitions. [2019-11-20 00:31:15,570 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2644 transitions. Word has length 46 [2019-11-20 00:31:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:15,571 INFO L462 AbstractCegarLoop]: Abstraction has 1669 states and 2644 transitions. [2019-11-20 00:31:15,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2644 transitions. [2019-11-20 00:31:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:31:15,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:15,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:15,573 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2019-11-20 00:31:15,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:15,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814772861] [2019-11-20 00:31:15,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:15,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814772861] [2019-11-20 00:31:15,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:15,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:15,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808728875] [2019-11-20 00:31:15,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:15,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:15,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:15,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:15,645 INFO L87 Difference]: Start difference. First operand 1669 states and 2644 transitions. Second operand 3 states. [2019-11-20 00:31:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:15,892 INFO L93 Difference]: Finished difference Result 4653 states and 7348 transitions. [2019-11-20 00:31:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:15,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-20 00:31:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:15,909 INFO L225 Difference]: With dead ends: 4653 [2019-11-20 00:31:15,909 INFO L226 Difference]: Without dead ends: 3003 [2019-11-20 00:31:15,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2019-11-20 00:31:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2937. [2019-11-20 00:31:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-11-20 00:31:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4575 transitions. [2019-11-20 00:31:16,022 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 4575 transitions. Word has length 52 [2019-11-20 00:31:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:16,024 INFO L462 AbstractCegarLoop]: Abstraction has 2937 states and 4575 transitions. [2019-11-20 00:31:16,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 4575 transitions. [2019-11-20 00:31:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:31:16,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:16,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:16,026 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2019-11-20 00:31:16,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:16,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221866736] [2019-11-20 00:31:16,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:16,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221866736] [2019-11-20 00:31:16,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:16,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:16,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703508875] [2019-11-20 00:31:16,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:16,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:16,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:16,068 INFO L87 Difference]: Start difference. First operand 2937 states and 4575 transitions. Second operand 3 states. [2019-11-20 00:31:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:16,227 INFO L93 Difference]: Finished difference Result 6903 states and 10702 transitions. [2019-11-20 00:31:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:16,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-20 00:31:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:16,249 INFO L225 Difference]: With dead ends: 6903 [2019-11-20 00:31:16,250 INFO L226 Difference]: Without dead ends: 3989 [2019-11-20 00:31:16,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2019-11-20 00:31:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3805. [2019-11-20 00:31:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3805 states. [2019-11-20 00:31:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 5841 transitions. [2019-11-20 00:31:16,409 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 5841 transitions. Word has length 52 [2019-11-20 00:31:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:16,411 INFO L462 AbstractCegarLoop]: Abstraction has 3805 states and 5841 transitions. [2019-11-20 00:31:16,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 5841 transitions. [2019-11-20 00:31:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 00:31:16,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:16,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:16,416 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:16,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash -471765361, now seen corresponding path program 1 times [2019-11-20 00:31:16,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:16,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863806324] [2019-11-20 00:31:16,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:16,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863806324] [2019-11-20 00:31:16,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:16,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:16,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091694586] [2019-11-20 00:31:16,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:16,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:16,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:16,466 INFO L87 Difference]: Start difference. First operand 3805 states and 5841 transitions. Second operand 3 states. [2019-11-20 00:31:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:16,948 INFO L93 Difference]: Finished difference Result 9149 states and 14130 transitions. [2019-11-20 00:31:16,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:16,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-20 00:31:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:16,981 INFO L225 Difference]: With dead ends: 9149 [2019-11-20 00:31:16,981 INFO L226 Difference]: Without dead ends: 5367 [2019-11-20 00:31:16,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2019-11-20 00:31:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5277. [2019-11-20 00:31:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5277 states. [2019-11-20 00:31:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 8009 transitions. [2019-11-20 00:31:17,232 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 8009 transitions. Word has length 56 [2019-11-20 00:31:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:17,233 INFO L462 AbstractCegarLoop]: Abstraction has 5277 states and 8009 transitions. [2019-11-20 00:31:17,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 8009 transitions. [2019-11-20 00:31:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 00:31:17,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:17,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:17,236 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1405970949, now seen corresponding path program 1 times [2019-11-20 00:31:17,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:17,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637013103] [2019-11-20 00:31:17,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:17,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637013103] [2019-11-20 00:31:17,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:17,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:17,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342914441] [2019-11-20 00:31:17,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:17,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:17,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:17,305 INFO L87 Difference]: Start difference. First operand 5277 states and 8009 transitions. Second operand 3 states. [2019-11-20 00:31:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:17,631 INFO L93 Difference]: Finished difference Result 10531 states and 15988 transitions. [2019-11-20 00:31:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:17,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-20 00:31:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:17,661 INFO L225 Difference]: With dead ends: 10531 [2019-11-20 00:31:17,661 INFO L226 Difference]: Without dead ends: 5277 [2019-11-20 00:31:17,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2019-11-20 00:31:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 5277. [2019-11-20 00:31:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5277 states. [2019-11-20 00:31:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7873 transitions. [2019-11-20 00:31:17,902 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7873 transitions. Word has length 58 [2019-11-20 00:31:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:17,903 INFO L462 AbstractCegarLoop]: Abstraction has 5277 states and 7873 transitions. [2019-11-20 00:31:17,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7873 transitions. [2019-11-20 00:31:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 00:31:17,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:17,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:17,906 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1783171650, now seen corresponding path program 1 times [2019-11-20 00:31:17,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:17,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176143250] [2019-11-20 00:31:17,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:17,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176143250] [2019-11-20 00:31:17,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:17,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:17,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415101399] [2019-11-20 00:31:17,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:17,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:17,946 INFO L87 Difference]: Start difference. First operand 5277 states and 7873 transitions. Second operand 3 states. [2019-11-20 00:31:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:18,465 INFO L93 Difference]: Finished difference Result 11891 states and 17776 transitions. [2019-11-20 00:31:18,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:18,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-20 00:31:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:18,507 INFO L225 Difference]: With dead ends: 11891 [2019-11-20 00:31:18,507 INFO L226 Difference]: Without dead ends: 6637 [2019-11-20 00:31:18,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2019-11-20 00:31:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 5907. [2019-11-20 00:31:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5907 states. [2019-11-20 00:31:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5907 states to 5907 states and 8635 transitions. [2019-11-20 00:31:18,794 INFO L78 Accepts]: Start accepts. Automaton has 5907 states and 8635 transitions. Word has length 59 [2019-11-20 00:31:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:18,796 INFO L462 AbstractCegarLoop]: Abstraction has 5907 states and 8635 transitions. [2019-11-20 00:31:18,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5907 states and 8635 transitions. [2019-11-20 00:31:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:31:18,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:18,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:18,799 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:18,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash -920667186, now seen corresponding path program 1 times [2019-11-20 00:31:18,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:18,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661537431] [2019-11-20 00:31:18,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:18,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661537431] [2019-11-20 00:31:18,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:18,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:31:18,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174675986] [2019-11-20 00:31:18,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:31:18,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:31:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:31:18,859 INFO L87 Difference]: Start difference. First operand 5907 states and 8635 transitions. Second operand 5 states. [2019-11-20 00:31:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:20,069 INFO L93 Difference]: Finished difference Result 30963 states and 45372 transitions. [2019-11-20 00:31:20,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:31:20,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-20 00:31:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:20,126 INFO L225 Difference]: With dead ends: 30963 [2019-11-20 00:31:20,126 INFO L226 Difference]: Without dead ends: 25079 [2019-11-20 00:31:20,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:31:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25079 states. [2019-11-20 00:31:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25079 to 8255. [2019-11-20 00:31:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8255 states. [2019-11-20 00:31:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 12088 transitions. [2019-11-20 00:31:20,882 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 12088 transitions. Word has length 61 [2019-11-20 00:31:20,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:20,882 INFO L462 AbstractCegarLoop]: Abstraction has 8255 states and 12088 transitions. [2019-11-20 00:31:20,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:31:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 12088 transitions. [2019-11-20 00:31:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-20 00:31:20,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:20,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:20,885 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:20,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:20,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1524549323, now seen corresponding path program 1 times [2019-11-20 00:31:20,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:20,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481285537] [2019-11-20 00:31:20,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:21,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481285537] [2019-11-20 00:31:21,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:21,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 00:31:21,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829874433] [2019-11-20 00:31:21,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:31:21,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:31:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:31:21,015 INFO L87 Difference]: Start difference. First operand 8255 states and 12088 transitions. Second operand 7 states. [2019-11-20 00:31:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:23,899 INFO L93 Difference]: Finished difference Result 41073 states and 60227 transitions. [2019-11-20 00:31:23,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-20 00:31:23,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-11-20 00:31:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:23,971 INFO L225 Difference]: With dead ends: 41073 [2019-11-20 00:31:23,972 INFO L226 Difference]: Without dead ends: 32841 [2019-11-20 00:31:23,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-11-20 00:31:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32841 states. [2019-11-20 00:31:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32841 to 5497. [2019-11-20 00:31:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2019-11-20 00:31:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 7945 transitions. [2019-11-20 00:31:24,694 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 7945 transitions. Word has length 62 [2019-11-20 00:31:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:24,694 INFO L462 AbstractCegarLoop]: Abstraction has 5497 states and 7945 transitions. [2019-11-20 00:31:24,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:31:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 7945 transitions. [2019-11-20 00:31:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 00:31:24,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:24,702 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:24,702 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1908319894, now seen corresponding path program 1 times [2019-11-20 00:31:24,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:24,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764676162] [2019-11-20 00:31:24,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:24,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764676162] [2019-11-20 00:31:24,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:24,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:24,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440841277] [2019-11-20 00:31:24,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:24,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:24,745 INFO L87 Difference]: Start difference. First operand 5497 states and 7945 transitions. Second operand 3 states. [2019-11-20 00:31:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:25,155 INFO L93 Difference]: Finished difference Result 11578 states and 16683 transitions. [2019-11-20 00:31:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:25,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-20 00:31:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:25,167 INFO L225 Difference]: With dead ends: 11578 [2019-11-20 00:31:25,167 INFO L226 Difference]: Without dead ends: 6102 [2019-11-20 00:31:25,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-11-20 00:31:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 6010. [2019-11-20 00:31:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6010 states. [2019-11-20 00:31:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 8641 transitions. [2019-11-20 00:31:25,533 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 8641 transitions. Word has length 77 [2019-11-20 00:31:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:25,533 INFO L462 AbstractCegarLoop]: Abstraction has 6010 states and 8641 transitions. [2019-11-20 00:31:25,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 8641 transitions. [2019-11-20 00:31:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:31:25,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:25,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:25,537 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1154888105, now seen corresponding path program 1 times [2019-11-20 00:31:25,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:25,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628500416] [2019-11-20 00:31:25,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:25,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628500416] [2019-11-20 00:31:25,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:25,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:25,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565575697] [2019-11-20 00:31:25,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:25,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:25,570 INFO L87 Difference]: Start difference. First operand 6010 states and 8641 transitions. Second operand 3 states. [2019-11-20 00:31:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:26,161 INFO L93 Difference]: Finished difference Result 15494 states and 22182 transitions. [2019-11-20 00:31:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:26,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-20 00:31:26,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:26,179 INFO L225 Difference]: With dead ends: 15494 [2019-11-20 00:31:26,179 INFO L226 Difference]: Without dead ends: 9373 [2019-11-20 00:31:26,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9373 states. [2019-11-20 00:31:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9373 to 9345. [2019-11-20 00:31:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9345 states. [2019-11-20 00:31:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9345 states to 9345 states and 13259 transitions. [2019-11-20 00:31:26,808 INFO L78 Accepts]: Start accepts. Automaton has 9345 states and 13259 transitions. Word has length 88 [2019-11-20 00:31:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:26,808 INFO L462 AbstractCegarLoop]: Abstraction has 9345 states and 13259 transitions. [2019-11-20 00:31:26,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 9345 states and 13259 transitions. [2019-11-20 00:31:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 00:31:26,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:26,812 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:26,812 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash -258076045, now seen corresponding path program 1 times [2019-11-20 00:31:26,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:26,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930577391] [2019-11-20 00:31:26,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:26,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930577391] [2019-11-20 00:31:26,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:26,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:26,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774739460] [2019-11-20 00:31:26,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:26,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:26,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:26,848 INFO L87 Difference]: Start difference. First operand 9345 states and 13259 transitions. Second operand 3 states. [2019-11-20 00:31:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:27,377 INFO L93 Difference]: Finished difference Result 17198 states and 24332 transitions. [2019-11-20 00:31:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:27,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-11-20 00:31:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:27,393 INFO L225 Difference]: With dead ends: 17198 [2019-11-20 00:31:27,393 INFO L226 Difference]: Without dead ends: 6890 [2019-11-20 00:31:27,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2019-11-20 00:31:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6477. [2019-11-20 00:31:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6477 states. [2019-11-20 00:31:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6477 states to 6477 states and 8769 transitions. [2019-11-20 00:31:27,747 INFO L78 Accepts]: Start accepts. Automaton has 6477 states and 8769 transitions. Word has length 95 [2019-11-20 00:31:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:27,747 INFO L462 AbstractCegarLoop]: Abstraction has 6477 states and 8769 transitions. [2019-11-20 00:31:27,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6477 states and 8769 transitions. [2019-11-20 00:31:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:31:27,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:27,749 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:27,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash 642962762, now seen corresponding path program 1 times [2019-11-20 00:31:27,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:27,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895556971] [2019-11-20 00:31:27,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:31:27,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895556971] [2019-11-20 00:31:27,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:27,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:27,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143614575] [2019-11-20 00:31:27,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:27,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:27,801 INFO L87 Difference]: Start difference. First operand 6477 states and 8769 transitions. Second operand 3 states. [2019-11-20 00:31:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:28,065 INFO L93 Difference]: Finished difference Result 10474 states and 14252 transitions. [2019-11-20 00:31:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:28,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 00:31:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:28,074 INFO L225 Difference]: With dead ends: 10474 [2019-11-20 00:31:28,074 INFO L226 Difference]: Without dead ends: 4111 [2019-11-20 00:31:28,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-11-20 00:31:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4093. [2019-11-20 00:31:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4093 states. [2019-11-20 00:31:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 5426 transitions. [2019-11-20 00:31:28,513 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 5426 transitions. Word has length 98 [2019-11-20 00:31:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:28,513 INFO L462 AbstractCegarLoop]: Abstraction has 4093 states and 5426 transitions. [2019-11-20 00:31:28,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 5426 transitions. [2019-11-20 00:31:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:31:28,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:28,515 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:28,515 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash 635068147, now seen corresponding path program 1 times [2019-11-20 00:31:28,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:28,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086198081] [2019-11-20 00:31:28,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:31:28,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086198081] [2019-11-20 00:31:28,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:28,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:28,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783792964] [2019-11-20 00:31:28,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:28,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:28,555 INFO L87 Difference]: Start difference. First operand 4093 states and 5426 transitions. Second operand 3 states. [2019-11-20 00:31:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:28,808 INFO L93 Difference]: Finished difference Result 7248 states and 9640 transitions. [2019-11-20 00:31:28,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:28,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 00:31:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:28,817 INFO L225 Difference]: With dead ends: 7248 [2019-11-20 00:31:28,817 INFO L226 Difference]: Without dead ends: 3230 [2019-11-20 00:31:28,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-11-20 00:31:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 2928. [2019-11-20 00:31:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-11-20 00:31:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3791 transitions. [2019-11-20 00:31:29,017 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3791 transitions. Word has length 98 [2019-11-20 00:31:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:29,017 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 3791 transitions. [2019-11-20 00:31:29,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3791 transitions. [2019-11-20 00:31:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:31:29,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:29,019 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:29,019 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1785938939, now seen corresponding path program 1 times [2019-11-20 00:31:29,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:29,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418085038] [2019-11-20 00:31:29,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:31:29,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418085038] [2019-11-20 00:31:29,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:29,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:29,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144396871] [2019-11-20 00:31:29,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:29,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:29,072 INFO L87 Difference]: Start difference. First operand 2928 states and 3791 transitions. Second operand 3 states. [2019-11-20 00:31:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:29,284 INFO L93 Difference]: Finished difference Result 3246 states and 4167 transitions. [2019-11-20 00:31:29,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:29,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 00:31:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:29,289 INFO L225 Difference]: With dead ends: 3246 [2019-11-20 00:31:29,289 INFO L226 Difference]: Without dead ends: 3242 [2019-11-20 00:31:29,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2019-11-20 00:31:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3217. [2019-11-20 00:31:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-11-20 00:31:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4120 transitions. [2019-11-20 00:31:29,513 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4120 transitions. Word has length 99 [2019-11-20 00:31:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:29,514 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4120 transitions. [2019-11-20 00:31:29,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4120 transitions. [2019-11-20 00:31:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 00:31:29,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:29,517 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:29,518 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1770134526, now seen corresponding path program 1 times [2019-11-20 00:31:29,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:29,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403789273] [2019-11-20 00:31:29,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:31:29,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403789273] [2019-11-20 00:31:29,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:29,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:31:29,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468562233] [2019-11-20 00:31:29,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:31:29,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:29,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:31:29,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:31:29,633 INFO L87 Difference]: Start difference. First operand 3217 states and 4120 transitions. Second operand 5 states. [2019-11-20 00:31:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:29,953 INFO L93 Difference]: Finished difference Result 6362 states and 8192 transitions. [2019-11-20 00:31:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:31:29,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-20 00:31:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:29,959 INFO L225 Difference]: With dead ends: 6362 [2019-11-20 00:31:29,959 INFO L226 Difference]: Without dead ends: 3353 [2019-11-20 00:31:29,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:31:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2019-11-20 00:31:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2976. [2019-11-20 00:31:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-20 00:31:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3815 transitions. [2019-11-20 00:31:30,192 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3815 transitions. Word has length 156 [2019-11-20 00:31:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:30,193 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3815 transitions. [2019-11-20 00:31:30,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:31:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3815 transitions. [2019-11-20 00:31:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 00:31:30,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:30,196 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:30,196 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:30,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:30,196 INFO L82 PathProgramCache]: Analyzing trace with hash -301012961, now seen corresponding path program 1 times [2019-11-20 00:31:30,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:30,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871980012] [2019-11-20 00:31:30,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 00:31:30,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871980012] [2019-11-20 00:31:30,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:30,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:30,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134875217] [2019-11-20 00:31:30,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:30,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:30,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:30,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:30,272 INFO L87 Difference]: Start difference. First operand 2976 states and 3815 transitions. Second operand 3 states. [2019-11-20 00:31:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:30,924 INFO L93 Difference]: Finished difference Result 6619 states and 8530 transitions. [2019-11-20 00:31:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:30,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-20 00:31:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:30,931 INFO L225 Difference]: With dead ends: 6619 [2019-11-20 00:31:30,931 INFO L226 Difference]: Without dead ends: 3857 [2019-11-20 00:31:30,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2019-11-20 00:31:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3788. [2019-11-20 00:31:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3788 states. [2019-11-20 00:31:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 4739 transitions. [2019-11-20 00:31:31,382 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 4739 transitions. Word has length 156 [2019-11-20 00:31:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:31,383 INFO L462 AbstractCegarLoop]: Abstraction has 3788 states and 4739 transitions. [2019-11-20 00:31:31,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 4739 transitions. [2019-11-20 00:31:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 00:31:31,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:31,386 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:31,386 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1930765297, now seen corresponding path program 1 times [2019-11-20 00:31:31,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:31,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533770500] [2019-11-20 00:31:31,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 00:31:31,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533770500] [2019-11-20 00:31:31,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:31,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:31:31,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220568194] [2019-11-20 00:31:31,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:31:31,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:31:31,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:31,449 INFO L87 Difference]: Start difference. First operand 3788 states and 4739 transitions. Second operand 3 states. [2019-11-20 00:31:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:31,646 INFO L93 Difference]: Finished difference Result 4299 states and 5310 transitions. [2019-11-20 00:31:31,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:31:31,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-20 00:31:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:31,648 INFO L225 Difference]: With dead ends: 4299 [2019-11-20 00:31:31,648 INFO L226 Difference]: Without dead ends: 613 [2019-11-20 00:31:31,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:31:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-20 00:31:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2019-11-20 00:31:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-20 00:31:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 670 transitions. [2019-11-20 00:31:31,694 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 670 transitions. Word has length 157 [2019-11-20 00:31:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:31,695 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 670 transitions. [2019-11-20 00:31:31,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:31:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 670 transitions. [2019-11-20 00:31:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 00:31:31,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:31,697 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:31,697 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:31,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1961852785, now seen corresponding path program 1 times [2019-11-20 00:31:31,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:31,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294750394] [2019-11-20 00:31:31,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 00:31:31,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294750394] [2019-11-20 00:31:31,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:31,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:31:31,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296533353] [2019-11-20 00:31:31,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:31:31,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:31:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:31:31,795 INFO L87 Difference]: Start difference. First operand 610 states and 670 transitions. Second operand 5 states. [2019-11-20 00:31:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:31,952 INFO L93 Difference]: Finished difference Result 1255 states and 1370 transitions. [2019-11-20 00:31:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 00:31:31,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-11-20 00:31:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:31,954 INFO L225 Difference]: With dead ends: 1255 [2019-11-20 00:31:31,954 INFO L226 Difference]: Without dead ends: 931 [2019-11-20 00:31:31,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:31:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-11-20 00:31:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 610. [2019-11-20 00:31:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-20 00:31:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 666 transitions. [2019-11-20 00:31:32,006 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 666 transitions. Word has length 158 [2019-11-20 00:31:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:32,006 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 666 transitions. [2019-11-20 00:31:32,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:31:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 666 transitions. [2019-11-20 00:31:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 00:31:32,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:32,009 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:32,009 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1495401652, now seen corresponding path program 1 times [2019-11-20 00:31:32,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:32,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928059935] [2019-11-20 00:31:32,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 00:31:32,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928059935] [2019-11-20 00:31:32,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:32,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 00:31:32,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350398020] [2019-11-20 00:31:32,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:31:32,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:31:32,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:31:32,097 INFO L87 Difference]: Start difference. First operand 610 states and 666 transitions. Second operand 7 states. [2019-11-20 00:31:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:32,363 INFO L93 Difference]: Finished difference Result 1131 states and 1238 transitions. [2019-11-20 00:31:32,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 00:31:32,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-11-20 00:31:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:32,366 INFO L225 Difference]: With dead ends: 1131 [2019-11-20 00:31:32,366 INFO L226 Difference]: Without dead ends: 1129 [2019-11-20 00:31:32,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:31:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-11-20 00:31:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 608. [2019-11-20 00:31:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-11-20 00:31:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 663 transitions. [2019-11-20 00:31:32,424 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 663 transitions. Word has length 160 [2019-11-20 00:31:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:32,424 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 663 transitions. [2019-11-20 00:31:32,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:31:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 663 transitions. [2019-11-20 00:31:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 00:31:32,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:32,427 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:32,427 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash 887650061, now seen corresponding path program 1 times [2019-11-20 00:31:32,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:32,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495964383] [2019-11-20 00:31:32,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 00:31:32,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495964383] [2019-11-20 00:31:32,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:31:32,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:31:32,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118269167] [2019-11-20 00:31:32,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:31:32,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:31:32,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:31:32,501 INFO L87 Difference]: Start difference. First operand 608 states and 663 transitions. Second operand 5 states. [2019-11-20 00:31:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:32,625 INFO L93 Difference]: Finished difference Result 838 states and 911 transitions. [2019-11-20 00:31:32,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:31:32,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-11-20 00:31:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:32,627 INFO L225 Difference]: With dead ends: 838 [2019-11-20 00:31:32,627 INFO L226 Difference]: Without dead ends: 734 [2019-11-20 00:31:32,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:31:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-11-20 00:31:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 600. [2019-11-20 00:31:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-20 00:31:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 650 transitions. [2019-11-20 00:31:32,680 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 650 transitions. Word has length 161 [2019-11-20 00:31:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:32,681 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 650 transitions. [2019-11-20 00:31:32,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:31:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 650 transitions. [2019-11-20 00:31:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-20 00:31:32,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:31:32,684 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:31:32,684 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:31:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:31:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1388250693, now seen corresponding path program 1 times [2019-11-20 00:31:32,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:31:32,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4175746] [2019-11-20 00:31:32,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:31:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:33,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4175746] [2019-11-20 00:31:33,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291046552] [2019-11-20 00:31:33,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:31:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:31:33,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 00:31:33,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:31:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:31:33,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:31:33,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2019-11-20 00:31:33,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289079009] [2019-11-20 00:31:33,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 00:31:33,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:31:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 00:31:33,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-11-20 00:31:33,792 INFO L87 Difference]: Start difference. First operand 600 states and 650 transitions. Second operand 29 states. [2019-11-20 00:31:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:31:35,357 INFO L93 Difference]: Finished difference Result 959 states and 1046 transitions. [2019-11-20 00:31:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-20 00:31:35,358 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 220 [2019-11-20 00:31:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:31:35,358 INFO L225 Difference]: With dead ends: 959 [2019-11-20 00:31:35,358 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:31:35,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=459, Invalid=2511, Unknown=0, NotChecked=0, Total=2970 [2019-11-20 00:31:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:31:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:31:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:31:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:31:35,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2019-11-20 00:31:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:31:35,361 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:31:35,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 00:31:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:31:35,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:31:35,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:31:35,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:31:35,805 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 136 [2019-11-20 00:31:36,208 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 165 [2019-11-20 00:31:36,355 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 92 [2019-11-20 00:31:36,514 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2019-11-20 00:31:37,452 WARN L191 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 276 [2019-11-20 00:31:37,721 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 93 [2019-11-20 00:31:38,530 WARN L191 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-11-20 00:31:38,769 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 153 [2019-11-20 00:31:39,472 WARN L191 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-11-20 00:31:40,933 WARN L191 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 769 DAG size of output: 374 [2019-11-20 00:31:41,477 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-11-20 00:31:43,416 WARN L191 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 976 DAG size of output: 477 [2019-11-20 00:31:43,806 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 193 [2019-11-20 00:31:44,029 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-11-20 00:31:44,183 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 120 [2019-11-20 00:31:44,334 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 179 [2019-11-20 00:31:44,537 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-11-20 00:31:44,651 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 163 [2019-11-20 00:31:44,921 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 206 [2019-11-20 00:31:45,748 WARN L191 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-11-20 00:31:45,907 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 167 [2019-11-20 00:31:46,328 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-11-20 00:31:46,589 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-11-20 00:31:48,226 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 902 DAG size of output: 439 [2019-11-20 00:31:48,512 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 163 [2019-11-20 00:31:48,730 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 176 [2019-11-20 00:31:49,434 WARN L191 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-11-20 00:31:50,008 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 533 DAG size of output: 281 [2019-11-20 00:31:51,082 WARN L191 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-11-20 00:31:51,353 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 62 [2019-11-20 00:31:51,629 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2019-11-20 00:31:51,992 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-11-20 00:31:52,115 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-20 00:31:53,746 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 265 DAG size of output: 89 [2019-11-20 00:31:54,062 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-11-20 00:31:54,373 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-11-20 00:31:54,588 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 35 [2019-11-20 00:31:56,158 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-11-20 00:31:56,268 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-20 00:31:56,625 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 45 [2019-11-20 00:31:56,743 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-20 00:31:58,237 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-11-20 00:31:58,355 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-20 00:31:59,048 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-11-20 00:31:59,162 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-20 00:31:59,856 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-11-20 00:31:59,998 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-20 00:32:00,158 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 24 [2019-11-20 00:32:00,467 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-11-20 00:32:00,975 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-11-20 00:32:01,302 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2019-11-20 00:32:03,525 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 358 DAG size of output: 107 [2019-11-20 00:32:05,294 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-11-20 00:32:05,406 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-20 00:32:05,858 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-11-20 00:32:05,975 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-20 00:32:06,195 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2019-11-20 00:32:06,312 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-20 00:32:06,423 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-20 00:32:06,875 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-11-20 00:32:07,090 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-20 00:32:09,502 WARN L191 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 462 DAG size of output: 104 [2019-11-20 00:32:09,751 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 60 [2019-11-20 00:32:10,113 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 61 [2019-11-20 00:32:10,253 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-20 00:32:10,540 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-11-20 00:32:11,153 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 77 [2019-11-20 00:32:11,296 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-20 00:32:11,405 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-20 00:32:12,077 WARN L191 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-11-20 00:32:12,375 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-11-20 00:32:12,798 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 49 [2019-11-20 00:32:13,425 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-11-20 00:32:13,767 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 48 [2019-11-20 00:32:14,238 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-11-20 00:32:15,123 WARN L191 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 76 [2019-11-20 00:32:15,295 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-11-20 00:32:15,837 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-11-20 00:32:16,059 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-11-20 00:32:16,202 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-20 00:32:17,740 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-11-20 00:32:18,408 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 70 [2019-11-20 00:32:18,581 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-20 00:32:18,834 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 52 [2019-11-20 00:32:19,548 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-11-20 00:32:20,288 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-11-20 00:32:20,661 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-11-20 00:32:21,416 WARN L191 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-11-20 00:32:23,714 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 423 DAG size of output: 106 [2019-11-20 00:32:24,387 WARN L191 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-11-20 00:32:24,858 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 53 [2019-11-20 00:32:25,417 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 70 [2019-11-20 00:32:25,576 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-11-20 00:32:26,197 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 75 [2019-11-20 00:32:26,349 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 50 [2019-11-20 00:32:26,582 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 58 [2019-11-20 00:32:26,821 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 58 [2019-11-20 00:32:28,323 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-11-20 00:32:28,610 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-11-20 00:32:28,715 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-20 00:32:28,828 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-20 00:32:30,352 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 271 DAG size of output: 104 [2019-11-20 00:32:30,477 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-20 00:32:31,212 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-11-20 00:32:31,616 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 54 [2019-11-20 00:32:31,620 INFO L440 ceAbstractionStarter]: At program point L894(lines 868 895) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse2 (<= 1 ~c_m_lock~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 6 ~m_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse1 (= ~req_tt_a~0 0) .cse2 (= ~s_run_pc~0 2) (and .cse3 .cse4) .cse5) (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse1 .cse0 (<= ~c_req_type~0 1) .cse2 (let ((.cse6 (= 3 ~m_run_pc~0)) (.cse7 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse9 (<= 1 ~c_req_type~0))) (or (and .cse6 .cse7 .cse8 .cse9 (<= 2 ~s_run_pc~0) .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse9 (= 0 ~s_run_pc~0) .cse3 .cse4))) .cse5)))) [2019-11-20 00:32:31,620 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,620 INFO L444 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-11-20 00:32:31,620 INFO L440 ceAbstractionStarter]: At program point L102(lines 91 833) the Hoare annotation is: (let ((.cse6 (<= ~c_req_a~0 0)) (.cse8 (<= 0 ~c_req_a~0)) (.cse0 (= 3 ~m_run_pc~0)) (.cse1 (<= 1 ~c_req_type~0)) (.cse12 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (let ((.cse13 (and .cse6 .cse8 (and .cse0 .cse1 .cse12 .cse4))) (.cse14 (= 0 ~s_run_pc~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ~c_req_type~0 1)) (.cse5 (<= ~c_req_d~0 50)) (.cse7 (<= 50 ~c_req_d~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse11 (= ~s_run_pc~0 2)) (.cse17 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 2 ~s_run_st~0)) (.cse16 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse5 .cse7 .cse9 .cse2 .cse13 .cse3 .cse14 .cse10) (and .cse15 (and .cse0 .cse12 (not .cse11) .cse4) .cse16) (and .cse13 .cse15 .cse14) (and .cse2 .cse3 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse5 .cse7 (and .cse0 .cse1 .cse17 .cse12) .cse9 .cse15 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse11 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse0 .cse17 .cse12 .cse4) .cse16) (and .cse0 .cse9 .cse15 .cse16 .cse12 .cse4)))) [2019-11-20 00:32:31,620 INFO L440 ceAbstractionStarter]: At program point L168-2(lines 168 196) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse3 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse18 (= 0 ~s_run_pc~0)) (.cse7 (= 0 ~c_req_a~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse15 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse11 (<= 2 ~s_run_st~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse8 .cse2 .cse3 .cse11 .cse18 .cse14 .cse16 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse11 (and (not (= ~s_run_pc~0 2)) .cse6 .cse16) .cse5))) [2019-11-20 00:32:31,620 INFO L444 ceAbstractionStarter]: For program point L763(lines 763 767) no Hoare annotation was computed. [2019-11-20 00:32:31,620 INFO L444 ceAbstractionStarter]: For program point L697(lines 697 701) no Hoare annotation was computed. [2019-11-20 00:32:31,621 INFO L440 ceAbstractionStarter]: At program point L1292(lines 1285 1302) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse34 (= 3 ~m_run_pc~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse28 (= ~req_tt_a~0 0)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (<= ~m_run_pc~0 0)) (.cse18 (= 0 ~c_req_type~0)) (.cse26 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse19 (and .cse7 .cse8)) (.cse12 (<= 0 ~a_t~0)) (.cse20 (= 6 ~m_run_pc~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (and .cse0 .cse1 (and .cse34 .cse33 .cse7 .cse8))) (.cse5 (= 0 ~s_run_pc~0)) (.cse32 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse28 .cse29 .cse15 .cse16 .cse30 .cse17 .cse31) (and .cse4 .cse32 (and .cse7 (not .cse16) .cse8)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (and .cse11 .cse12 .cse4 (and .cse2 .cse7) .cse20 .cse15 .cse16 .cse17) .cse26 .cse22) (= ULTIMATE.start_s_run_~req_type~1 0) .cse18) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse12 .cse3 .cse18 .cse8 .cse26 .cse2 .cse11 .cse4 .cse16 .cse6 .cse7) (and .cse9 .cse10 (and .cse33 .cse11 .cse12 .cse4 .cse27 .cse13 .cse15 .cse16 (and .cse34 .cse2 .cse7) .cse23 .cse17) .cse29 .cse21 .cse30 .cse22 .cse24 .cse31) (and .cse12 .cse3 .cse18 .cse5 .cse8 .cse26 .cse2 .cse11 .cse6 .cse7) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17)) (and .cse20 (and .cse2 .cse11 .cse12 .cse4 .cse16 .cse7 .cse8 .cse17)) (and (and .cse11 .cse4 .cse19 .cse16) .cse12 .cse20 .cse15 .cse17) (and .cse4 .cse14 .cse5) (and .cse32 (and .cse34 .cse2 .cse7 .cse8)) (and (and .cse34 .cse7 .cse8) .cse11 .cse4 .cse16)))) [2019-11-20 00:32:31,621 INFO L440 ceAbstractionStarter]: At program point L235(lines 228 254) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse22 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse18 (and (<= ~m_run_pc~0 0) .cse2 .cse1)) (.cse17 (and (= 3 ~m_run_pc~0) .cse1 .cse2)) (.cse23 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse4 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (<= ~c_req_type~0 1)) (.cse5 (<= ~c_req_d~0 50)) (.cse6 (<= 50 ~c_req_d~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse0 (= ~s_run_pc~0 2)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (and .cse14 .cse15 .cse19 .cse20 (and .cse16 .cse22 (or .cse18 .cse17)) .cse23 .cse21)) (.cse3 (<= 2 ~s_run_st~0)) (.cse10 (= 0 ~s_run_pc~0))) (or (and (and (not .cse0) .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse7 .cse9 .cse5 .cse6 .cse3 .cse11 .cse12 .cse0 (and .cse14 .cse15 (and .cse16 (or .cse17 .cse18)) .cse19 .cse20 .cse21) .cse22 .cse13 .cse23) (and .cse8 .cse3 .cse10))))) [2019-11-20 00:32:31,621 INFO L444 ceAbstractionStarter]: For program point L169(lines 168 196) no Hoare annotation was computed. [2019-11-20 00:32:31,621 INFO L440 ceAbstractionStarter]: At program point L962(lines 955 972) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse0 .cse1 (<= ~c_req_type~0 1) (let ((.cse2 (= 3 ~m_run_pc~0)) (.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse6 (<= 1 ~c_req_type~0)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_type~1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~s_run_pc~0) .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~s_run_pc~0) .cse8 .cse9 .cse10))) .cse11 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse12) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (and .cse1 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse8 (= 0 ~c_req_a~0) (and .cse5 .cse9 .cse10) .cse0 .cse11 (= ~s_run_pc~0 2) .cse12) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2019-11-20 00:32:31,621 INFO L444 ceAbstractionStarter]: For program point L1293(lines 1245 1334) no Hoare annotation was computed. [2019-11-20 00:32:31,621 INFO L444 ceAbstractionStarter]: For program point L1227(lines 1227 1231) no Hoare annotation was computed. [2019-11-20 00:32:31,621 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 174) no Hoare annotation was computed. [2019-11-20 00:32:31,621 INFO L444 ceAbstractionStarter]: For program point L104(lines 104 116) no Hoare annotation was computed. [2019-11-20 00:32:31,621 INFO L444 ceAbstractionStarter]: For program point L963(lines 955 972) no Hoare annotation was computed. [2019-11-20 00:32:31,622 INFO L440 ceAbstractionStarter]: At program point L435(lines 428 445) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,622 INFO L444 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-11-20 00:32:31,622 INFO L444 ceAbstractionStarter]: For program point L1294(lines 1294 1298) no Hoare annotation was computed. [2019-11-20 00:32:31,622 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 241) no Hoare annotation was computed. [2019-11-20 00:32:31,622 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1166) no Hoare annotation was computed. [2019-11-20 00:32:31,622 INFO L440 ceAbstractionStarter]: At program point L105(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2019-11-20 00:32:31,622 INFO L444 ceAbstractionStarter]: For program point L1162-2(lines 1160 1339) no Hoare annotation was computed. [2019-11-20 00:32:31,622 INFO L440 ceAbstractionStarter]: At program point L1030(lines 1023 1076) the Hoare annotation is: (let ((.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= 1 ~c_req_type~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse14 (= 3 ~m_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse5 (= ~s_run_pc~0 2)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (<= ~c_req_type~0 1)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 .cse4 .cse5 .cse6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 (and .cse12 .cse3 .cse0 .cse13 (and .cse14 .cse2) .cse15 .cse4 .cse5 .cse16 .cse6) .cse17 .cse18) (and .cse7 .cse8 .cse9 (and .cse12 .cse3 .cse0 (let ((.cse19 (and .cse14 .cse2 (not .cse5)))) (or (and (= 0 ~s_run_pc~0) .cse19) (and (<= 2 ~s_run_pc~0) .cse19))) .cse13 .cse15 .cse4 .cse16 .cse6) .cse10 .cse11 .cse1 .cse17 .cse18))) [2019-11-20 00:32:31,623 INFO L444 ceAbstractionStarter]: For program point L964(lines 964 968) no Hoare annotation was computed. [2019-11-20 00:32:31,623 INFO L444 ceAbstractionStarter]: For program point L436(lines 124 470) no Hoare annotation was computed. [2019-11-20 00:32:31,623 INFO L440 ceAbstractionStarter]: At program point L569(lines 562 606) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (and (= 3 ~m_run_pc~0) .cse2 .cse3) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,623 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 441) no Hoare annotation was computed. [2019-11-20 00:32:31,623 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 115) no Hoare annotation was computed. [2019-11-20 00:32:31,623 INFO L444 ceAbstractionStarter]: For program point L1032(lines 1032 1036) no Hoare annotation was computed. [2019-11-20 00:32:31,623 INFO L440 ceAbstractionStarter]: At program point L108(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (<= 3 ~m_run_pc~0) (= ~c_empty_rsp~0 1)) [2019-11-20 00:32:31,623 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 954) no Hoare annotation was computed. [2019-11-20 00:32:31,623 INFO L440 ceAbstractionStarter]: At program point L769(lines 762 797) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,624 INFO L440 ceAbstractionStarter]: At program point L703(lines 696 713) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,624 INFO L444 ceAbstractionStarter]: For program point L571(lines 571 575) no Hoare annotation was computed. [2019-11-20 00:32:31,624 INFO L447 ceAbstractionStarter]: At program point L1364(lines 1341 1366) the Hoare annotation is: true [2019-11-20 00:32:31,624 INFO L440 ceAbstractionStarter]: At program point L307(lines 277 308) the Hoare annotation is: (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,624 INFO L444 ceAbstractionStarter]: For program point L902(lines 902 906) no Hoare annotation was computed. [2019-11-20 00:32:31,624 INFO L444 ceAbstractionStarter]: For program point L704(lines 475 827) no Hoare annotation was computed. [2019-11-20 00:32:31,624 INFO L440 ceAbstractionStarter]: At program point L1233(lines 1226 1243) the Hoare annotation is: (let ((.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) .cse3 .cse4))) [2019-11-20 00:32:31,624 INFO L444 ceAbstractionStarter]: For program point L1167-1(lines 1160 1339) no Hoare annotation was computed. [2019-11-20 00:32:31,624 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 114) no Hoare annotation was computed. [2019-11-20 00:32:31,625 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 775) no Hoare annotation was computed. [2019-11-20 00:32:31,625 INFO L444 ceAbstractionStarter]: For program point L705(lines 705 709) no Hoare annotation was computed. [2019-11-20 00:32:31,625 INFO L440 ceAbstractionStarter]: At program point L375(lines 368 385) the Hoare annotation is: (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,625 INFO L440 ceAbstractionStarter]: At program point L243(lines 236 253) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse22 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse18 (and (<= ~m_run_pc~0 0) .cse2 .cse1)) (.cse17 (and (= 3 ~m_run_pc~0) .cse1 .cse2)) (.cse23 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse4 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (<= ~c_req_type~0 1)) (.cse5 (<= ~c_req_d~0 50)) (.cse6 (<= 50 ~c_req_d~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse0 (= ~s_run_pc~0 2)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (and .cse14 .cse15 .cse19 .cse20 (and .cse16 .cse22 (or .cse18 .cse17)) .cse23 .cse21)) (.cse3 (<= 2 ~s_run_st~0)) (.cse10 (= 0 ~s_run_pc~0))) (or (and (and (not .cse0) .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse7 .cse9 .cse5 .cse6 .cse3 .cse11 .cse12 .cse0 (and .cse14 .cse15 (and .cse16 (or .cse17 .cse18)) .cse19 .cse20 .cse21) .cse22 .cse13 .cse23) (and .cse8 .cse3 .cse10))))) [2019-11-20 00:32:31,625 INFO L440 ceAbstractionStarter]: At program point L111(lines 91 833) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1))) (let ((.cse5 (= 0 ~c_req_type~0)) (.cse7 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse8 (= 0 ~c_req_a~0)) (.cse11 (= ~req_tt_a~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse2 (= ~s_run_pc~0 2)) (.cse13 (and .cse1 .cse3)) (.cse4 (<= 0 ~a_t~0)) (.cse6 (= 6 ~m_run_pc~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 (<= 2 ~s_run_pc~0) .cse1 (not .cse2) (<= 3 ~m_run_pc~0) .cse3) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse4 (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse5 (= ~s_memory0~0 50) .cse6 .cse7 (= 50 ULTIMATE.start_s_run_~rsp_d~1) .cse8 .cse9 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse10 .cse0 .cse11 (= 50 ~c_rsp_d~0) .cse12 .cse2 .cse1) (and .cse4 .cse5 .cse6 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse7 (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse8 .cse10 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse11 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse12 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse10 .cse4 (and .cse9 .cse1 .cse3) .cse0 .cse6 .cse2) (and (and .cse10 .cse0 .cse2 .cse13) .cse4 .cse6 .cse12)))) [2019-11-20 00:32:31,625 INFO L444 ceAbstractionStarter]: For program point L376(lines 368 385) no Hoare annotation was computed. [2019-11-20 00:32:31,625 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,626 INFO L444 ceAbstractionStarter]: For program point L244(lines 124 470) no Hoare annotation was computed. [2019-11-20 00:32:31,626 INFO L444 ceAbstractionStarter]: For program point L1235(lines 1235 1239) no Hoare annotation was computed. [2019-11-20 00:32:31,626 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-11-20 00:32:31,626 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 249) no Hoare annotation was computed. [2019-11-20 00:32:31,626 INFO L440 ceAbstractionStarter]: At program point L1038(lines 1031 1075) the Hoare annotation is: (let ((.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= 1 ~c_req_type~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse14 (= 3 ~m_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse5 (= ~s_run_pc~0 2)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (<= ~c_req_type~0 1)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 .cse4 .cse5 .cse6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 (and .cse12 .cse3 .cse0 .cse13 (and .cse14 .cse2) .cse15 .cse4 .cse5 .cse16 .cse6) .cse17 .cse18) (and .cse7 .cse8 .cse9 (and .cse12 .cse3 .cse0 (let ((.cse19 (and .cse14 .cse2 (not .cse5)))) (or (and (= 0 ~s_run_pc~0) .cse19) (and (<= 2 ~s_run_pc~0) .cse19))) .cse13 .cse15 .cse4 .cse16 .cse6) .cse10 .cse11 .cse1 .cse17 .cse18))) [2019-11-20 00:32:31,626 INFO L440 ceAbstractionStarter]: At program point L577(lines 570 605) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,626 INFO L444 ceAbstractionStarter]: For program point L1040(lines 1040 1044) no Hoare annotation was computed. [2019-11-20 00:32:31,627 INFO L440 ceAbstractionStarter]: At program point L908(lines 901 954) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse0 .cse1 (<= ~c_req_type~0 1) (let ((.cse2 (= 3 ~m_run_pc~0)) (.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse6 (<= 1 ~c_req_type~0)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_type~1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~s_run_pc~0) .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~s_run_pc~0) .cse8 .cse9 .cse10))) .cse11 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse12) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (and .cse1 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse8 (= 0 ~c_req_a~0) (and .cse5 .cse9 .cse10) .cse0 .cse11 (= ~s_run_pc~0 2) .cse12) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2019-11-20 00:32:31,627 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 367) no Hoare annotation was computed. [2019-11-20 00:32:31,627 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1177) no Hoare annotation was computed. [2019-11-20 00:32:31,627 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 989) no Hoare annotation was computed. [2019-11-20 00:32:31,627 INFO L440 ceAbstractionStarter]: At program point L777(lines 770 796) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,627 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 583) no Hoare annotation was computed. [2019-11-20 00:32:31,627 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2019-11-20 00:32:31,627 INFO L444 ceAbstractionStarter]: For program point L910(lines 910 914) no Hoare annotation was computed. [2019-11-20 00:32:31,627 INFO L440 ceAbstractionStarter]: At program point L514(lines 484 515) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 2))) (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse2 (not .cse5)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse3 .cse4) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)))))) [2019-11-20 00:32:31,627 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 783) no Hoare annotation was computed. [2019-11-20 00:32:31,628 INFO L444 ceAbstractionStarter]: For program point L1308(lines 1308 1312) no Hoare annotation was computed. [2019-11-20 00:32:31,628 INFO L444 ceAbstractionStarter]: For program point L1110(lines 1109 1150) no Hoare annotation was computed. [2019-11-20 00:32:31,628 INFO L444 ceAbstractionStarter]: For program point L451(lines 451 455) no Hoare annotation was computed. [2019-11-20 00:32:31,628 INFO L440 ceAbstractionStarter]: At program point L121(lines 91 833) the Hoare annotation is: (let ((.cse3 (= 0 ~s_run_pc~0)) (.cse1 (<= ~m_run_pc~0 0)) (.cse8 (<= 0 ~a_t~0)) (.cse9 (= 0 ~c_req_type~0)) (.cse7 (<= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse10 (= 0 ~c_req_a~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse5 (not (= ~s_run_pc~0 2)) .cse6) (and .cse8 .cse1 .cse9 .cse3 .cse6 .cse10 .cse0 .cse11 .cse4 .cse5) (and .cse1 .cse8 .cse9 .cse7 .cse6 .cse10 .cse0 .cse11 .cse2 .cse4 .cse5))) [2019-11-20 00:32:31,628 INFO L440 ceAbstractionStarter]: At program point L1046(lines 1039 1074) the Hoare annotation is: (let ((.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= 1 ~c_req_type~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse14 (= 3 ~m_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse5 (= ~s_run_pc~0 2)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (<= ~c_req_type~0 1)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 .cse4 .cse5 .cse6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 (and .cse12 .cse3 .cse0 .cse13 (and .cse14 .cse2) .cse15 .cse4 .cse5 .cse16 .cse6) .cse17 .cse18) (and .cse7 .cse8 .cse9 (and .cse12 .cse3 .cse0 (let ((.cse19 (and .cse14 .cse2 (not .cse5)))) (or (and (= 0 ~s_run_pc~0) .cse19) (and (<= 2 ~s_run_pc~0) .cse19))) .cse13 .cse15 .cse4 .cse16 .cse6) .cse10 .cse11 .cse1 .cse17 .cse18))) [2019-11-20 00:32:31,628 INFO L440 ceAbstractionStarter]: At program point L518-2(lines 518 546) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 2))) (let ((.cse2 (not .cse5)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (<= 2 ~s_run_pc~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse3 .cse4) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) .cse0 .cse1)))) [2019-11-20 00:32:31,628 INFO L440 ceAbstractionStarter]: At program point L1179(lines 1172 1225) the Hoare annotation is: (let ((.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) .cse3 .cse4))) [2019-11-20 00:32:31,628 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 59) no Hoare annotation was computed. [2019-11-20 00:32:31,628 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 988) no Hoare annotation was computed. [2019-11-20 00:32:31,628 INFO L440 ceAbstractionStarter]: At program point L585(lines 578 604) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,628 INFO L444 ceAbstractionStarter]: For program point L519(lines 518 546) no Hoare annotation was computed. [2019-11-20 00:32:31,629 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-11-20 00:32:31,629 INFO L440 ceAbstractionStarter]: At program point L387-1(lines 387 393) the Hoare annotation is: (let ((.cse3 (<= 2 ~s_run_pc~0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse0 (<= 2 ~c_write_rsp_ev~0))) (or (and (and .cse0 (not (= ~s_run_pc~0 2)) .cse1) .cse2 .cse3) (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse3 (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,629 INFO L440 ceAbstractionStarter]: At program point L321(lines 314 367) the Hoare annotation is: (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,629 INFO L444 ceAbstractionStarter]: For program point L1246(line 1246) no Hoare annotation was computed. [2019-11-20 00:32:31,629 INFO L444 ceAbstractionStarter]: For program point L1114(lines 1114 1118) no Hoare annotation was computed. [2019-11-20 00:32:31,629 INFO L444 ceAbstractionStarter]: For program point L1114-1(lines 1109 1150) no Hoare annotation was computed. [2019-11-20 00:32:31,629 INFO L444 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2019-11-20 00:32:31,629 INFO L440 ceAbstractionStarter]: At program point L916(lines 909 953) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse0 .cse1 (<= ~c_req_type~0 1) (let ((.cse2 (= 3 ~m_run_pc~0)) (.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse6 (<= 1 ~c_req_type~0)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_type~1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~s_run_pc~0) .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~s_run_pc~0) .cse8 .cse9 .cse10))) .cse11 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse12) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (and .cse1 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse8 (= 0 ~c_req_a~0) (and .cse5 .cse9 .cse10) .cse0 .cse11 (= ~s_run_pc~0 2) .cse12) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2019-11-20 00:32:31,629 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-11-20 00:32:31,629 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:32:31,630 INFO L444 ceAbstractionStarter]: For program point L1181(lines 1181 1185) no Hoare annotation was computed. [2019-11-20 00:32:31,630 INFO L440 ceAbstractionStarter]: At program point L124-2(lines 124 470) the Hoare annotation is: (let ((.cse3 (= ~s_run_pc~0 2))) (let ((.cse0 (<= 0 ~a_t~0)) (.cse11 (= 0 ~c_req_type~0)) (.cse13 (= 0 ~c_req_a~0)) (.cse14 (= ULTIMATE.start_m_run_~a~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 2 ~s_run_pc~0)) (.cse8 (not .cse3)) (.cse15 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse4 (= ~c_empty_req~0 1)) (.cse10 (<= ~m_run_pc~0 0)) (.cse2 (<= 2 ~s_run_st~0)) (.cse12 (= 0 ~s_run_pc~0)) (.cse5 (<= ~c_m_lock~0 0)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse16 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= 1 ~c_req_type~0) .cse0 (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) .cse1 .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (and (= 3 ~m_run_pc~0) .cse4 .cse5 .cse6 .cse7) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse2 (and .cse5 .cse6 .cse8 .cse7) .cse9) (and .cse0 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse4 .cse1 .cse5 .cse6) (and .cse0 .cse10 .cse11 .cse9 .cse7 .cse13 .cse14 .cse4 .cse1 .cse2 .cse5 .cse6) (and .cse15 .cse2 .cse9 .cse6 .cse8 .cse7 .cse16) (and (<= ~c_req_a~0 0) .cse15 (<= 0 ~c_req_a~0) .cse4 .cse10 .cse2 .cse12 .cse5 .cse6 .cse7 .cse16)))) [2019-11-20 00:32:31,630 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 863) no Hoare annotation was computed. [2019-11-20 00:32:31,630 INFO L440 ceAbstractionStarter]: At program point L785(lines 778 795) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,630 INFO L444 ceAbstractionStarter]: For program point L719(lines 719 723) no Hoare annotation was computed. [2019-11-20 00:32:31,630 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 591) no Hoare annotation was computed. [2019-11-20 00:32:31,630 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-20 00:32:31,631 INFO L440 ceAbstractionStarter]: At program point L1314(lines 1307 1324) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse34 (= 3 ~m_run_pc~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse12 (and .cse7 .cse8)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (<= ~m_run_pc~0 0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse16 (<= ~c_req_d~0 50)) (.cse17 (<= 50 ~c_req_d~0)) (.cse18 (<= ~c_req_type~0 1)) (.cse28 (= ~req_tt_a~0 0)) (.cse20 (= 0 ~c_req_type~0)) (.cse26 (= 0 ~c_req_a~0)) (.cse9 (<= 0 ~a_t~0)) (.cse10 (= 6 ~m_run_pc~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse19 (and .cse0 .cse1 (and .cse34 .cse33 .cse7 .cse8))) (.cse5 (= 0 ~s_run_pc~0)) (.cse32 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse14 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 (and (and .cse4 .cse12) .cse13 .cse14) .cse15) (and .cse16 .cse17 (and .cse13 .cse9 .cse18 .cse19 .cse11 .cse14 .cse15)) (and .cse9 .cse20 .cse12 .cse10 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse29 .cse11 .cse14 .cse30 .cse15 .cse31) (and .cse4 .cse32 (and .cse7 (not .cse14) .cse8)) (and .cse9 .cse3 .cse20 .cse8 .cse26 .cse2 .cse13 .cse4 .cse14 .cse6 .cse7) (and .cse16 .cse17 (and .cse33 .cse13 .cse9 .cse4 .cse27 .cse18 .cse11 .cse14 (and .cse34 .cse2 .cse7) .cse23 .cse15) .cse29 .cse21 .cse30 .cse22 .cse24 .cse31) (and .cse10 (and .cse13 .cse9 (and .cse2 .cse4 .cse32 .cse7 .cse8) .cse15)) (and .cse9 .cse3 .cse20 .cse5 .cse8 .cse26 .cse2 .cse13 .cse6 .cse7) (and .cse16 .cse17 (and .cse13 .cse9 .cse18 .cse19 .cse5 .cse11 .cse15)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) .cse20 (and .cse26 (and .cse13 .cse9 .cse10 .cse11 .cse14 (and .cse4 (and .cse2 .cse7)) .cse15) .cse22)) .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse4 .cse19 .cse5) (and .cse32 (and .cse34 .cse2 .cse7 .cse8)) (and (and .cse34 .cse7 .cse8) .cse13 .cse4 .cse14)))) [2019-11-20 00:32:31,631 INFO L444 ceAbstractionStarter]: For program point L125(lines 124 470) no Hoare annotation was computed. [2019-11-20 00:32:31,634 INFO L444 ceAbstractionStarter]: For program point L918(lines 918 922) no Hoare annotation was computed. [2019-11-20 00:32:31,634 INFO L444 ceAbstractionStarter]: For program point L786(lines 475 827) no Hoare annotation was computed. [2019-11-20 00:32:31,634 INFO L444 ceAbstractionStarter]: For program point L1315(lines 1245 1334) no Hoare annotation was computed. [2019-11-20 00:32:31,634 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 130) no Hoare annotation was computed. [2019-11-20 00:32:31,634 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-11-20 00:32:31,635 INFO L440 ceAbstractionStarter]: At program point L457(lines 450 467) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,635 INFO L444 ceAbstractionStarter]: For program point L1316(lines 1316 1320) no Hoare annotation was computed. [2019-11-20 00:32:31,635 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 263) no Hoare annotation was computed. [2019-11-20 00:32:31,635 INFO L440 ceAbstractionStarter]: At program point L61(lines 52 62) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 6 ~m_run_pc~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (= ULTIMATE.start_s_memory_read_~i 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,635 INFO L444 ceAbstractionStarter]: For program point L854(lines 854 862) no Hoare annotation was computed. [2019-11-20 00:32:31,635 INFO L444 ceAbstractionStarter]: For program point L458(lines 450 467) no Hoare annotation was computed. [2019-11-20 00:32:31,636 INFO L440 ceAbstractionStarter]: At program point L855(lines 850 1101) the Hoare annotation is: false [2019-11-20 00:32:31,636 INFO L440 ceAbstractionStarter]: At program point L657(lines 627 658) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,636 INFO L444 ceAbstractionStarter]: For program point L459(lines 459 463) no Hoare annotation was computed. [2019-11-20 00:32:31,636 INFO L440 ceAbstractionStarter]: At program point L1120(lines 1109 1150) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse35 (= 3 ~m_run_pc~0)) (.cse34 (<= 1 ~c_req_type~0)) (.cse8 (<= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1))) (let ((.cse29 (= ~req_tt_a~0 0)) (.cse26 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse10 (<= ~c_req_d~0 50)) (.cse28 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse14 (<= ~c_req_type~0 1)) (.cse24 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse11 (<= 50 ~c_req_d~0)) (.cse30 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse22 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse23 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse25 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse32 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse20 (and .cse8 .cse9)) (.cse21 (= 6 ~m_run_pc~0)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse18 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse15 (and .cse0 .cse1 (and .cse35 .cse34 .cse8 .cse9))) (.cse5 (= 0 ~s_run_pc~0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse13 (<= 0 ~a_t~0)) (.cse19 (= 0 ~c_req_type~0)) (.cse33 (<= 2 ~s_run_pc~0)) (.cse27 (= 0 ~c_req_a~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse6 (<= ~c_m_lock~0 0)) (.cse7 (= ~m_run_st~0 0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse17 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (and .cse13 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse29 .cse30 .cse16 .cse17 .cse31 .cse18 .cse32) (and .cse4 .cse33 (and .cse8 (not .cse17) .cse9)) (and .cse13 .cse3 .cse19 .cse5 .cse9 .cse27 .cse2 .cse12 .cse6 .cse8) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (and (and .cse27 (and .cse12 .cse13 .cse4 (and .cse2 .cse7 .cse8) .cse21 .cse16 .cse17 .cse18) .cse23) (= ULTIMATE.start_s_run_~req_type~1 0) .cse19) .cse29 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse26 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse5 .cse16 .cse18)) (and .cse10 (and .cse34 .cse12 .cse13 .cse4 .cse28 .cse14 .cse16 .cse17 (and .cse35 .cse2 .cse7 .cse8) .cse24 .cse18) .cse11 .cse30 .cse22 .cse31 .cse23 .cse25 .cse32) (and .cse21 (and .cse2 .cse12 .cse13 .cse4 .cse17 .cse8 .cse9 .cse18)) (and (and .cse12 .cse4 .cse20 .cse17) .cse13 .cse21 .cse16 .cse18) (and .cse4 .cse15 .cse5) (and .cse33 (and .cse35 .cse2 .cse8 .cse9)) (and .cse3 .cse13 .cse19 .cse33 .cse9 .cse27 .cse2 .cse12 .cse4 .cse6 .cse7 .cse8) (and (and .cse35 .cse8 .cse9) .cse12 .cse4 .cse17)))) [2019-11-20 00:32:31,637 INFO L440 ceAbstractionStarter]: At program point L1054(lines 1047 1073) the Hoare annotation is: (let ((.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= 1 ~c_req_type~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse14 (= 3 ~m_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse5 (= ~s_run_pc~0 2)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (<= ~c_req_type~0 1)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 .cse4 .cse5 .cse6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 (and .cse12 .cse3 .cse0 .cse13 (and .cse14 .cse2) .cse15 .cse4 .cse5 .cse16 .cse6) .cse17 .cse18) (and .cse7 .cse8 .cse9 (and .cse12 .cse3 .cse0 (let ((.cse19 (and .cse14 .cse2 (not .cse5)))) (or (and (= 0 ~s_run_pc~0) .cse19) (and (<= 2 ~s_run_pc~0) .cse19))) .cse13 .cse15 .cse4 .cse16 .cse6) .cse10 .cse11 .cse1 .cse17 .cse18))) [2019-11-20 00:32:31,637 INFO L444 ceAbstractionStarter]: For program point L1253(lines 1253 1306) no Hoare annotation was computed. [2019-11-20 00:32:31,637 INFO L440 ceAbstractionStarter]: At program point L1187(lines 1180 1224) the Hoare annotation is: (let ((.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) .cse3 .cse4))) [2019-11-20 00:32:31,637 INFO L444 ceAbstractionStarter]: For program point L857(lines 857 861) no Hoare annotation was computed. [2019-11-20 00:32:31,638 INFO L440 ceAbstractionStarter]: At program point L725(lines 718 735) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,638 INFO L440 ceAbstractionStarter]: At program point L593(lines 586 603) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (= ~s_run_pc~0 2))) (or (and .cse0 (<= 2 ~s_run_pc~0) (and (not .cse1) .cse2 .cse3)) (and (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) (or (and (= 3 ~m_run_pc~0) .cse2 .cse3) (and (<= ~m_run_pc~0 0) .cse3 .cse2)) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,638 INFO L440 ceAbstractionStarter]: At program point L329(lines 322 366) the Hoare annotation is: (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,638 INFO L444 ceAbstractionStarter]: For program point L1254(lines 1254 1258) no Hoare annotation was computed. [2019-11-20 00:32:31,639 INFO L440 ceAbstractionStarter]: At program point L197(lines 167 198) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= 0 ~a_t~0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse2 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse17 (= 0 ~s_run_pc~0)) (.cse7 (= 0 ~c_req_a~0)) (.cse8 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse13 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse14 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse16 (<= 0 ULTIMATE.start_m_run_~req_a~0)) (.cse10 (<= 2 ~s_run_st~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse2 .cse10 .cse17 .cse13 .cse15 .cse6 (<= 0 ULTIMATE.start_m_run_~a~0) .cse16) (and .cse0 .cse1 .cse3 .cse2 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse10 (and (not (= ~s_run_pc~0 2)) .cse6 .cse15) .cse5))) [2019-11-20 00:32:31,639 INFO L444 ceAbstractionStarter]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2019-11-20 00:32:31,639 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:32:31,639 INFO L440 ceAbstractionStarter]: At program point L924(lines 917 952) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse0 .cse1 (<= ~c_req_type~0 1) (let ((.cse2 (= 3 ~m_run_pc~0)) (.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse6 (<= 1 ~c_req_type~0)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_type~1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~s_run_pc~0) .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~s_run_pc~0) .cse8 .cse9 .cse10))) .cse11 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse12) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (and .cse1 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse8 (= 0 ~c_req_a~0) (and .cse5 .cse9 .cse10) .cse0 .cse11 (= ~s_run_pc~0 2) .cse12) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2019-11-20 00:32:31,640 INFO L440 ceAbstractionStarter]: At program point L858(lines 850 1101) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 0 ~a_t~0)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse0 (= 3 ~m_run_pc~0)) (.cse1 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (and .cse0 (= ~c_empty_req~0 1) .cse1 .cse2) (<= 2 ~s_run_pc~0)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse3 (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 6 ~m_run_pc~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) .cse4 (= ~req_tt_a~0 0) .cse5 .cse6 (and .cse1 .cse2) .cse7) (and (<= ~c_req_d~0 50) (and .cse4 .cse3 (<= ~c_req_type~0 1) .cse5 .cse6 (and .cse0 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) (<= 1 ~c_req_type~0) .cse1 .cse2) .cse7) (<= 50 ~c_req_d~0)))) [2019-11-20 00:32:31,640 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,640 INFO L444 ceAbstractionStarter]: For program point L726(lines 718 735) no Hoare annotation was computed. [2019-11-20 00:32:31,640 INFO L444 ceAbstractionStarter]: For program point L594(lines 475 827) no Hoare annotation was computed. [2019-11-20 00:32:31,640 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 449) no Hoare annotation was computed. [2019-11-20 00:32:31,640 INFO L444 ceAbstractionStarter]: For program point L1189(lines 1189 1193) no Hoare annotation was computed. [2019-11-20 00:32:31,640 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 69) no Hoare annotation was computed. [2019-11-20 00:32:31,641 INFO L444 ceAbstractionStarter]: For program point L991-1(lines 866 1096) no Hoare annotation was computed. [2019-11-20 00:32:31,641 INFO L444 ceAbstractionStarter]: For program point L727(lines 727 731) no Hoare annotation was computed. [2019-11-20 00:32:31,641 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 599) no Hoare annotation was computed. [2019-11-20 00:32:31,641 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-11-20 00:32:31,641 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 335) no Hoare annotation was computed. [2019-11-20 00:32:31,641 INFO L440 ceAbstractionStarter]: At program point L265(lines 258 275) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~s_run_pc~0 2)) (.cse3 (= ~c_empty_rsp~0 1))) (let ((.cse6 (and .cse4 (not .cse5) .cse3))) (let ((.cse0 (and (<= ~c_req_a~0 0) (<= ULTIMATE.start_m_run_~a~0 0) (<= 0 ~c_req_a~0) (<= ULTIMATE.start_m_run_~req_a~0 0) (and .cse6 (<= 1 ~c_req_type~0) (<= 1 ULTIMATE.start_m_run_~req_type~0)) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ULTIMATE.start_m_run_~req_a~0))) (.cse2 (= 0 ~s_run_pc~0)) (.cse1 (<= 2 ~s_run_st~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 (and .cse3 .cse4) .cse5) (and (<= ULTIMATE.start_m_run_~req_d~0 50) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 0 ~a_t~0) .cse0 (<= ~c_req_type~0 1) .cse2 (<= ULTIMATE.start_m_run_~req_type~0 1) (<= 1 ~c_m_lock~0) (<= 50 ULTIMATE.start_m_run_~req_d~0)) (and .cse1 (<= 2 ~s_run_pc~0) .cse6))))) [2019-11-20 00:32:31,642 INFO L444 ceAbstractionStarter]: For program point L1124(lines 1124 1131) no Hoare annotation was computed. [2019-11-20 00:32:31,642 INFO L444 ceAbstractionStarter]: For program point L992(lines 991 1015) no Hoare annotation was computed. [2019-11-20 00:32:31,642 INFO L444 ceAbstractionStarter]: For program point L926(lines 926 930) no Hoare annotation was computed. [2019-11-20 00:32:31,642 INFO L444 ceAbstractionStarter]: For program point L266(lines 258 275) no Hoare annotation was computed. [2019-11-20 00:32:31,642 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 997) no Hoare annotation was computed. [2019-11-20 00:32:31,642 INFO L444 ceAbstractionStarter]: For program point L267(lines 267 271) no Hoare annotation was computed. [2019-11-20 00:32:31,643 INFO L440 ceAbstractionStarter]: At program point L135-2(lines 135 163) the Hoare annotation is: (let ((.cse11 (<= 2 ~s_run_st~0)) (.cse5 (<= 2 ~s_run_pc~0)) (.cse0 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ~m_run_pc~0 0)) (.cse4 (= 0 ~c_req_type~0)) (.cse18 (= 0 ~s_run_pc~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= 0 ~c_req_a~0)) (.cse8 (= ~c_empty_req~0 1)) (.cse9 (= ULTIMATE.start_m_run_~a~0 0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse13 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse14 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse15 (<= ~c_m_lock~0 0)) (.cse16 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse3 .cse1 .cse18 .cse6 (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse8 .cse11 .cse13 .cse15 .cse16 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17) (and .cse11 .cse5 .cse16 (not (= ~s_run_pc~0 2)) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2019-11-20 00:32:31,643 INFO L444 ceAbstractionStarter]: For program point L664(lines 664 717) no Hoare annotation was computed. [2019-11-20 00:32:31,643 INFO L444 ceAbstractionStarter]: For program point L136(lines 135 163) no Hoare annotation was computed. [2019-11-20 00:32:31,643 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 669) no Hoare annotation was computed. [2019-11-20 00:32:31,643 INFO L440 ceAbstractionStarter]: At program point L1260(lines 1253 1306) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse34 (= 3 ~m_run_pc~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse28 (= ~req_tt_a~0 0)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (<= ~m_run_pc~0 0)) (.cse18 (= 0 ~c_req_type~0)) (.cse26 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse19 (and .cse7 .cse8)) (.cse12 (<= 0 ~a_t~0)) (.cse20 (= 6 ~m_run_pc~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (and .cse0 .cse1 (and .cse34 .cse33 .cse7 .cse8))) (.cse5 (= 0 ~s_run_pc~0)) (.cse32 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse28 .cse29 .cse15 .cse16 .cse30 .cse17 .cse31) (and .cse4 .cse32 (and .cse7 (not .cse16) .cse8)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (and .cse11 .cse12 .cse4 (and .cse2 .cse7) .cse20 .cse15 .cse16 .cse17) .cse26 .cse22) (= ULTIMATE.start_s_run_~req_type~1 0) .cse18) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse12 .cse3 .cse18 .cse8 .cse26 .cse2 .cse11 .cse4 .cse16 .cse6 .cse7) (and .cse9 .cse10 (and .cse33 .cse11 .cse12 .cse4 .cse27 .cse13 .cse15 .cse16 (and .cse34 .cse2 .cse7) .cse23 .cse17) .cse29 .cse21 .cse30 .cse22 .cse24 .cse31) (and .cse12 .cse3 .cse18 .cse5 .cse8 .cse26 .cse2 .cse11 .cse6 .cse7) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17)) (and .cse20 (and .cse2 .cse11 .cse12 .cse4 .cse16 .cse7 .cse8 .cse17)) (and (and .cse11 .cse4 .cse19 .cse16) .cse12 .cse20 .cse15 .cse17) (and .cse4 .cse14 .cse5) (and .cse32 (and .cse34 .cse2 .cse7 .cse8)) (and (and .cse34 .cse7 .cse8) .cse11 .cse4 .cse16)))) [2019-11-20 00:32:31,644 INFO L444 ceAbstractionStarter]: For program point L137(lines 137 141) no Hoare annotation was computed. [2019-11-20 00:32:31,644 INFO L440 ceAbstractionStarter]: At program point L1062(lines 1055 1072) the Hoare annotation is: (let ((.cse7 (<= ~c_req_d~0 50)) (.cse8 (<= 50 ~c_req_d~0)) (.cse9 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (<= 1 ~c_req_type~0)) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse14 (= 3 ~m_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse5 (= ~s_run_pc~0 2)) (.cse13 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse15 (<= ~c_req_type~0 1)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse16 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse10 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse11 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse18 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and .cse0 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse1 .cse2 (= 0 ~c_req_a~0) .cse3 .cse4 .cse5 .cse6) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 (and .cse12 .cse3 .cse0 .cse13 (and .cse14 .cse2) .cse15 .cse4 .cse5 .cse16 .cse6) .cse17 .cse18) (and .cse7 .cse8 .cse9 (and .cse12 .cse3 .cse0 (let ((.cse19 (and .cse14 .cse2 (not .cse5)))) (or (and (= 0 ~s_run_pc~0) .cse19) (and (<= 2 ~s_run_pc~0) .cse19))) .cse13 .cse15 .cse4 .cse16 .cse6) .cse10 .cse11 .cse1 .cse17 .cse18))) [2019-11-20 00:32:31,644 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 257) no Hoare annotation was computed. [2019-11-20 00:32:31,644 INFO L440 ceAbstractionStarter]: At program point L1195(lines 1188 1223) the Hoare annotation is: (let ((.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) .cse3 .cse4))) [2019-11-20 00:32:31,645 INFO L444 ceAbstractionStarter]: For program point L1063(lines 866 1096) no Hoare annotation was computed. [2019-11-20 00:32:31,645 INFO L440 ceAbstractionStarter]: At program point L403(lines 396 449) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,645 INFO L440 ceAbstractionStarter]: At program point L337(lines 330 365) the Hoare annotation is: (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,645 INFO L444 ceAbstractionStarter]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2019-11-20 00:32:31,645 INFO L444 ceAbstractionStarter]: For program point L1328-1(lines 1160 1339) no Hoare annotation was computed. [2019-11-20 00:32:31,645 INFO L444 ceAbstractionStarter]: For program point L1262(lines 1262 1266) no Hoare annotation was computed. [2019-11-20 00:32:31,646 INFO L444 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2019-11-20 00:32:31,646 INFO L444 ceAbstractionStarter]: For program point L1064(lines 1064 1068) no Hoare annotation was computed. [2019-11-20 00:32:31,646 INFO L440 ceAbstractionStarter]: At program point L932(lines 925 951) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse0 .cse1 (<= ~c_req_type~0 1) (let ((.cse2 (= 3 ~m_run_pc~0)) (.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse6 (<= 1 ~c_req_type~0)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_type~1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~s_run_pc~0) .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~s_run_pc~0) .cse8 .cse9 .cse10))) .cse11 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse12) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (and .cse1 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse8 (= 0 ~c_req_a~0) (and .cse5 .cse9 .cse10) .cse0 .cse11 (= ~s_run_pc~0 2) .cse12) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2019-11-20 00:32:31,646 INFO L440 ceAbstractionStarter]: At program point L866-1(lines 850 1101) the Hoare annotation is: (let ((.cse8 (<= ~c_req_d~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse11 (<= ~c_req_type~0 1)) (.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse10 (<= 1 ~c_req_type~0)) (.cse2 (= 0 ~c_req_type~0)) (.cse15 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse17 (= ~s_run_pc~0 2)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse13 (= 3 ~m_run_pc~0)) (.cse5 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse16 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 (<= ~m_run_pc~0 0) (<= ~c_m_lock~0 0) .cse6 .cse7)) (and .cse8 .cse9 (and .cse10 .cse0 .cse1 (<= 1 ULTIMATE.start_s_run_~req_type~1) .cse11 .cse12 (and .cse13 .cse5 .cse6) (<= ULTIMATE.start_s_run_~req_type~1 1) .cse14) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse8 .cse9 (and .cse0 .cse1 .cse11 .cse12 (or (and .cse13 .cse3 .cse4 .cse10 .cse16 .cse6 (not .cse17) .cse7) (and .cse13 .cse3 .cse4 .cse10 (= 0 ~s_run_pc~0) .cse6 .cse7)) .cse14)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) (and (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 (and (= 0 ~c_req_a~0) .cse15 (and .cse0 .cse1 (and .cse5 .cse6) (= 6 ~m_run_pc~0) .cse12 .cse17 .cse14))) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and (and .cse13 .cse5 .cse6 .cse7) .cse16))) [2019-11-20 00:32:31,647 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1201) no Hoare annotation was computed. [2019-11-20 00:32:31,647 INFO L444 ceAbstractionStarter]: For program point L801(lines 801 805) no Hoare annotation was computed. [2019-11-20 00:32:31,647 INFO L440 ceAbstractionStarter]: At program point L471(lines 123 472) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse2 (<= ~c_m_lock~0 0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 1 ULTIMATE.start_m_run_~a~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse2 .cse3 .cse4) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse0 (and .cse2 .cse3 (not .cse1) .cse4) (<= 2 ~s_run_pc~0)))) [2019-11-20 00:32:31,647 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-11-20 00:32:31,647 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 343) no Hoare annotation was computed. [2019-11-20 00:32:31,648 INFO L444 ceAbstractionStarter]: For program point L934(lines 934 938) no Hoare annotation was computed. [2019-11-20 00:32:31,648 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,648 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,648 INFO L444 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,648 INFO L444 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,648 INFO L444 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,648 INFO L444 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,649 INFO L444 ceAbstractionStarter]: For program point L869-1(lines 866 1096) no Hoare annotation was computed. [2019-11-20 00:32:31,649 INFO L444 ceAbstractionStarter]: For program point L737(lines 737 743) no Hoare annotation was computed. [2019-11-20 00:32:31,649 INFO L440 ceAbstractionStarter]: At program point L737-1(lines 737 743) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 6 ~m_run_pc~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,649 INFO L440 ceAbstractionStarter]: At program point L671(lines 664 717) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,649 INFO L440 ceAbstractionStarter]: At program point L11-3(lines 1 1366) the Hoare annotation is: (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 6 ~m_run_pc~0) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (= ULTIMATE.start_s_memory_read_~i 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,650 INFO L440 ceAbstractionStarter]: At program point L11-4(lines 64 72) the Hoare annotation is: (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (let ((.cse0 (= 3 ~m_run_pc~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 (= 0 ~s_run_pc~0) .cse2 .cse3) (and .cse0 .cse1 (<= 2 ~s_run_pc~0) .cse2 .cse3))) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,650 INFO L444 ceAbstractionStarter]: For program point L870(lines 869 893) no Hoare annotation was computed. [2019-11-20 00:32:31,650 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-20 00:32:31,650 INFO L440 ceAbstractionStarter]: At program point L1135(lines 1109 1150) the Hoare annotation is: (let ((.cse32 (<= ~c_req_a~0 0)) (.cse33 (<= 0 ~c_req_a~0)) (.cse30 (= 3 ~m_run_pc~0)) (.cse29 (<= 1 ~c_req_type~0)) (.cse25 (<= 2 ~c_write_rsp_ev~0)) (.cse27 (= ~c_empty_rsp~0 1))) (let ((.cse19 (= ~req_tt_a~0 0)) (.cse16 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse18 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse20 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse13 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse22 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse9 (= 0 ~c_req_type~0)) (.cse17 (= 0 ~c_req_a~0)) (.cse10 (and .cse25 .cse27)) (.cse11 (= 6 ~m_run_pc~0)) (.cse26 (<= ~m_run_pc~0 0)) (.cse28 (<= ~c_m_lock~0 0)) (.cse7 (= ~s_run_pc~0 2)) (.cse0 (<= ~c_req_d~0 50)) (.cse1 (<= 50 ~c_req_d~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (<= 0 ~a_t~0)) (.cse4 (<= ~c_req_type~0 1)) (.cse6 (<= 1 ~c_m_lock~0)) (.cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= 2 ~s_run_st~0)) (.cse5 (and .cse32 .cse33 (and .cse30 .cse29 .cse25 .cse27))) (.cse31 (= 0 ~s_run_pc~0)) (.cse34 (<= 2 ~s_run_pc~0)) (.cse24 (= ~c_empty_req~0 1))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and .cse3 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse2 .cse18 .cse19 .cse20 .cse6 .cse7 .cse21 .cse8 .cse22) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (and .cse2 .cse3 .cse23 (and .cse24 .cse25) .cse11 .cse6 .cse7 .cse8) .cse17 .cse13) (= ULTIMATE.start_s_run_~req_type~1 0) .cse9) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse19 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse16 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse3 .cse26 .cse9 .cse27 .cse17 .cse24 .cse2 .cse23 .cse7 .cse28 .cse25) (and .cse0 .cse1 (and .cse29 .cse2 .cse3 .cse23 .cse18 .cse4 .cse6 .cse7 (and .cse30 .cse24 .cse25) .cse14 .cse8) .cse20 .cse12 .cse21 .cse13 .cse15 .cse22) (and .cse3 .cse26 .cse9 .cse31 .cse27 .cse17 .cse24 .cse2 .cse28 .cse25) (and .cse11 (and .cse24 .cse2 .cse3 .cse23 .cse7 .cse25 .cse27 .cse8)) (and (and .cse2 .cse23 .cse10 .cse7) .cse3 .cse11 .cse6 .cse8) (and (and .cse30 .cse25 .cse27) .cse2 .cse23 .cse7) (and .cse32 .cse33 .cse24 .cse26 .cse23 .cse31 .cse28 .cse25 .cse27) (and .cse23 .cse34 (and .cse25 (not .cse7) .cse27)) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse31 .cse6 .cse8)) (and .cse23 .cse5 .cse31) (and .cse34 (and .cse30 .cse24 .cse25 .cse27))))) [2019-11-20 00:32:31,651 INFO L444 ceAbstractionStarter]: For program point L871(lines 871 875) no Hoare annotation was computed. [2019-11-20 00:32:31,651 INFO L444 ceAbstractionStarter]: For program point L673(lines 673 677) no Hoare annotation was computed. [2019-11-20 00:32:31,651 INFO L440 ceAbstractionStarter]: At program point L475-2(lines 475 827) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 2))) (let ((.cse8 (<= 1 ULTIMATE.start_m_run_~a~0)) (.cse9 (<= 2 ~s_run_pc~0)) (.cse10 (not .cse7)) (.cse1 (<= 0 ~a_t~0)) (.cse6 (<= 2 ~s_run_st~0)) (.cse12 (= 3 ~m_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 (= 6 ~m_run_pc~0) .cse7 .cse8) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse6 .cse9 .cse3 .cse4 .cse10 .cse5 .cse11) (and (and .cse12 .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) .cse1 .cse8) (and .cse6 .cse9 .cse3 .cse4 .cse10 (<= 3 ~m_run_pc~0) .cse5) (and (<= 1 ~c_req_type~0) .cse1 (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse6 (and .cse12 .cse2 .cse3 .cse4 .cse5)) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse7 .cse11 (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-20 00:32:31,652 INFO L440 ceAbstractionStarter]: At program point L1268(lines 1261 1305) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse34 (= 3 ~m_run_pc~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse28 (= ~req_tt_a~0 0)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (<= ~m_run_pc~0 0)) (.cse18 (= 0 ~c_req_type~0)) (.cse26 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse19 (and .cse7 .cse8)) (.cse12 (<= 0 ~a_t~0)) (.cse20 (= 6 ~m_run_pc~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (and .cse0 .cse1 (and .cse34 .cse33 .cse7 .cse8))) (.cse5 (= 0 ~s_run_pc~0)) (.cse32 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse28 .cse29 .cse15 .cse16 .cse30 .cse17 .cse31) (and .cse4 .cse32 (and .cse7 (not .cse16) .cse8)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (and .cse11 .cse12 .cse4 (and .cse2 .cse7) .cse20 .cse15 .cse16 .cse17) .cse26 .cse22) (= ULTIMATE.start_s_run_~req_type~1 0) .cse18) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse12 .cse3 .cse18 .cse8 .cse26 .cse2 .cse11 .cse4 .cse16 .cse6 .cse7) (and .cse9 .cse10 (and .cse33 .cse11 .cse12 .cse4 .cse27 .cse13 .cse15 .cse16 (and .cse34 .cse2 .cse7) .cse23 .cse17) .cse29 .cse21 .cse30 .cse22 .cse24 .cse31) (and .cse12 .cse3 .cse18 .cse5 .cse8 .cse26 .cse2 .cse11 .cse6 .cse7) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17)) (and .cse20 (and .cse2 .cse11 .cse12 .cse4 .cse16 .cse7 .cse8 .cse17)) (and (and .cse11 .cse4 .cse19 .cse16) .cse12 .cse20 .cse15 .cse17) (and .cse4 .cse14 .cse5) (and .cse32 (and .cse34 .cse2 .cse7 .cse8)) (and (and .cse34 .cse7 .cse8) .cse11 .cse4 .cse16)))) [2019-11-20 00:32:31,652 INFO L440 ceAbstractionStarter]: At program point L211(lines 204 257) the Hoare annotation is: (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (<= 1 ~c_req_type~0)) (.cse13 (<= 0 ~a_t~0)) (.cse5 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (<= ~m_run_pc~0 0)) (.cse14 (<= ~c_req_type~0 1)) (.cse7 (= 0 ~s_run_pc~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse8 (<= ~c_req_a~0 0)) (.cse9 (<= 0 ~c_req_a~0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse10 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 (not (= ~s_run_pc~0 2)) .cse2 .cse3) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse0 .cse10 .cse3 (<= 0 ULTIMATE.start_m_run_~a~0) .cse11) (and .cse12 .cse4 .cse13 .cse5 .cse6 .cse14 .cse1 .cse2 .cse15 .cse8 .cse16 .cse9 .cse17 .cse0 .cse18 .cse19 .cse10 .cse20 .cse3 .cse11) (and .cse12 .cse4 .cse13 .cse5 .cse6 .cse14 .cse7 .cse2 .cse15 .cse8 .cse9 .cse16 .cse17 .cse18 .cse19 .cse10 .cse20 .cse3 .cse11))) [2019-11-20 00:32:31,652 INFO L444 ceAbstractionStarter]: For program point L476(lines 475 827) no Hoare annotation was computed. [2019-11-20 00:32:31,652 INFO L447 ceAbstractionStarter]: At program point L1335(lines 1157 1340) the Hoare annotation is: true [2019-11-20 00:32:31,653 INFO L440 ceAbstractionStarter]: At program point L278-2(lines 278 306) the Hoare annotation is: (let ((.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~s_run_pc~0 2)) (.cse13 (= ~c_empty_rsp~0 1))) (let ((.cse16 (<= ~c_req_a~0 0)) (.cse17 (<= 0 ~c_req_a~0)) (.cse19 (and .cse7 (not .cse11) .cse13)) (.cse5 (<= 1 ~c_req_type~0))) (let ((.cse2 (<= ~c_req_d~0 50)) (.cse3 (<= 50 ~c_req_d~0)) (.cse1 (<= ~c_req_type~0 1)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (= 0 ~s_run_pc~0)) (.cse15 (and .cse16 .cse17 (and .cse19 .cse5))) (.cse4 (= 3 ~m_run_pc~0)) (.cse6 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~s_run_st~0)) (.cse18 (<= 2 ~s_run_pc~0))) (or (and .cse0 .cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) .cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse11 .cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and .cse8 .cse9 (and .cse13 .cse7) .cse11) (and .cse2 .cse3 (and .cse8 .cse0 .cse1 .cse14 .cse10 .cse15 .cse12)) (and .cse2 .cse3 (and .cse1 (and .cse8 .cse0 (and .cse16 .cse17 (and .cse5 .cse13 .cse7)) .cse10 .cse11 .cse12))) (and .cse9 .cse14 .cse15) (and (and .cse4 .cse6 .cse7 .cse13) .cse18) (and .cse9 .cse18 .cse19))))) [2019-11-20 00:32:31,653 INFO L440 ceAbstractionStarter]: At program point L1203(lines 1196 1222) the Hoare annotation is: (let ((.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) .cse3 .cse4))) [2019-11-20 00:32:31,653 INFO L440 ceAbstractionStarter]: At program point L807(lines 800 817) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,653 INFO L444 ceAbstractionStarter]: For program point L609(lines 609 613) no Hoare annotation was computed. [2019-11-20 00:32:31,653 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-11-20 00:32:31,654 INFO L440 ceAbstractionStarter]: At program point L411(lines 404 448) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,654 INFO L440 ceAbstractionStarter]: At program point L345(lines 338 364) the Hoare annotation is: (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,654 INFO L444 ceAbstractionStarter]: For program point L279(lines 278 306) no Hoare annotation was computed. [2019-11-20 00:32:31,654 INFO L444 ceAbstractionStarter]: For program point L1270(lines 1270 1274) no Hoare annotation was computed. [2019-11-20 00:32:31,654 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 217) no Hoare annotation was computed. [2019-11-20 00:32:31,655 INFO L440 ceAbstractionStarter]: At program point L940(lines 933 950) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse8 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse5 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (and .cse0 .cse1 (<= ~c_req_type~0 1) (let ((.cse2 (= 3 ~m_run_pc~0)) (.cse3 (<= ~c_req_a~0 0)) (.cse4 (<= 0 ~c_req_a~0)) (.cse6 (<= 1 ~c_req_type~0)) (.cse7 (<= 1 ULTIMATE.start_s_run_~req_type~1))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~s_run_pc~0) .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~s_run_pc~0) .cse8 .cse9 .cse10))) .cse11 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse12) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (and .cse1 (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) .cse8 (= 0 ~c_req_a~0) (and .cse5 .cse9 .cse10) .cse0 .cse11 (= ~s_run_pc~0 2) .cse12) (<= ULTIMATE.start_s_memory_write_~v 50) (= ~req_tt_a~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0)))) [2019-11-20 00:32:31,655 INFO L444 ceAbstractionStarter]: For program point L808(lines 800 817) no Hoare annotation was computed. [2019-11-20 00:32:31,655 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-11-20 00:32:31,655 INFO L444 ceAbstractionStarter]: For program point L1205(lines 1205 1209) no Hoare annotation was computed. [2019-11-20 00:32:31,655 INFO L444 ceAbstractionStarter]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2019-11-20 00:32:31,655 INFO L444 ceAbstractionStarter]: For program point L941(lines 866 1096) no Hoare annotation was computed. [2019-11-20 00:32:31,655 INFO L444 ceAbstractionStarter]: For program point L809(lines 809 813) no Hoare annotation was computed. [2019-11-20 00:32:31,656 INFO L444 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-20 00:32:31,656 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2019-11-20 00:32:31,656 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 946) no Hoare annotation was computed. [2019-11-20 00:32:31,656 INFO L440 ceAbstractionStarter]: At program point L679(lines 672 716) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,656 INFO L440 ceAbstractionStarter]: At program point L547(lines 517 548) the Hoare annotation is: (let ((.cse3 (= ~s_run_pc~0 2))) (let ((.cse2 (<= 2 ~s_run_st~0)) (.cse4 (<= 2 ~s_run_pc~0)) (.cse5 (not .cse3)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (and (= 3 ~m_run_pc~0) .cse0 .cse1) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) .cse2 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse2 .cse4 .cse5 .cse0 .cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (and .cse2 .cse4 (and .cse5 .cse0 .cse1 (<= 3 ~m_run_pc~0)))))) [2019-11-20 00:32:31,657 INFO L444 ceAbstractionStarter]: For program point L746(lines 746 799) no Hoare annotation was computed. [2019-11-20 00:32:31,657 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:32:31,657 INFO L444 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. [2019-11-20 00:32:31,657 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 685) no Hoare annotation was computed. [2019-11-20 00:32:31,657 INFO L440 ceAbstractionStarter]: At program point L615(lines 608 625) the Hoare annotation is: (let ((.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~s_run_pc~0 2)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~s_run_st~0))) (or (and (<= 0 ~a_t~0) .cse0 (<= 1 ~c_m_lock~0) .cse1 (and .cse2 .cse3) (<= 0 ULTIMATE.start_m_run_~a~0)) (and (and .cse3 (not .cse1) .cse2) .cse0 (<= 2 ~s_run_pc~0)))) [2019-11-20 00:32:31,658 INFO L440 ceAbstractionStarter]: At program point L1276(lines 1269 1304) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse34 (= 3 ~m_run_pc~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse28 (= ~req_tt_a~0 0)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (<= ~m_run_pc~0 0)) (.cse18 (= 0 ~c_req_type~0)) (.cse26 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse19 (and .cse7 .cse8)) (.cse12 (<= 0 ~a_t~0)) (.cse20 (= 6 ~m_run_pc~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (and .cse0 .cse1 (and .cse34 .cse33 .cse7 .cse8))) (.cse5 (= 0 ~s_run_pc~0)) (.cse32 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse28 .cse29 .cse15 .cse16 .cse30 .cse17 .cse31) (and .cse4 .cse32 (and .cse7 (not .cse16) .cse8)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (and .cse11 .cse12 .cse4 (and .cse2 .cse7) .cse20 .cse15 .cse16 .cse17) .cse26 .cse22) (= ULTIMATE.start_s_run_~req_type~1 0) .cse18) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse12 .cse3 .cse18 .cse8 .cse26 .cse2 .cse11 .cse4 .cse16 .cse6 .cse7) (and .cse9 .cse10 (and .cse33 .cse11 .cse12 .cse4 .cse27 .cse13 .cse15 .cse16 (and .cse34 .cse2 .cse7) .cse23 .cse17) .cse29 .cse21 .cse30 .cse22 .cse24 .cse31) (and .cse12 .cse3 .cse18 .cse5 .cse8 .cse26 .cse2 .cse11 .cse6 .cse7) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17)) (and .cse20 (and .cse2 .cse11 .cse12 .cse4 .cse16 .cse7 .cse8 .cse17)) (and (and .cse11 .cse4 .cse19 .cse16) .cse12 .cse20 .cse15 .cse17) (and .cse4 .cse14 .cse5) (and .cse32 (and .cse34 .cse2 .cse7 .cse8)) (and (and .cse34 .cse7 .cse8) .cse11 .cse4 .cse16)))) [2019-11-20 00:32:31,658 INFO L440 ceAbstractionStarter]: At program point L219(lines 212 256) the Hoare annotation is: (let ((.cse11 (<= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~s_run_st~0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse0 (<= 1 ~c_req_type~0)) (.cse13 (<= 0 ~a_t~0)) (.cse1 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse2 (<= ~m_run_pc~0 0)) (.cse14 (<= ~c_req_type~0 1)) (.cse3 (= 0 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse15 (<= ~c_req_d~0 50)) (.cse5 (<= ~c_req_a~0 0)) (.cse6 (<= 0 ~c_req_a~0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse17 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse19 (<= 1 ~c_m_lock~0)) (.cse8 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse20 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse9 (<= 2 ~c_write_rsp_ev~0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 ULTIMATE.start_m_run_~a~0) .cse10) (and (and (not (= ~s_run_pc~0 2)) .cse4 .cse9) .cse7 .cse11) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse11 .cse4 .cse15 .cse5 .cse16 .cse6 .cse17 .cse7 .cse18 .cse19 .cse8 .cse20 .cse9 .cse10) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse17 .cse18 .cse19 .cse8 .cse20 .cse9 .cse10))) [2019-11-20 00:32:31,658 INFO L444 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2019-11-20 00:32:31,658 INFO L444 ceAbstractionStarter]: For program point L616(lines 608 625) no Hoare annotation was computed. [2019-11-20 00:32:31,658 INFO L440 ceAbstractionStarter]: At program point L1211(lines 1204 1221) the Hoare annotation is: (let ((.cse1 (<= ~m_run_pc~0 0)) (.cse2 (= 0 ~s_run_pc~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_empty_req~0 1)) (.cse3 (<= ~c_m_lock~0 0)) (.cse4 (<= 2 ~c_write_rsp_ev~0))) (or (and (<= ~c_req_a~0 0) (<= 0 ~c_req_a~0) .cse0 .cse1 (<= 2 ~s_run_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= 0 ~a_t~0) (= 0 ~c_req_type~0) .cse2 .cse5 (= 0 ~c_req_a~0) .cse0 (<= 2 ~c_write_req_ev~0) .cse3 .cse4))) [2019-11-20 00:32:31,659 INFO L444 ceAbstractionStarter]: For program point L617(lines 617 621) no Hoare annotation was computed. [2019-11-20 00:32:31,659 INFO L440 ceAbstractionStarter]: At program point L419(lines 412 447) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,659 INFO L440 ceAbstractionStarter]: At program point L485-2(lines 485 513) the Hoare annotation is: (let ((.cse6 (= ~s_run_pc~0 2))) (let ((.cse1 (<= 2 ~s_run_pc~0)) (.cse3 (not .cse6)) (.cse5 (<= ~c_m_lock~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 3 ~m_run_pc~0) .cse4) (and .cse0 .cse1 (and (<= ULTIMATE.start_m_run_~a~0 0) (and .cse5 .cse2 .cse3 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0))) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse5 .cse4 .cse2) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse6 (<= ULTIMATE.start_s_run_~req_d~1 50))))) [2019-11-20 00:32:31,659 INFO L440 ceAbstractionStarter]: At program point L353(lines 346 363) the Hoare annotation is: (and (= 3 ~m_run_pc~0) (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (= ~c_empty_rsp~0 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (<= 2 ~s_run_st~0) (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)) [2019-11-20 00:32:31,660 INFO L444 ceAbstractionStarter]: For program point L1278(lines 1278 1282) no Hoare annotation was computed. [2019-11-20 00:32:31,660 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 225) no Hoare annotation was computed. [2019-11-20 00:32:31,660 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1160 1339) no Hoare annotation was computed. [2019-11-20 00:32:31,660 INFO L444 ceAbstractionStarter]: For program point L486(lines 485 513) no Hoare annotation was computed. [2019-11-20 00:32:31,660 INFO L444 ceAbstractionStarter]: For program point L354(lines 124 470) no Hoare annotation was computed. [2019-11-20 00:32:31,660 INFO L444 ceAbstractionStarter]: For program point L1213(lines 1213 1217) no Hoare annotation was computed. [2019-11-20 00:32:31,660 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 491) no Hoare annotation was computed. [2019-11-20 00:32:31,661 INFO L444 ceAbstractionStarter]: For program point L421(lines 421 425) no Hoare annotation was computed. [2019-11-20 00:32:31,661 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 359) no Hoare annotation was computed. [2019-11-20 00:32:31,661 INFO L440 ceAbstractionStarter]: At program point L1016(lines 990 1017) the Hoare annotation is: (let ((.cse9 (<= ~c_req_d~0 50)) (.cse18 (= 3 ~m_run_pc~0)) (.cse3 (= ~c_empty_req~0 1)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse14 (<= 1 ~c_req_type~0)) (.cse4 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse15 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse16 (<= ~c_req_type~0 1)) (.cse5 (<= 1 ~c_m_lock~0)) (.cse6 (= ~s_run_pc~0 2)) (.cse19 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse8 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse10 (<= 50 ~c_req_d~0)) (.cse11 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse12 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse20 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse21 (<= ULTIMATE.start_s_run_~req_d~1 50))) (or (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 (= 50 |ULTIMATE.start_s_memory_read_#res|) (= ULTIMATE.start_s_run_~req_type~1 0) (= 0 ~c_req_type~0) (= ~s_memory0~0 50) (= 6 ~m_run_pc~0) .cse1 .cse2 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse3 (= 50 ULTIMATE.start_s_memory_read_~x~0) .cse4 (= ~req_tt_a~0 0) .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse1 (and .cse14 .cse4 .cse0 .cse15 .cse16 .cse5 (let ((.cse17 (and .cse18 .cse3 (not .cse6) .cse7))) (or (and .cse17 (<= 2 ~s_run_pc~0)) (and .cse17 (= 0 ~s_run_pc~0)))) .cse19 .cse8) .cse20 .cse21) (and .cse9 (and (and .cse18 .cse3 .cse7 .cse2) .cse14 .cse4 .cse0 .cse15 .cse16 .cse5 .cse6 .cse19 .cse8) .cse10 .cse11 .cse12 .cse13 .cse1 .cse20 .cse21))) [2019-11-20 00:32:31,661 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 607) no Hoare annotation was computed. [2019-11-20 00:32:31,661 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 120) no Hoare annotation was computed. [2019-11-20 00:32:31,661 INFO L444 ceAbstractionStarter]: For program point L819(lines 819 825) no Hoare annotation was computed. [2019-11-20 00:32:31,662 INFO L440 ceAbstractionStarter]: At program point L819-1(lines 819 825) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse4 (<= ~c_m_lock~0 0)) (.cse5 (<= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse2 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse7 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and .cse0 (and (= 3 ~m_run_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (and .cse2 (<= 2 ~s_run_pc~0) .cse4 .cse5 (not .cse3) (<= 3 ~m_run_pc~0) .cse6) (and .cse1 .cse0 (and (= ~c_empty_req~0 1) .cse4 .cse5 .cse6) .cse2 (= 6 ~m_run_pc~0) .cse3 .cse7))) [2019-11-20 00:32:31,662 INFO L440 ceAbstractionStarter]: At program point L753(lines 746 799) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,662 INFO L440 ceAbstractionStarter]: At program point L687(lines 680 715) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,662 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-11-20 00:32:31,663 INFO L440 ceAbstractionStarter]: At program point L1084(lines 1077 1094) the Hoare annotation is: (let ((.cse3 (<= 0 ~a_t~0)) (.cse6 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 1 ~c_m_lock~0)) (.cse5 (<= 0 ULTIMATE.start_m_run_~a~0))) (or (and (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (and (let ((.cse0 (and (= 3 ~m_run_pc~0) .cse1))) (or (and (<= 2 ~s_run_pc~0) .cse0) (and (= 0 ~s_run_pc~0) .cse0))) (<= 1 ~c_req_type~0) .cse2 .cse3 (<= 1 ULTIMATE.start_s_run_~req_type~1) (<= ~c_req_type~0 1) .cse4 (<= ULTIMATE.start_s_run_~req_type~1 1) .cse5) .cse6 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) .cse6 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) .cse1 .cse2 (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) .cse4 (= ~s_run_pc~0 2) .cse5))) [2019-11-20 00:32:31,663 INFO L440 ceAbstractionStarter]: At program point L1151(lines 1103 1156) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse34 (= 3 ~m_run_pc~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse28 (= ~req_tt_a~0 0)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (<= ~m_run_pc~0 0)) (.cse18 (= 0 ~c_req_type~0)) (.cse26 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse19 (and .cse7 .cse8)) (.cse12 (<= 0 ~a_t~0)) (.cse20 (= 6 ~m_run_pc~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (and .cse0 .cse1 (and .cse34 .cse33 .cse7 .cse8))) (.cse5 (= 0 ~s_run_pc~0)) (.cse32 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse28 .cse29 .cse15 .cse16 .cse30 .cse17 .cse31) (and .cse4 .cse32 (and .cse7 (not .cse16) .cse8)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (and .cse11 .cse12 .cse4 (and .cse2 .cse7) .cse20 .cse15 .cse16 .cse17) .cse26 .cse22) (= ULTIMATE.start_s_run_~req_type~1 0) .cse18) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse12 .cse3 .cse18 .cse8 .cse26 .cse2 .cse11 .cse4 .cse16 .cse6 .cse7) (and .cse9 .cse10 (and .cse33 .cse11 .cse12 .cse4 .cse27 .cse13 .cse15 .cse16 (and .cse34 .cse2 .cse7) .cse23 .cse17) .cse29 .cse21 .cse30 .cse22 .cse24 .cse31) (and .cse12 .cse3 .cse18 .cse5 .cse8 .cse26 .cse2 .cse11 .cse6 .cse7) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17)) (and .cse20 (and .cse2 .cse11 .cse12 .cse4 .cse16 .cse7 .cse8 .cse17)) (and (and .cse11 .cse4 .cse19 .cse16) .cse12 .cse20 .cse15 .cse17) (and .cse4 .cse14 .cse5) (and .cse32 (and .cse34 .cse2 .cse7 .cse8)) (and (and .cse34 .cse7 .cse8) .cse11 .cse4 .cse16)))) [2019-11-20 00:32:31,663 INFO L444 ceAbstractionStarter]: For program point L1085(lines 1077 1094) no Hoare annotation was computed. [2019-11-20 00:32:31,663 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:32:31,664 INFO L444 ceAbstractionStarter]: For program point L755(lines 755 759) no Hoare annotation was computed. [2019-11-20 00:32:31,664 INFO L444 ceAbstractionStarter]: For program point L689(lines 689 693) no Hoare annotation was computed. [2019-11-20 00:32:31,664 INFO L440 ceAbstractionStarter]: At program point L1284(lines 1277 1303) the Hoare annotation is: (let ((.cse0 (<= ~c_req_a~0 0)) (.cse1 (<= 0 ~c_req_a~0)) (.cse34 (= 3 ~m_run_pc~0)) (.cse33 (<= 1 ~c_req_type~0)) (.cse7 (<= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1))) (let ((.cse28 (= ~req_tt_a~0 0)) (.cse25 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse27 (<= 1 ULTIMATE.start_s_run_~req_type~1)) (.cse23 (<= ULTIMATE.start_s_run_~req_type~1 1)) (.cse29 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse21 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse30 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse22 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse24 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse31 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse3 (<= ~m_run_pc~0 0)) (.cse18 (= 0 ~c_req_type~0)) (.cse26 (= 0 ~c_req_a~0)) (.cse6 (<= ~c_m_lock~0 0)) (.cse9 (<= ~c_req_d~0 50)) (.cse10 (<= 50 ~c_req_d~0)) (.cse13 (<= ~c_req_type~0 1)) (.cse19 (and .cse7 .cse8)) (.cse12 (<= 0 ~a_t~0)) (.cse20 (= 6 ~m_run_pc~0)) (.cse15 (<= 1 ~c_m_lock~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse14 (and .cse0 .cse1 (and .cse34 .cse33 .cse7 .cse8))) (.cse5 (= 0 ~s_run_pc~0)) (.cse32 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_req~0 1)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse4 (<= 2 ~s_run_st~0)) (.cse16 (= ~s_run_pc~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse12 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse11 .cse27 .cse28 .cse29 .cse15 .cse16 .cse30 .cse17 .cse31) (and .cse4 .cse32 (and .cse7 (not .cse16) .cse8)) (and (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (and (and (and .cse11 .cse12 .cse4 (and .cse2 .cse7) .cse20 .cse15 .cse16 .cse17) .cse26 .cse22) (= ULTIMATE.start_s_run_~req_type~1 0) .cse18) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse28 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse25 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse12 .cse3 .cse18 .cse8 .cse26 .cse2 .cse11 .cse4 .cse16 .cse6 .cse7) (and .cse9 .cse10 (and .cse33 .cse11 .cse12 .cse4 .cse27 .cse13 .cse15 .cse16 (and .cse34 .cse2 .cse7) .cse23 .cse17) .cse29 .cse21 .cse30 .cse22 .cse24 .cse31) (and .cse12 .cse3 .cse18 .cse5 .cse8 .cse26 .cse2 .cse11 .cse6 .cse7) (and .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse17)) (and .cse20 (and .cse2 .cse11 .cse12 .cse4 .cse16 .cse7 .cse8 .cse17)) (and (and .cse11 .cse4 .cse19 .cse16) .cse12 .cse20 .cse15 .cse17) (and .cse4 .cse14 .cse5) (and .cse32 (and .cse34 .cse2 .cse7 .cse8)) (and (and .cse34 .cse7 .cse8) .cse11 .cse4 .cse16)))) [2019-11-20 00:32:31,665 INFO L440 ceAbstractionStarter]: At program point L227(lines 220 255) the Hoare annotation is: (let ((.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse1 (= ~c_empty_rsp~0 1))) (let ((.cse14 (<= ~c_req_a~0 0)) (.cse15 (<= ULTIMATE.start_m_run_~a~0 0)) (.cse19 (<= 0 ~c_req_a~0)) (.cse20 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse16 (<= 1 ~c_req_type~0)) (.cse22 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse18 (and (<= ~m_run_pc~0 0) .cse2 .cse1)) (.cse17 (and (= 3 ~m_run_pc~0) .cse1 .cse2)) (.cse23 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse21 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (let ((.cse4 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse7 (<= 0 ~a_t~0)) (.cse9 (<= ~c_req_type~0 1)) (.cse5 (<= ~c_req_d~0 50)) (.cse6 (<= 50 ~c_req_d~0)) (.cse11 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse0 (= ~s_run_pc~0 2)) (.cse13 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (and .cse14 .cse15 .cse19 .cse20 (and .cse16 .cse22 (or .cse18 .cse17)) .cse23 .cse21)) (.cse3 (<= 2 ~s_run_st~0)) (.cse10 (= 0 ~s_run_pc~0))) (or (and (and (not .cse0) .cse1 .cse2) .cse3 (<= 2 ~s_run_pc~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse4 .cse7 .cse9 .cse5 .cse6 .cse3 .cse11 .cse12 .cse0 (and .cse14 .cse15 (and .cse16 (or .cse17 .cse18)) .cse19 .cse20 .cse21) .cse22 .cse13 .cse23) (and .cse8 .cse3 .cse10))))) [2019-11-20 00:32:31,665 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 119) no Hoare annotation was computed. [2019-11-20 00:32:31,665 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1090) no Hoare annotation was computed. [2019-11-20 00:32:31,665 INFO L440 ceAbstractionStarter]: At program point L96(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (= ~c_empty_rsp~0 1)) [2019-11-20 00:32:31,665 INFO L440 ceAbstractionStarter]: At program point L427(lines 420 446) the Hoare annotation is: (let ((.cse0 (<= 2 ~s_run_st~0)) (.cse3 (= ~s_run_pc~0 2)) (.cse1 (<= ~c_m_lock~0 0)) (.cse2 (<= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 (and .cse1 .cse2 (not .cse3) .cse4) (<= 2 ~s_run_pc~0)) (and (<= 1 ~c_req_type~0) (<= 0 ~a_t~0) (<= ~c_req_type~0 1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ~c_req_d~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse3 (and (= 3 ~m_run_pc~0) (= ~c_empty_req~0 1) .cse1 .cse2 .cse4) (<= 0 ULTIMATE.start_m_run_~a~0) (<= ULTIMATE.start_s_run_~req_d~1 50)))) [2019-11-20 00:32:31,665 INFO L444 ceAbstractionStarter]: For program point L1286(lines 1286 1290) no Hoare annotation was computed. [2019-11-20 00:32:31,666 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 233) no Hoare annotation was computed. [2019-11-20 00:32:31,666 INFO L444 ceAbstractionStarter]: For program point L956(lines 956 960) no Hoare annotation was computed. [2019-11-20 00:32:31,666 INFO L440 ceAbstractionStarter]: At program point L164(lines 134 165) the Hoare annotation is: (let ((.cse9 (= 0 ~s_run_pc~0)) (.cse4 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse5 (<= 0 ~a_t~0)) (.cse6 (<= ULTIMATE.start_m_run_~req_a~0 0)) (.cse7 (<= ~m_run_pc~0 0)) (.cse8 (= 0 ~c_req_type~0)) (.cse1 (<= 2 ~s_run_pc~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse10 (= 0 ~c_req_a~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse14 (<= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse15 (<= 1 ULTIMATE.start_m_run_~req_type~0)) (.cse3 (<= 2 ~c_write_rsp_ev~0)) (.cse17 (<= 0 ULTIMATE.start_m_run_~req_a~0))) (or (and .cse0 .cse1 (not (= ~s_run_pc~0 2)) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse3 .cse17) (and (<= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse6 .cse7 .cse0 .cse9 .cse15 .cse3 .cse2 (<= 0 ULTIMATE.start_m_run_~a~0) .cse17) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse0 .cse14 .cse16 .cse15 .cse3 .cse17))) [2019-11-20 00:32:31,666 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 118) no Hoare annotation was computed. [2019-11-20 00:32:31,666 INFO L444 ceAbstractionStarter]: For program point L1023(lines 1023 1076) no Hoare annotation was computed. [2019-11-20 00:32:31,667 INFO L440 ceAbstractionStarter]: At program point L561(lines 554 607) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 2))) (let ((.cse2 (not .cse5)) (.cse3 (= ~c_empty_rsp~0 1)) (.cse4 (<= 2 ~c_write_rsp_ev~0)) (.cse0 (<= 2 ~s_run_st~0)) (.cse1 (<= 2 ~s_run_pc~0))) (or (and (<= ULTIMATE.start_m_run_~a~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ULTIMATE.start_m_run_~a~0)) (and (<= 0 ~a_t~0) (= 0 ~c_req_type~0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_s_run_~req_a~1) (<= ULTIMATE.start_s_run_~req_type~1 1) (and (= 3 ~m_run_pc~0) .cse3 .cse4) (<= 50 ULTIMATE.start_s_run_~req_d~1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 0 ~c_req_a~0) (= ULTIMATE.start_m_run_~a~0 0) .cse0 (<= 1 ULTIMATE.start_s_run_~req_type~1) (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (and (and .cse2 .cse3 .cse4 (<= 3 ~m_run_pc~0)) .cse0 .cse1)))) [2019-11-20 00:32:31,667 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-11-20 00:32:31,667 INFO L440 ceAbstractionStarter]: At program point L99(lines 91 833) the Hoare annotation is: (and (<= 2 ~s_run_st~0) (<= 2 ~s_run_pc~0) (<= 2 ~c_write_rsp_ev~0) (not (= ~s_run_pc~0 2)) (= ~c_empty_rsp~0 1)) [2019-11-20 00:32:31,667 INFO L444 ceAbstractionStarter]: For program point L1024(lines 1024 1028) no Hoare annotation was computed. [2019-11-20 00:32:31,667 INFO L440 ceAbstractionStarter]: At program point L628-2(lines 628 656) the Hoare annotation is: (let ((.cse16 (= ~c_empty_rsp~0 1)) (.cse15 (<= 2 ~c_write_rsp_ev~0))) (let ((.cse19 (= 0 ~c_req_a~0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse0 (<= 0 ~a_t~0)) (.cse1 (<= 1 ~c_m_lock~0)) (.cse4 (= ~s_run_pc~0 2)) (.cse5 (and .cse16 .cse15)) (.cse6 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse21 (= 0 ~c_req_type~0))) (let ((.cse7 (= ULTIMATE.start_s_memory_write_~i ULTIMATE.start_s_run_~req_a~1)) (.cse8 (and (and .cse19 (<= 1 ULTIMATE.start_s_run_~req_type~1) (and .cse2 .cse0 .cse1 .cse4 .cse5 .cse6) (<= ULTIMATE.start_s_run_~req_type~1 1)) .cse21)) (.cse9 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse10 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse11 (= 0 ULTIMATE.start_s_run_~req_a~1)) (.cse17 (= ~req_tt_a~0 0)) (.cse13 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse20 (= ~c_empty_req~0 1)) (.cse3 (<= 2 ~s_run_st~0)) (.cse18 (= 6 ~m_run_pc~0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6) (and (= ULTIMATE.start_m_run_~a~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse15 (not .cse4) .cse16) .cse3 (<= 2 ~s_run_pc~0)) (and .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (and .cse0 .cse18 .cse11 .cse19 .cse20 .cse2 .cse3 .cse1 .cse4 .cse15 .cse6) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (= 50 ULTIMATE.start_s_memory_read_~x~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) .cse17 .cse21 (= 50 ~c_rsp_d~0) (= ~s_memory0~0 50) .cse13 (= 50 ULTIMATE.start_s_run_~rsp_d~1)) (and .cse2 .cse0 (and .cse20 .cse15 .cse16) .cse3 .cse18 .cse4 .cse6))))) [2019-11-20 00:32:31,668 INFO L440 ceAbstractionStarter]: At program point L761(lines 754 798) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= 0 ~a_t~0) (<= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (= ~s_run_pc~0 2) (<= ~c_m_lock~0 0) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,668 INFO L440 ceAbstractionStarter]: At program point L695(lines 688 714) the Hoare annotation is: (and (= ULTIMATE.start_m_run_~rsp_d___0~0 50) (<= 50 ULTIMATE.start_s_memory_write_~v) (<= ULTIMATE.start_s_memory_write_~v 50) (<= 0 ~a_t~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= 50 |ULTIMATE.start_s_memory_read_#res|) (= 0 ~c_req_type~0) (= 6 ~m_run_pc~0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_s_run_~req_a~1) (= ~c_empty_rsp~0 1) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= 50 ULTIMATE.start_s_run_~rsp_d~1) (= 0 ~c_req_a~0) (= ~c_empty_req~0 1) (<= 2 ~c_write_req_ev~0) (= 50 ULTIMATE.start_s_memory_read_~x~0) (<= 2 ~s_run_st~0) (= ~req_tt_a~0 0) (= 50 ~c_rsp_d~0) (<= 1 ~c_m_lock~0) (= ~s_run_pc~0 2) (<= 2 ~c_write_rsp_ev~0) (<= 0 ULTIMATE.start_m_run_~a~0)) [2019-11-20 00:32:31,668 INFO L444 ceAbstractionStarter]: For program point L629(lines 628 656) no Hoare annotation was computed. [2019-11-20 00:32:31,668 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 567) no Hoare annotation was computed. [2019-11-20 00:32:31,668 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 117) no Hoare annotation was computed. [2019-11-20 00:32:31,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:32:31 BoogieIcfgContainer [2019-11-20 00:32:31,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:32:31,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:32:31,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:32:31,794 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:32:31,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:31:13" (3/4) ... [2019-11-20 00:32:31,797 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:32:31,829 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 00:32:31,831 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 00:32:31,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) [2019-11-20 00:32:31,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (((0 == c_req_a && ((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((c_req_d <= 50 && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,879 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((0 <= a_t && 6 == m_run_pc) && 1 <= c_m_lock) && ((2 <= s_run_st && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && 0 <= a)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (6 == m_run_pc && ((2 <= c_write_req_ev && 0 <= a_t) && (((c_empty_req == 1 && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (0 == c_req_a && (((((2 <= c_write_req_ev && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,880 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) [2019-11-20 00:32:31,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && (((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || ((c_req_d <= 50 && 50 <= c_req_d) && ((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && 1 <= c_m_lock) && ((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || ((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= a)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (0 == c_req_a && 0 == req_a) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) [2019-11-20 00:32:31,882 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && (((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) || ((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 0 == s_run_pc))) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && (((((((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_req_type) && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) [2019-11-20 00:32:31,887 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == req_d) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50)) || (((((2 <= c_write_req_ev && 0 <= a_t) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 6 == m_run_pc) && s_run_pc == 2)) || ((((((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) [2019-11-20 00:32:31,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) [2019-11-20 00:32:31,888 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) [2019-11-20 00:32:31,890 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) [2019-11-20 00:32:31,891 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && (((((((((2 <= s_run_pc && 3 == m_run_pc && c_empty_req == 1) || (0 == s_run_pc && 3 == m_run_pc && c_empty_req == 1)) && 1 <= c_req_type) && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 0 == req_a) && 50 <= req_d) && req_d <= 50) || (((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) [2019-11-20 00:32:31,891 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) [2019-11-20 00:32:31,891 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) [2019-11-20 00:32:31,892 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 <= a_t && 1 <= c_m_lock) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((a == 0 && i == req_a) && (((0 == c_req_a && 1 <= req_type) && ((((2 <= c_write_req_ev && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type <= 1) && 0 == c_req_type) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((req_tt_a == 0 && i == req_a) && (((0 == c_req_a && 1 <= req_type) && ((((2 <= c_write_req_ev && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type <= 1) && 0 == c_req_type) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || (((((((((((((((((((((0 <= a_t && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && 50 <= v) && v <= 50) && 50 == x) && req_type == 0) && 50 == \result) && req_tt_a == 0) && 0 == c_req_type) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((2 <= c_write_req_ev && 0 <= a_t) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 6 == m_run_pc) && s_run_pc == 2) && 0 <= a) [2019-11-20 00:32:31,892 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,892 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && i == 0) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,893 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,893 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,893 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,894 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,894 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,894 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,894 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,894 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:31,895 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a [2019-11-20 00:32:32,013 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e34d08c7-9abf-4db6-b5f8-c9d46f38e1ec/bin/uautomizer/witness.graphml [2019-11-20 00:32:32,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:32:32,019 INFO L168 Benchmark]: Toolchain (without parser) took 80221.94 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 939.3 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 294.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:32:32,020 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:32:32,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:32:32,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:32:32,021 INFO L168 Benchmark]: Boogie Preprocessor took 57.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:32:32,022 INFO L168 Benchmark]: RCFGBuilder took 1243.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:32:32,022 INFO L168 Benchmark]: TraceAbstraction took 78052.92 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-20 00:32:32,022 INFO L168 Benchmark]: Witness Printer took 224.77 ms. Allocated memory is still 4.1 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 82.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:32:32,024 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 565.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1243.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78052.92 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 224.77 ms. Allocated memory is still 4.1 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 82.9 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 925]: Loop Invariant Derived loop invariant: ((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || (((((50 <= v && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && 0 == req_a___0) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 0 <= a_t) && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 6 == m_run_pc) && s_run_pc == 2) && 1 <= a) || (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || ((((((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a_t) && 1 <= a)) || ((((((2 <= s_run_st && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1)) || ((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= s_run_st && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((((((req_d <= 50 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) || (((((((((a <= 0 && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || (((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((2 <= s_run_st && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: ((((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a) || ((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) || ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 2 <= s_run_pc) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: ((((((2 <= c_write_req_ev && 0 <= a_t) && 0 == c_req_type) && (((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || ((c_req_d <= 50 && 50 <= c_req_d) && ((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && 1 <= c_m_lock) && ((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) || ((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= a)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (0 == c_req_a && 0 == req_a) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 570]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50) - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((0 <= a_t && (((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) || ((((((2 <= s_run_st && 2 <= s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1)) || ((((((2 <= c_write_req_ev && 0 <= a_t) && ((c_empty_req == 1 && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 6 == m_run_pc) && s_run_pc == 2) && 0 <= a) - InvariantResult [Line: 1269]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((2 <= s_run_st && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((req_d <= 50 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((a <= 0 && c_empty_req == 1) && req_a <= 0) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((req_d <= 50 && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 50 <= req_d) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1277]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 955]: Loop Invariant Derived loop invariant: ((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || (((((50 <= v && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && 0 == req_a___0) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 933]: Loop Invariant Derived loop invariant: ((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || (((((50 <= v && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && 0 == req_a___0) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 608]: Loop Invariant Derived loop invariant: (((((0 <= a_t && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) || (((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((((((((((((req_d <= 50 && 0 <= a_t) && c_req_type <= 1) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((((c_req_a <= 0 && a <= 0) && 1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= c_req_a) && req_a <= 0) && 0 <= req_a) && 1 <= req_type) && 50 <= req_d) && 0 <= a)) || ((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) || (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev)) || ((((((((((((((((0 <= a_t && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == req_d) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50)) || (((((2 <= c_write_req_ev && 0 <= a_t) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 6 == m_run_pc) && s_run_pc == 2)) || ((((((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 1307]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((0 <= a_t && 6 == m_run_pc) && 1 <= c_m_lock) && ((2 <= s_run_st && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 2 <= c_write_req_ev) && s_run_pc == 2) && 0 <= a)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (6 == m_run_pc && ((2 <= c_write_req_ev && 0 <= a_t) && (((c_empty_req == 1 && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (req_type == 0 && 0 == c_req_type) && (0 == c_req_a && (((((2 <= c_write_req_ev && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= s_run_st && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 1285]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 762]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) || (((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((((((((((((req_d <= 50 && 0 <= a_t) && c_req_type <= 1) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((((c_req_a <= 0 && a <= 0) && 1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= c_req_a) && req_a <= 0) && 0 <= req_a) && 1 <= req_type) && 50 <= req_d) && 0 <= a)) || ((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) || ((2 <= s_run_st && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2)) || (((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 696]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 770]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 2 <= s_run_pc) || (((((((((req_d <= 50 && c_req_d <= 50) && 50 <= c_req_d) && 0 <= a_t) && (((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && c_req_type <= 1) && 0 == s_run_pc) && req_type <= 1) && 1 <= c_m_lock) && 50 <= req_d)) || ((((((((((((req_d <= 50 && 0 <= a_t) && c_req_type <= 1) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((((c_req_a <= 0 && a <= 0) && 1 <= c_req_type && (((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= c_req_a) && req_a <= 0) && 0 <= req_a) && 1 <= req_type) && 50 <= req_d) && 0 <= a)) || ((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && req_a <= 0) && (1 <= c_req_type && 1 <= req_type) && (((m_run_pc <= 0 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev))) && 0 <= a) && 0 <= req_a) && 2 <= s_run_st) && 0 == s_run_pc) - InvariantResult [Line: 1172]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2)) || ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && ((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1180]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1) || ((2 <= s_run_st && 2 <= s_run_pc) && (a <= 0 && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && req_d <= 50) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && c_empty_rsp == 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && i == 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (((((((0 <= a_t && 1 <= c_m_lock) && ((2 <= c_write_req_ev && 2 <= s_run_st) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((a == 0 && i == req_a) && (((0 == c_req_a && 1 <= req_type) && ((((2 <= c_write_req_ev && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type <= 1) && 0 == c_req_type) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || ((((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_st) && 2 <= s_run_pc)) || ((((((((req_tt_a == 0 && i == req_a) && (((0 == c_req_a && 1 <= req_type) && ((((2 <= c_write_req_ev && 0 <= a_t) && 1 <= c_m_lock) && s_run_pc == 2) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && 0 <= a) && req_type <= 1) && 0 == c_req_type) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && 0 == req_a___0) && req_d <= 50)) || (((((((((((((((((((((0 <= a_t && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) && 50 <= v) && v <= 50) && 50 == x) && req_type == 0) && 50 == \result) && req_tt_a == 0) && 0 == c_req_type) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((2 <= c_write_req_ev && 0 <= a_t) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 6 == m_run_pc) && s_run_pc == 2) && 0 <= a) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && 3 <= m_run_pc) && c_empty_rsp == 1 - InvariantResult [Line: 800]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_d <= 50) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && a == 0) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 0 <= a)) || ((((((((((c_req_a <= 0 && a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a) || (((((((((((((a <= 0 && m_run_pc <= 0) && req_a <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 2 <= s_run_st) && 1 <= req_type) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || ((((((((((((((((req_d <= 50 && req_a <= 0) && 0 <= a_t) && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= req_type) && 50 <= req_d) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 1031]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((((((((3 == m_run_pc && 1 <= c_req_type) && 0 <= a_t) && c_req_type <= 1) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) || (((((((c_req_d <= 50 && 50 <= c_req_d) && 2 <= c_write_req_ev) && 0 <= a_t) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && c_req_type <= 1) && 0 == s_run_pc) && 1 <= c_m_lock)) || ((2 <= s_run_st && ((3 == m_run_pc && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((((c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_st) && 0 == s_run_pc)) || ((((((((((((((((0 <= a_t && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || (((((3 == m_run_pc && 2 <= c_write_req_ev) && 2 <= s_run_st) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: (((((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 50 == \result) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && (((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) || ((((3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) && 2 <= c_write_rsp_ev) && 0 == s_run_pc))) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && (((((((((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_req_type) && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) || ((((((((((a <= 0 && c_empty_req == 1) && m_run_pc <= 0) && req_a <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && 1 <= req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 0 <= req_a)) || ((((((((((((((((req_d <= 50 && 0 <= a_t) && m_run_pc <= 0) && req_a <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && a == 0) && 2 <= c_write_req_ev) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((2 <= s_run_st && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 2 <= s_run_pc) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 1 <= a) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && req_d <= 50) || ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && (((((3 == m_run_pc && c_empty_req == 1) && 0 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && 0 <= a) && req_d <= 50 - InvariantResult [Line: 1188]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= v && v <= 50) && 0 <= a_t) && req_type == 0) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && i == 0) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1103]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 <= a_t && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && ((3 == m_run_pc && 1 <= c_req_type) && c_empty_req == 1) && 2 <= c_write_rsp_ev) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && 0 <= a) && req_d <= 50) || (((2 <= c_write_req_ev && 2 <= s_run_st) && c_empty_rsp == 1 && 2 <= c_write_rsp_ev) && s_run_pc == 2)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && 0 == s_run_pc) && 1 <= c_m_lock) && (c_req_a <= 0 && 0 <= c_req_a) && ((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type) && 0 <= a)) || ((c_req_d <= 50 && 50 <= c_req_d) && c_req_type <= 1 && ((((2 <= c_write_req_ev && 0 <= a_t) && (c_req_a <= 0 && 0 <= c_req_a) && (1 <= c_req_type && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((2 <= s_run_st && 0 == s_run_pc) && (c_req_a <= 0 && 0 <= c_req_a) && ((2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) && 1 <= c_req_type)) || ((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1196]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 428]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && ((c_m_lock <= 0 && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && c_req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && (((3 == m_run_pc && c_empty_req == 1) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && req_d <= 50) - InvariantResult [Line: 1157]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 1226]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 1204]: Loop Invariant Derived loop invariant: ((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || (((((50 <= v && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && 0 == req_a___0) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || (((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && (((0 == c_req_a && ((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && (c_empty_req == 1 && m_run_st == 0) && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((((((((c_req_d <= 50 && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((3 == m_run_pc && c_empty_req == 1) && m_run_st == 0) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((((((((m_run_pc <= 0 && 0 <= a_t) && 0 == c_req_type) && 2 <= s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && c_m_lock <= 0) && m_run_st == 0) && 2 <= c_write_rsp_ev)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 909]: Loop Invariant Derived loop invariant: ((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || (((((50 <= v && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && 0 == req_a___0) - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 <= a) || ((c_req_d <= 50 && 50 <= c_req_d) && ((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && 1 <= c_m_lock) && (((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 0 == s_run_pc) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 0 <= a) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((2 <= s_run_st && 2 <= s_run_pc) && 2 <= c_write_rsp_ev) && !(s_run_pc == 2)) && c_empty_rsp == 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && (((((((((2 <= s_run_pc && 3 == m_run_pc && c_empty_req == 1) || (0 == s_run_pc && 3 == m_run_pc && c_empty_req == 1)) && 1 <= c_req_type) && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 0 == req_a) && 50 <= req_d) && req_d <= 50) || (((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50)) || (((((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) && 2 <= s_run_st) && 2 <= s_run_pc) - InvariantResult [Line: 1055]: Loop Invariant Derived loop invariant: ((((((((((50 <= v && v <= 50) && 50 == x) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && c_empty_req == 1) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == req_a___0) && 50 == rsp_d) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && ((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 1 <= req_type) && 3 == m_run_pc && c_empty_req == 1) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && i == req_a) && (((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && ((0 == s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)) || (2 <= s_run_pc && (3 == m_run_pc && c_empty_req == 1) && !(s_run_pc == 2)))) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: ((2 <= s_run_st && 2 <= s_run_pc) && (!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || (((((((((((((((((0 <= a_t && 0 == c_req_type) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && a == 0) && 2 <= s_run_st) && 1 <= req_type) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: (((((((((((((((((((((1 <= c_req_type && 0 <= a_t) && (3 == m_run_pc && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && 1 <= c_m_lock) && v == req_d) && s_run_pc == 2) && req_d <= 50) || ((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: (((((((a <= 0 && 2 <= s_run_st) && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 <= a) || (((((((((((((((((((1 <= c_req_type && 0 <= a_t) && c_req_type <= 1) && req_type___0 == 0) && s_memory0 == req_d) && ((3 == m_run_pc && c_empty_req == 1) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && c_req_d <= 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && 2 <= s_run_st) && 1 <= req_type) && i == req_a) && v == req_d) && s_run_pc == 2) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && ((!(s_run_pc == 2) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) && 3 <= m_run_pc) - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((2 <= s_run_st && 2 <= s_run_pc) && !(s_run_pc == 2)) && c_empty_rsp == 1) && 2 <= c_write_rsp_ev) || ((((((((((((a <= 0 && 1 <= c_req_type) && req_a <= 0) && m_run_pc <= 0) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_a <= 0) && 0 <= c_req_a) && 2 <= s_run_st) && 1 <= req_type) && 2 <= c_write_rsp_ev) && 0 <= a) && 0 <= req_a)) || (((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 2 <= s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 50 <= c_req_d) && 0 <= c_req_a) && a == 0) && 2 <= s_run_st) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a)) || ((((((((((((((((((req_d <= 50 && 1 <= c_req_type) && 0 <= a_t) && req_a <= 0) && m_run_pc <= 0) && c_req_type <= 1) && 0 == s_run_pc) && c_empty_rsp == 1) && c_req_d <= 50) && c_req_a <= 0) && 0 <= c_req_a) && 50 <= c_req_d) && a == 0) && req_type <= 1) && 1 <= c_m_lock) && 1 <= req_type) && 50 <= req_d) && 2 <= c_write_rsp_ev) && 0 <= req_a) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: (((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 50 == x) && 2 <= c_write_req_ev) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 1261]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_a <= 0 && 0 <= c_req_a) && c_empty_req == 1) && m_run_pc <= 0) && 2 <= s_run_st) && 0 == s_run_pc) && c_m_lock <= 0) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a)) || ((((((((((((((((((0 <= a_t && 0 == c_req_type) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 6 == m_run_pc) && s_memory0 == req_d) && 0 == req_a) && req_type <= 1) && 50 <= req_d) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && 1 <= req_type) && req_tt_a == 0) && i == req_a) && 1 <= c_m_lock) && s_run_pc == 2) && v == req_d) && 0 <= a) && req_d <= 50)) || ((2 <= s_run_st && 2 <= s_run_pc) && (2 <= c_write_rsp_ev && !(s_run_pc == 2)) && c_empty_rsp == 1)) || (((((((((50 <= v && v <= 50) && 50 == x) && ((((((((((2 <= c_write_req_ev && 0 <= a_t) && 2 <= s_run_st) && c_empty_req == 1 && 2 <= c_write_rsp_ev) && 6 == m_run_pc) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && 0 == c_req_a) && 0 == req_a) && req_type == 0) && 0 == c_req_type) && 50 == \result) && req_tt_a == 0) && 50 == c_rsp_d) && s_memory0 == 50) && 0 == req_a___0) && 50 == rsp_d)) || ((((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((((((((c_req_d <= 50 && 50 <= c_req_d) && (((((((((1 <= c_req_type && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && 1 <= req_type) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && (3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && req_type <= 1) && 0 <= a) && i == req_a) && s_memory0 == req_d) && v == req_d) && 0 == req_a) && 50 <= req_d) && req_d <= 50)) || (((((((((0 <= a_t && m_run_pc <= 0) && 0 == c_req_type) && 0 == s_run_pc) && c_empty_rsp == 1) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && c_m_lock <= 0) && 2 <= c_write_rsp_ev)) || ((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc) && 1 <= c_m_lock) && 0 <= a)) || (6 == m_run_pc && ((((((c_empty_req == 1 && 2 <= c_write_req_ev) && 0 <= a_t) && 2 <= s_run_st) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a)) || (((((((2 <= c_write_req_ev && 2 <= s_run_st) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && s_run_pc == 2) && 0 <= a_t) && 6 == m_run_pc) && 1 <= c_m_lock) && 0 <= a)) || ((2 <= s_run_st && (c_req_a <= 0 && 0 <= c_req_a) && ((3 == m_run_pc && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 == s_run_pc)) || (2 <= s_run_pc && ((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1)) || (((((3 == m_run_pc && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 2 <= s_run_st) && s_run_pc == 2) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((rsp_d___0 == 50 && 50 <= v) && v <= 50) && 0 <= a_t) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && c_empty_rsp == 1) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: ((((c_req_d <= 50 && 50 <= c_req_d) && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && ((((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 2 <= s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) || (((((((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && c_empty_req == 1) && 1 <= c_req_type) && 1 <= req_type) && 0 == s_run_pc) && 0 == req_a) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1))) && 1 <= c_m_lock) && req_type <= 1) && 0 <= a) && 50 <= req_d) && req_d <= 50) || (((((50 <= v && (((((((((0 <= a_t && req_type == 0) && 0 == c_req_type) && 6 == m_run_pc) && 0 == req_a) && 0 == c_req_a) && (c_empty_req == 1 && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && s_run_pc == 2) && 0 <= a) && v <= 50) && req_tt_a == 0) && s_memory0 == 50) && 0 == req_a___0) - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: ((((((((((((((((((((50 <= v && 0 <= a_t) && v <= 50) && req_type == 0) && 50 == \result) && 0 == c_req_type) && 6 == m_run_pc) && s_memory0 == 50) && 0 == req_a) && 0 == req_a___0) && 50 == rsp_d) && 0 == c_req_a) && c_empty_req == 1) && 2 <= c_write_req_ev) && 50 == x) && 2 <= s_run_st) && req_tt_a == 0) && 50 == c_rsp_d) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev) && 0 <= a - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: (((((3 == m_run_pc && c_empty_req == 1) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 2 <= s_run_pc) || (((((((((((((50 <= v && v <= 50) && 0 <= a_t) && 0 == c_req_type) && s_memory0 == 50) && 6 == m_run_pc) && 0 == req_a___0) && 0 == c_req_a) && 2 <= c_write_req_ev) && req_tt_a == 0) && 1 <= c_m_lock) && s_run_pc == 2) && 2 <= c_write_rsp_ev && c_empty_rsp == 1) && 0 <= a)) || ((c_req_d <= 50 && (((((2 <= c_write_req_ev && 0 <= a_t) && c_req_type <= 1) && 1 <= c_m_lock) && s_run_pc == 2) && ((((3 == m_run_pc && c_req_a <= 0) && 0 <= c_req_a) && 1 <= c_req_type) && 2 <= c_write_rsp_ev) && c_empty_rsp == 1) && 0 <= a) && 50 <= c_req_d) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 270 locations, 5 error locations. Result: SAFE, OverallTime: 77.8s, OverallIterations: 24, TraceHistogramMax: 4, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 56.0s, HoareTripleCheckerStatistics: 12911 SDtfs, 15564 SDslu, 20890 SDs, 0 SdLazy, 2173 SolverSat, 466 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 296 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9345occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 47731 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 1161 NumberOfFragments, 14699 HoareAnnotationTreeSize, 98 FomulaSimplifications, 4845397 FormulaSimplificationTreeSizeReduction, 14.5s HoareSimplificationTime, 98 FomulaSimplificationsInter, 965449 FormulaSimplificationTreeSizeReductionInter, 41.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2489 NumberOfCodeBlocks, 2489 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2464 ConstructedInterpolants, 0 QuantifiedInterpolants, 927151 SizeOfPredicates, 16 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 25 InterpolantComputations, 23 PerfectInterpolantSequences, 304/408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...