./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5175cce01b12a2d959ac6d92bcc0adb5892ab17f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:49:13,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:49:13,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:49:13,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:49:13,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:49:13,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:49:13,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:49:13,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:49:13,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:49:13,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:49:13,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:49:13,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:49:13,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:49:14,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:49:14,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:49:14,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:49:14,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:49:14,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:49:14,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:49:14,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:49:14,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:49:14,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:49:14,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:49:14,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:49:14,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:49:14,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:49:14,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:49:14,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:49:14,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:49:14,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:49:14,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:49:14,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:49:14,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:49:14,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:49:14,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:49:14,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:49:14,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:49:14,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:49:14,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:49:14,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:49:14,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:49:14,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:49:14,094 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:49:14,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:49:14,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:49:14,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:49:14,099 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:49:14,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:49:14,099 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:49:14,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:49:14,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:49:14,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:49:14,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:49:14,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:49:14,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:49:14,101 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:49:14,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:49:14,102 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:49:14,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:49:14,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:49:14,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:49:14,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:49:14,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:49:14,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:49:14,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:49:14,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:49:14,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:49:14,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:49:14,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:49:14,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:49:14,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:49:14,105 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5175cce01b12a2d959ac6d92bcc0adb5892ab17f [2020-10-20 01:49:14,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:49:14,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:49:14,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:49:14,333 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:49:14,334 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:49:14,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2020-10-20 01:49:14,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091d09df9/fa59e43ecca34c5d82165f1961bce04d/FLAG719b9188a [2020-10-20 01:49:15,021 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:49:15,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2020-10-20 01:49:15,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091d09df9/fa59e43ecca34c5d82165f1961bce04d/FLAG719b9188a [2020-10-20 01:49:15,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091d09df9/fa59e43ecca34c5d82165f1961bce04d [2020-10-20 01:49:15,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:49:15,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:49:15,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:49:15,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:49:15,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:49:15,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:15,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a90c230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15, skipping insertion in model container [2020-10-20 01:49:15,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:15,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:49:15,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:49:15,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:49:15,804 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:49:15,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:49:15,932 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:49:15,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15 WrapperNode [2020-10-20 01:49:15,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:49:15,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:49:15,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:49:15,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:49:15,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:15,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:49:16,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:49:16,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:49:16,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:49:16,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... [2020-10-20 01:49:16,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:49:16,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:49:16,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:49:16,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:49:16,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:49:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:49:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:49:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:49:16,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:49:17,202 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:49:17,202 INFO L298 CfgBuilder]: Removed 49 assume(true) statements. [2020-10-20 01:49:17,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:17 BoogieIcfgContainer [2020-10-20 01:49:17,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:49:17,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:49:17,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:49:17,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:49:17,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:49:15" (1/3) ... [2020-10-20 01:49:17,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4710347c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:49:17, skipping insertion in model container [2020-10-20 01:49:17,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:49:15" (2/3) ... [2020-10-20 01:49:17,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4710347c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:49:17, skipping insertion in model container [2020-10-20 01:49:17,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:17" (3/3) ... [2020-10-20 01:49:17,215 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2020-10-20 01:49:17,227 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:49:17,236 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-10-20 01:49:17,251 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-20 01:49:17,276 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:49:17,276 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:49:17,276 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:49:17,276 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:49:17,277 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:49:17,277 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:49:17,277 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:49:17,277 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:49:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2020-10-20 01:49:17,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 01:49:17,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:17,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:17,316 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash -828410770, now seen corresponding path program 1 times [2020-10-20 01:49:17,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:17,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110888045] [2020-10-20 01:49:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:17,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110888045] [2020-10-20 01:49:17,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:17,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:17,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104669661] [2020-10-20 01:49:17,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:17,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:17,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:17,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:17,572 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 3 states. [2020-10-20 01:49:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:18,066 INFO L93 Difference]: Finished difference Result 718 states and 1297 transitions. [2020-10-20 01:49:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:18,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-20 01:49:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:18,087 INFO L225 Difference]: With dead ends: 718 [2020-10-20 01:49:18,087 INFO L226 Difference]: Without dead ends: 440 [2020-10-20 01:49:18,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-20 01:49:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 424. [2020-10-20 01:49:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-20 01:49:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 666 transitions. [2020-10-20 01:49:18,192 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 666 transitions. Word has length 27 [2020-10-20 01:49:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:18,193 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 666 transitions. [2020-10-20 01:49:18,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 666 transitions. [2020-10-20 01:49:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-20 01:49:18,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:18,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:18,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:49:18,197 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 585120716, now seen corresponding path program 1 times [2020-10-20 01:49:18,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:18,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071628564] [2020-10-20 01:49:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:18,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071628564] [2020-10-20 01:49:18,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:18,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:18,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101700191] [2020-10-20 01:49:18,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:18,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:18,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:18,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:18,262 INFO L87 Difference]: Start difference. First operand 424 states and 666 transitions. Second operand 3 states. [2020-10-20 01:49:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:18,435 INFO L93 Difference]: Finished difference Result 1111 states and 1767 transitions. [2020-10-20 01:49:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:18,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-20 01:49:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:18,441 INFO L225 Difference]: With dead ends: 1111 [2020-10-20 01:49:18,441 INFO L226 Difference]: Without dead ends: 701 [2020-10-20 01:49:18,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-10-20 01:49:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 685. [2020-10-20 01:49:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-10-20 01:49:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1105 transitions. [2020-10-20 01:49:18,487 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1105 transitions. Word has length 36 [2020-10-20 01:49:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:18,488 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 1105 transitions. [2020-10-20 01:49:18,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1105 transitions. [2020-10-20 01:49:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 01:49:18,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:18,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:18,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:49:18,491 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1780672929, now seen corresponding path program 1 times [2020-10-20 01:49:18,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:18,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232648263] [2020-10-20 01:49:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:18,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232648263] [2020-10-20 01:49:18,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:18,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:18,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550440093] [2020-10-20 01:49:18,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:18,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:18,597 INFO L87 Difference]: Start difference. First operand 685 states and 1105 transitions. Second operand 3 states. [2020-10-20 01:49:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:18,712 INFO L93 Difference]: Finished difference Result 1731 states and 2796 transitions. [2020-10-20 01:49:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:18,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-10-20 01:49:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:18,722 INFO L225 Difference]: With dead ends: 1731 [2020-10-20 01:49:18,723 INFO L226 Difference]: Without dead ends: 1071 [2020-10-20 01:49:18,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2020-10-20 01:49:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1059. [2020-10-20 01:49:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2020-10-20 01:49:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1708 transitions. [2020-10-20 01:49:18,802 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1708 transitions. Word has length 37 [2020-10-20 01:49:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:18,803 INFO L481 AbstractCegarLoop]: Abstraction has 1059 states and 1708 transitions. [2020-10-20 01:49:18,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1708 transitions. [2020-10-20 01:49:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 01:49:18,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:18,815 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:18,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:49:18,816 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash -775080850, now seen corresponding path program 1 times [2020-10-20 01:49:18,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:18,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691514207] [2020-10-20 01:49:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:18,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691514207] [2020-10-20 01:49:18,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:18,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:18,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770727570] [2020-10-20 01:49:18,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:18,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:18,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:18,951 INFO L87 Difference]: Start difference. First operand 1059 states and 1708 transitions. Second operand 4 states. [2020-10-20 01:49:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:19,631 INFO L93 Difference]: Finished difference Result 2909 states and 4673 transitions. [2020-10-20 01:49:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:19,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-10-20 01:49:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:19,642 INFO L225 Difference]: With dead ends: 2909 [2020-10-20 01:49:19,643 INFO L226 Difference]: Without dead ends: 1875 [2020-10-20 01:49:19,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-10-20 01:49:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1645. [2020-10-20 01:49:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2020-10-20 01:49:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2616 transitions. [2020-10-20 01:49:19,707 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2616 transitions. Word has length 46 [2020-10-20 01:49:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:19,707 INFO L481 AbstractCegarLoop]: Abstraction has 1645 states and 2616 transitions. [2020-10-20 01:49:19,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2616 transitions. [2020-10-20 01:49:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-20 01:49:19,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:19,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:19,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:49:19,710 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2020-10-20 01:49:19,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:19,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407018418] [2020-10-20 01:49:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:19,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407018418] [2020-10-20 01:49:19,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:19,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:19,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337094088] [2020-10-20 01:49:19,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:19,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:19,815 INFO L87 Difference]: Start difference. First operand 1645 states and 2616 transitions. Second operand 4 states. [2020-10-20 01:49:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:20,362 INFO L93 Difference]: Finished difference Result 4885 states and 7660 transitions. [2020-10-20 01:49:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:49:20,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-10-20 01:49:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:20,377 INFO L225 Difference]: With dead ends: 4885 [2020-10-20 01:49:20,378 INFO L226 Difference]: Without dead ends: 3259 [2020-10-20 01:49:20,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2020-10-20 01:49:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2889. [2020-10-20 01:49:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2020-10-20 01:49:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4519 transitions. [2020-10-20 01:49:20,505 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4519 transitions. Word has length 52 [2020-10-20 01:49:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:20,505 INFO L481 AbstractCegarLoop]: Abstraction has 2889 states and 4519 transitions. [2020-10-20 01:49:20,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4519 transitions. [2020-10-20 01:49:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-20 01:49:20,507 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:20,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:20,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:49:20,508 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2020-10-20 01:49:20,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:20,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944668096] [2020-10-20 01:49:20,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:20,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944668096] [2020-10-20 01:49:20,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:20,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:20,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555328427] [2020-10-20 01:49:20,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:20,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:20,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:20,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:20,555 INFO L87 Difference]: Start difference. First operand 2889 states and 4519 transitions. Second operand 3 states. [2020-10-20 01:49:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:20,714 INFO L93 Difference]: Finished difference Result 6783 states and 10562 transitions. [2020-10-20 01:49:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:20,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-10-20 01:49:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:20,733 INFO L225 Difference]: With dead ends: 6783 [2020-10-20 01:49:20,734 INFO L226 Difference]: Without dead ends: 3917 [2020-10-20 01:49:20,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2020-10-20 01:49:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3733. [2020-10-20 01:49:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-20 01:49:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5757 transitions. [2020-10-20 01:49:20,933 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5757 transitions. Word has length 52 [2020-10-20 01:49:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:20,934 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 5757 transitions. [2020-10-20 01:49:20,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5757 transitions. [2020-10-20 01:49:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-20 01:49:20,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:20,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:20,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:49:20,937 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:20,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2003108181, now seen corresponding path program 1 times [2020-10-20 01:49:20,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:20,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475853083] [2020-10-20 01:49:20,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:20,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475853083] [2020-10-20 01:49:20,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:20,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:20,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204811438] [2020-10-20 01:49:20,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:20,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:20,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:20,983 INFO L87 Difference]: Start difference. First operand 3733 states and 5757 transitions. Second operand 3 states. [2020-10-20 01:49:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:21,488 INFO L93 Difference]: Finished difference Result 8963 states and 13937 transitions. [2020-10-20 01:49:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:21,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-10-20 01:49:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:21,513 INFO L225 Difference]: With dead ends: 8963 [2020-10-20 01:49:21,514 INFO L226 Difference]: Without dead ends: 5253 [2020-10-20 01:49:21,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2020-10-20 01:49:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4515. [2020-10-20 01:49:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2020-10-20 01:49:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6698 transitions. [2020-10-20 01:49:21,720 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6698 transitions. Word has length 56 [2020-10-20 01:49:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:21,720 INFO L481 AbstractCegarLoop]: Abstraction has 4515 states and 6698 transitions. [2020-10-20 01:49:21,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6698 transitions. [2020-10-20 01:49:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-20 01:49:21,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:21,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:21,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:49:21,723 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1830588417, now seen corresponding path program 1 times [2020-10-20 01:49:21,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:21,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173790894] [2020-10-20 01:49:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:21,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173790894] [2020-10-20 01:49:21,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:21,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:21,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159528595] [2020-10-20 01:49:21,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:21,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:21,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:21,964 INFO L87 Difference]: Start difference. First operand 4515 states and 6698 transitions. Second operand 3 states. [2020-10-20 01:49:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:22,175 INFO L93 Difference]: Finished difference Result 8873 states and 13173 transitions. [2020-10-20 01:49:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:22,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-10-20 01:49:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:22,196 INFO L225 Difference]: With dead ends: 8873 [2020-10-20 01:49:22,197 INFO L226 Difference]: Without dead ends: 4381 [2020-10-20 01:49:22,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2020-10-20 01:49:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4381. [2020-10-20 01:49:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4381 states. [2020-10-20 01:49:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 6397 transitions. [2020-10-20 01:49:22,728 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 6397 transitions. Word has length 58 [2020-10-20 01:49:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:22,729 INFO L481 AbstractCegarLoop]: Abstraction has 4381 states and 6397 transitions. [2020-10-20 01:49:22,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 6397 transitions. [2020-10-20 01:49:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-20 01:49:22,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:22,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:22,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:49:22,733 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1143608735, now seen corresponding path program 1 times [2020-10-20 01:49:22,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:22,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522917953] [2020-10-20 01:49:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:22,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522917953] [2020-10-20 01:49:22,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:22,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:22,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816262648] [2020-10-20 01:49:22,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:22,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:22,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:22,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:22,776 INFO L87 Difference]: Start difference. First operand 4381 states and 6397 transitions. Second operand 3 states. [2020-10-20 01:49:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:23,008 INFO L93 Difference]: Finished difference Result 9409 states and 13912 transitions. [2020-10-20 01:49:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:23,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-10-20 01:49:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:23,031 INFO L225 Difference]: With dead ends: 9409 [2020-10-20 01:49:23,032 INFO L226 Difference]: Without dead ends: 5051 [2020-10-20 01:49:23,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2020-10-20 01:49:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 3399. [2020-10-20 01:49:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2020-10-20 01:49:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 5031 transitions. [2020-10-20 01:49:23,207 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 5031 transitions. Word has length 59 [2020-10-20 01:49:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:23,208 INFO L481 AbstractCegarLoop]: Abstraction has 3399 states and 5031 transitions. [2020-10-20 01:49:23,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 5031 transitions. [2020-10-20 01:49:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:49:23,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:23,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:23,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:49:23,211 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1698583374, now seen corresponding path program 1 times [2020-10-20 01:49:23,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:23,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478719279] [2020-10-20 01:49:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:23,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478719279] [2020-10-20 01:49:23,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:23,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 01:49:23,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189334070] [2020-10-20 01:49:23,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:49:23,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:23,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:49:23,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:23,293 INFO L87 Difference]: Start difference. First operand 3399 states and 5031 transitions. Second operand 6 states. [2020-10-20 01:49:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:24,578 INFO L93 Difference]: Finished difference Result 16205 states and 23855 transitions. [2020-10-20 01:49:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-20 01:49:24,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-10-20 01:49:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:24,611 INFO L225 Difference]: With dead ends: 16205 [2020-10-20 01:49:24,612 INFO L226 Difference]: Without dead ends: 13025 [2020-10-20 01:49:24,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-10-20 01:49:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13025 states. [2020-10-20 01:49:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13025 to 4265. [2020-10-20 01:49:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4265 states. [2020-10-20 01:49:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 6289 transitions. [2020-10-20 01:49:25,130 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 6289 transitions. Word has length 61 [2020-10-20 01:49:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:25,130 INFO L481 AbstractCegarLoop]: Abstraction has 4265 states and 6289 transitions. [2020-10-20 01:49:25,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:49:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 6289 transitions. [2020-10-20 01:49:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-20 01:49:25,132 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:25,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:25,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:49:25,133 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1116999633, now seen corresponding path program 1 times [2020-10-20 01:49:25,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:25,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917471311] [2020-10-20 01:49:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:25,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917471311] [2020-10-20 01:49:25,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:25,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 01:49:25,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188663045] [2020-10-20 01:49:25,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 01:49:25,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:25,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 01:49:25,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:49:25,216 INFO L87 Difference]: Start difference. First operand 4265 states and 6289 transitions. Second operand 7 states. [2020-10-20 01:49:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:27,035 INFO L93 Difference]: Finished difference Result 25491 states and 37406 transitions. [2020-10-20 01:49:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-20 01:49:27,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-10-20 01:49:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:27,093 INFO L225 Difference]: With dead ends: 25491 [2020-10-20 01:49:27,094 INFO L226 Difference]: Without dead ends: 25489 [2020-10-20 01:49:27,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2020-10-20 01:49:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25489 states. [2020-10-20 01:49:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25489 to 4573. [2020-10-20 01:49:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4573 states. [2020-10-20 01:49:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 6699 transitions. [2020-10-20 01:49:27,779 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 6699 transitions. Word has length 62 [2020-10-20 01:49:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:27,779 INFO L481 AbstractCegarLoop]: Abstraction has 4573 states and 6699 transitions. [2020-10-20 01:49:27,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 01:49:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 6699 transitions. [2020-10-20 01:49:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-20 01:49:27,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:27,782 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:27,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:49:27,782 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:27,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash 490399450, now seen corresponding path program 1 times [2020-10-20 01:49:27,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:27,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825740383] [2020-10-20 01:49:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:27,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825740383] [2020-10-20 01:49:27,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:27,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:27,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334856192] [2020-10-20 01:49:27,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:27,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:27,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:27,821 INFO L87 Difference]: Start difference. First operand 4573 states and 6699 transitions. Second operand 3 states. [2020-10-20 01:49:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:28,105 INFO L93 Difference]: Finished difference Result 9620 states and 14052 transitions. [2020-10-20 01:49:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:28,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-10-20 01:49:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:28,115 INFO L225 Difference]: With dead ends: 9620 [2020-10-20 01:49:28,115 INFO L226 Difference]: Without dead ends: 5068 [2020-10-20 01:49:28,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2020-10-20 01:49:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4994. [2020-10-20 01:49:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2020-10-20 01:49:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 7280 transitions. [2020-10-20 01:49:28,480 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 7280 transitions. Word has length 77 [2020-10-20 01:49:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:28,480 INFO L481 AbstractCegarLoop]: Abstraction has 4994 states and 7280 transitions. [2020-10-20 01:49:28,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 7280 transitions. [2020-10-20 01:49:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-10-20 01:49:28,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:28,483 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:28,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:49:28,484 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1468083949, now seen corresponding path program 1 times [2020-10-20 01:49:28,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:28,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669717725] [2020-10-20 01:49:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:28,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669717725] [2020-10-20 01:49:28,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:28,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:49:28,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850493300] [2020-10-20 01:49:28,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:49:28,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:28,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:49:28,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:49:28,558 INFO L87 Difference]: Start difference. First operand 4994 states and 7280 transitions. Second operand 4 states. [2020-10-20 01:49:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:29,340 INFO L93 Difference]: Finished difference Result 13350 states and 19292 transitions. [2020-10-20 01:49:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:29,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-10-20 01:49:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:29,356 INFO L225 Difference]: With dead ends: 13350 [2020-10-20 01:49:29,357 INFO L226 Difference]: Without dead ends: 8256 [2020-10-20 01:49:29,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8256 states. [2020-10-20 01:49:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8256 to 7429. [2020-10-20 01:49:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2020-10-20 01:49:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 10640 transitions. [2020-10-20 01:49:29,801 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 10640 transitions. Word has length 88 [2020-10-20 01:49:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:29,802 INFO L481 AbstractCegarLoop]: Abstraction has 7429 states and 10640 transitions. [2020-10-20 01:49:29,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:49:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 10640 transitions. [2020-10-20 01:49:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-10-20 01:49:29,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:29,805 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:29,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:49:29,806 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash 175649853, now seen corresponding path program 1 times [2020-10-20 01:49:29,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:29,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731951799] [2020-10-20 01:49:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:29,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731951799] [2020-10-20 01:49:29,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:29,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:29,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522429020] [2020-10-20 01:49:29,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:29,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:29,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:29,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:29,848 INFO L87 Difference]: Start difference. First operand 7429 states and 10640 transitions. Second operand 3 states. [2020-10-20 01:49:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:30,163 INFO L93 Difference]: Finished difference Result 10736 states and 15421 transitions. [2020-10-20 01:49:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:30,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-10-20 01:49:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:30,170 INFO L225 Difference]: With dead ends: 10736 [2020-10-20 01:49:30,170 INFO L226 Difference]: Without dead ends: 3315 [2020-10-20 01:49:30,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2020-10-20 01:49:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3262. [2020-10-20 01:49:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-20 01:49:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4385 transitions. [2020-10-20 01:49:30,425 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4385 transitions. Word has length 95 [2020-10-20 01:49:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:30,426 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 4385 transitions. [2020-10-20 01:49:30,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4385 transitions. [2020-10-20 01:49:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-20 01:49:30,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:30,427 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:30,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:49:30,428 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1463950789, now seen corresponding path program 1 times [2020-10-20 01:49:30,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:30,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590067209] [2020-10-20 01:49:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:30,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590067209] [2020-10-20 01:49:30,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:30,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:30,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551785202] [2020-10-20 01:49:30,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:30,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:30,473 INFO L87 Difference]: Start difference. First operand 3262 states and 4385 transitions. Second operand 5 states. [2020-10-20 01:49:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:31,320 INFO L93 Difference]: Finished difference Result 12465 states and 16771 transitions. [2020-10-20 01:49:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 01:49:31,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-10-20 01:49:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:31,333 INFO L225 Difference]: With dead ends: 12465 [2020-10-20 01:49:31,333 INFO L226 Difference]: Without dead ends: 9377 [2020-10-20 01:49:31,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:49:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2020-10-20 01:49:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 3264. [2020-10-20 01:49:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2020-10-20 01:49:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4381 transitions. [2020-10-20 01:49:31,549 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4381 transitions. Word has length 98 [2020-10-20 01:49:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:31,550 INFO L481 AbstractCegarLoop]: Abstraction has 3264 states and 4381 transitions. [2020-10-20 01:49:31,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4381 transitions. [2020-10-20 01:49:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-20 01:49:31,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:31,554 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:31,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:49:31,554 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1371445226, now seen corresponding path program 1 times [2020-10-20 01:49:31,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:31,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990257755] [2020-10-20 01:49:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:31,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990257755] [2020-10-20 01:49:31,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123931545] [2020-10-20 01:49:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:31,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 01:49:31,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:49:31,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:31,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-10-20 01:49:31,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760626278] [2020-10-20 01:49:31,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:31,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:31,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:31,829 INFO L87 Difference]: Start difference. First operand 3264 states and 4381 transitions. Second operand 3 states. [2020-10-20 01:49:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:32,147 INFO L93 Difference]: Finished difference Result 3891 states and 5212 transitions. [2020-10-20 01:49:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:32,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-10-20 01:49:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:32,155 INFO L225 Difference]: With dead ends: 3891 [2020-10-20 01:49:32,155 INFO L226 Difference]: Without dead ends: 3887 [2020-10-20 01:49:32,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2020-10-20 01:49:32,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3837. [2020-10-20 01:49:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2020-10-20 01:49:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5136 transitions. [2020-10-20 01:49:32,513 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5136 transitions. Word has length 100 [2020-10-20 01:49:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:32,513 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5136 transitions. [2020-10-20 01:49:32,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5136 transitions. [2020-10-20 01:49:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-10-20 01:49:32,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:32,516 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:32,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-20 01:49:32,729 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:32,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:32,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1350491852, now seen corresponding path program 1 times [2020-10-20 01:49:32,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:32,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324625601] [2020-10-20 01:49:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:32,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324625601] [2020-10-20 01:49:32,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841405106] [2020-10-20 01:49:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:32,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 01:49:32,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:49:33,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:33,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-10-20 01:49:33,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695526543] [2020-10-20 01:49:33,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:33,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:33,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:33,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:33,031 INFO L87 Difference]: Start difference. First operand 3837 states and 5136 transitions. Second operand 3 states. [2020-10-20 01:49:33,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:33,426 INFO L93 Difference]: Finished difference Result 6823 states and 9177 transitions. [2020-10-20 01:49:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:33,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2020-10-20 01:49:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:33,434 INFO L225 Difference]: With dead ends: 6823 [2020-10-20 01:49:33,435 INFO L226 Difference]: Without dead ends: 2995 [2020-10-20 01:49:33,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:49:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-10-20 01:49:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2774. [2020-10-20 01:49:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2020-10-20 01:49:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3648 transitions. [2020-10-20 01:49:33,810 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3648 transitions. Word has length 152 [2020-10-20 01:49:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:33,810 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 3648 transitions. [2020-10-20 01:49:33,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3648 transitions. [2020-10-20 01:49:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-10-20 01:49:33,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:33,814 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:34,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-20 01:49:34,028 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:34,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1833127117, now seen corresponding path program 1 times [2020-10-20 01:49:34,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:34,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628263037] [2020-10-20 01:49:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-20 01:49:34,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628263037] [2020-10-20 01:49:34,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:34,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:49:34,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477752959] [2020-10-20 01:49:34,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:49:34,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:34,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:49:34,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:34,112 INFO L87 Difference]: Start difference. First operand 2774 states and 3648 transitions. Second operand 3 states. [2020-10-20 01:49:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:34,428 INFO L93 Difference]: Finished difference Result 3357 states and 4372 transitions. [2020-10-20 01:49:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:49:34,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-10-20 01:49:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:34,430 INFO L225 Difference]: With dead ends: 3357 [2020-10-20 01:49:34,430 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:49:34,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:49:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:49:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 633. [2020-10-20 01:49:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-10-20 01:49:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 680 transitions. [2020-10-20 01:49:34,491 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 680 transitions. Word has length 155 [2020-10-20 01:49:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:34,491 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 680 transitions. [2020-10-20 01:49:34,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:49:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 680 transitions. [2020-10-20 01:49:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-10-20 01:49:34,493 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:34,493 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:49:34,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:49:34,494 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:34,494 INFO L82 PathProgramCache]: Analyzing trace with hash 36210659, now seen corresponding path program 1 times [2020-10-20 01:49:34,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:34,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038543694] [2020-10-20 01:49:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:49:34,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038543694] [2020-10-20 01:49:34,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847104864] [2020-10-20 01:49:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:34,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 01:49:34,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 01:49:34,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 01:49:34,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-10-20 01:49:34,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951466365] [2020-10-20 01:49:34,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:34,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:34,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:49:34,792 INFO L87 Difference]: Start difference. First operand 633 states and 680 transitions. Second operand 5 states. [2020-10-20 01:49:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:34,897 INFO L93 Difference]: Finished difference Result 923 states and 990 transitions. [2020-10-20 01:49:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:49:34,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2020-10-20 01:49:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:34,899 INFO L225 Difference]: With dead ends: 923 [2020-10-20 01:49:34,899 INFO L226 Difference]: Without dead ends: 537 [2020-10-20 01:49:34,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-20 01:49:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-20 01:49:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-20 01:49:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-20 01:49:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 575 transitions. [2020-10-20 01:49:34,958 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 575 transitions. Word has length 158 [2020-10-20 01:49:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:34,959 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 575 transitions. [2020-10-20 01:49:34,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2020-10-20 01:49:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-10-20 01:49:34,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:34,961 INFO L422 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] [2020-10-20 01:49:35,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:35,174 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash -884011814, now seen corresponding path program 1 times [2020-10-20 01:49:35,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:35,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224073424] [2020-10-20 01:49:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-20 01:49:35,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224073424] [2020-10-20 01:49:35,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:35,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 01:49:35,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093192023] [2020-10-20 01:49:35,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 01:49:35,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 01:49:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:49:35,254 INFO L87 Difference]: Start difference. First operand 537 states and 575 transitions. Second operand 7 states. [2020-10-20 01:49:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:35,534 INFO L93 Difference]: Finished difference Result 1008 states and 1085 transitions. [2020-10-20 01:49:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 01:49:35,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2020-10-20 01:49:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:35,536 INFO L225 Difference]: With dead ends: 1008 [2020-10-20 01:49:35,536 INFO L226 Difference]: Without dead ends: 1006 [2020-10-20 01:49:35,537 INFO L677 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 [2020-10-20 01:49:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2020-10-20 01:49:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 535. [2020-10-20 01:49:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2020-10-20 01:49:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 572 transitions. [2020-10-20 01:49:35,607 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 572 transitions. Word has length 160 [2020-10-20 01:49:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:35,607 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 572 transitions. [2020-10-20 01:49:35,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 01:49:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 572 transitions. [2020-10-20 01:49:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-10-20 01:49:35,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:35,612 INFO L422 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] [2020-10-20 01:49:35,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:49:35,612 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:35,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1634039867, now seen corresponding path program 1 times [2020-10-20 01:49:35,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:35,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908455720] [2020-10-20 01:49:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-20 01:49:35,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908455720] [2020-10-20 01:49:35,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:49:35,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:49:35,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207355245] [2020-10-20 01:49:35,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:49:35,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:35,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:49:35,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:49:35,699 INFO L87 Difference]: Start difference. First operand 535 states and 572 transitions. Second operand 5 states. [2020-10-20 01:49:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:35,836 INFO L93 Difference]: Finished difference Result 748 states and 799 transitions. [2020-10-20 01:49:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 01:49:35,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2020-10-20 01:49:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:35,838 INFO L225 Difference]: With dead ends: 748 [2020-10-20 01:49:35,838 INFO L226 Difference]: Without dead ends: 644 [2020-10-20 01:49:35,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 01:49:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-10-20 01:49:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 527. [2020-10-20 01:49:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2020-10-20 01:49:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 559 transitions. [2020-10-20 01:49:35,892 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 559 transitions. Word has length 161 [2020-10-20 01:49:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:35,893 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 559 transitions. [2020-10-20 01:49:35,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:49:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 559 transitions. [2020-10-20 01:49:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-10-20 01:49:35,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:49:35,897 INFO L422 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] [2020-10-20 01:49:35,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:49:35,897 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:49:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:49:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2074229243, now seen corresponding path program 1 times [2020-10-20 01:49:35,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:49:35,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783498599] [2020-10-20 01:49:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:49:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:36,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783498599] [2020-10-20 01:49:36,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761277039] [2020-10-20 01:49:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:49:36,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 33 conjunts are in the unsatisfiable core [2020-10-20 01:49:36,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:49:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:49:36,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:49:36,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2020-10-20 01:49:36,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507619071] [2020-10-20 01:49:36,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-20 01:49:36,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:49:36,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-20 01:49:36,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-10-20 01:49:36,583 INFO L87 Difference]: Start difference. First operand 527 states and 559 transitions. Second operand 17 states. [2020-10-20 01:49:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:49:37,472 INFO L93 Difference]: Finished difference Result 836 states and 893 transitions. [2020-10-20 01:49:37,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-20 01:49:37,473 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 220 [2020-10-20 01:49:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:49:37,473 INFO L225 Difference]: With dead ends: 836 [2020-10-20 01:49:37,473 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:49:37,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2020-10-20 01:49:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:49:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:49:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:49:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:49:37,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2020-10-20 01:49:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:49:37,477 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:49:37,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-20 01:49:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:49:37,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:49:37,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 01:49:37,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:49:37,927 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 161 [2020-10-20 01:49:40,070 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 669 DAG size of output: 470 [2020-10-20 01:49:40,611 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-10-20 01:49:41,150 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 156 [2020-10-20 01:49:41,558 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-10-20 01:49:41,987 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 281 [2020-10-20 01:49:42,976 WARN L193 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 290 [2020-10-20 01:49:43,364 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-10-20 01:49:43,691 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-10-20 01:49:44,547 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-10-20 01:49:44,969 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 496 DAG size of output: 281 [2020-10-20 01:49:45,255 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 268 [2020-10-20 01:49:46,269 WARN L193 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 759 DAG size of output: 533 [2020-10-20 01:49:46,748 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-10-20 01:49:47,131 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 389 DAG size of output: 281 [2020-10-20 01:49:47,546 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-10-20 01:49:47,838 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 262 [2020-10-20 01:49:48,104 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 196 [2020-10-20 01:49:48,270 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 178 [2020-10-20 01:49:49,038 WARN L193 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-10-20 01:49:52,280 WARN L193 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 449 DAG size of output: 101 [2020-10-20 01:49:53,303 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-10-20 01:49:54,133 WARN L193 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 64 [2020-10-20 01:49:54,286 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-10-20 01:49:55,320 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-10-20 01:49:55,525 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2020-10-20 01:49:56,880 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 270 DAG size of output: 88 [2020-10-20 01:49:57,008 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-10-20 01:49:57,136 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-20 01:49:57,906 WARN L193 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-10-20 01:49:58,384 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 53 [2020-10-20 01:49:58,509 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-20 01:49:59,283 WARN L193 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-10-20 01:49:59,767 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 53 [2020-10-20 01:49:59,916 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-10-20 01:50:00,069 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2020-10-20 01:50:02,573 WARN L193 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 281 DAG size of output: 78 [2020-10-20 01:50:02,825 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-10-20 01:50:03,111 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2020-10-20 01:50:03,310 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-10-20 01:50:03,653 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-10-20 01:50:04,945 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-10-20 01:50:05,351 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-10-20 01:50:06,648 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-10-20 01:50:06,782 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-10-20 01:50:06,907 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-20 01:50:07,687 WARN L193 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-10-20 01:50:07,846 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-10-20 01:50:08,621 WARN L193 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-10-20 01:50:08,746 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-20 01:50:09,149 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-10-20 01:50:09,921 WARN L193 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 65 [2020-10-20 01:50:10,158 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-10-20 01:50:10,564 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-10-20 01:50:11,920 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-10-20 01:50:12,055 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-10-20 01:50:13,517 WARN L193 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 270 DAG size of output: 88 [2020-10-20 01:50:14,858 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 257 DAG size of output: 88 [2020-10-20 01:50:14,996 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-10-20 01:50:15,278 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2020-10-20 01:50:15,409 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-20 01:50:15,539 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-10-20 01:50:19,633 WARN L193 SmtUtils]: Spent 3.93 s on a formula simplification. DAG size of input: 514 DAG size of output: 99 [2020-10-20 01:50:20,048 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-10-20 01:50:20,281 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-10-20 01:50:20,856 WARN L193 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 69 [2020-10-20 01:50:20,993 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-10-20 01:50:21,414 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-10-20 01:50:21,550 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-10-20 01:50:21,842 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2020-10-20 01:50:22,924 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-10-20 01:50:23,034 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2020-10-20 01:50:23,137 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-10-20 01:50:23,355 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2020-10-20 01:50:23,843 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2020-10-20 01:50:25,258 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 270 DAG size of output: 88 [2020-10-20 01:50:25,486 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-10-20 01:50:25,715 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-20 01:50:26,381 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 57 [2020-10-20 01:50:26,991 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 52 [2020-10-20 01:50:27,298 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 49 [2020-10-20 01:50:28,366 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-10-20 01:50:30,261 WARN L193 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 256 DAG size of output: 73 [2020-10-20 01:50:30,475 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-10-20 01:50:31,563 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 194 DAG size of output: 69 [2020-10-20 01:50:32,023 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2020-10-20 01:50:33,119 WARN L193 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 62 [2020-10-20 01:50:33,126 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,127 INFO L270 CegarLoopResult]: At program point L630-2(lines 630 658) the Hoare annotation is: (let ((.cse4 (= ~req_tt_a~0 0)) (.cse15 (= ~m_run_pc~0 6)) (.cse17 (= ~c_empty_req~0 1)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse8 (= ~c_req_a~0 0)) (.cse10 (= ~c_req_type~0 0)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse16 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse16 .cse4 .cse6 .cse5 .cse7 .cse8 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 .cse17 .cse11 .cse12 (= ULTIMATE.start_s_run_~req_a~1 0) .cse13 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse14 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse15 .cse9 .cse17 .cse16 .cse6 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_m_run_~a~0 0) .cse13 .cse14) (and .cse9 .cse16 .cse5 .cse6 .cse13 .cse14))) [2020-10-20 01:50:33,127 INFO L270 CegarLoopResult]: At program point L763(lines 756 800) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-10-20 01:50:33,127 INFO L270 CegarLoopResult]: At program point L697(lines 690 716) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-10-20 01:50:33,128 INFO L274 CegarLoopResult]: For program point L631(lines 630 658) no Hoare annotation was computed. [2020-10-20 01:50:33,128 INFO L274 CegarLoopResult]: For program point L565(lines 565 569) no Hoare annotation was computed. [2020-10-20 01:50:33,128 INFO L274 CegarLoopResult]: For program point L103(lines 103 119) no Hoare annotation was computed. [2020-10-20 01:50:33,128 INFO L270 CegarLoopResult]: At program point L896(lines 870 897) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_req_type~0 1)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse11 (<= 50 ~c_req_d~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) .cse5 .cse6 (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse10 .cse5 (= ~s_run_pc~0 0) .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse11 .cse7 .cse8 .cse12))) [2020-10-20 01:50:33,128 INFO L274 CegarLoopResult]: For program point L632(lines 632 636) no Hoare annotation was computed. [2020-10-20 01:50:33,128 INFO L270 CegarLoopResult]: At program point L104(lines 93 835) the Hoare annotation is: (let ((.cse3 (= 2 ~s_run_pc~0))) (let ((.cse1 (= ~c_empty_req~0 1)) (.cse5 (<= 0 ~a_t~0)) (.cse14 (not (= ~c_req_type~0 0))) (.cse7 (= ~c_req_type~0 1)) (.cse10 (= ~c_req_a~0 0)) (.cse12 (= ~s_run_pc~0 0)) (.cse6 (<= 50 ~c_req_d~0)) (.cse15 (not .cse3)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse11 (<= ~c_req_d~0 50)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse13 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse8 (<= 2 ~c_write_req_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7 .cse2 .cse4 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse14 .cse15 .cse2 .cse4 .cse10) (and .cse5 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse13 .cse2 .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) .cse1 (= ~s_memory0~0 50) .cse6 .cse8 .cse9 .cse11) (and .cse5 .cse14 .cse2 .cse7 .cse4 .cse10 .cse12 .cse0 .cse6 .cse15 .cse8 .cse9 .cse11) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse8)))) [2020-10-20 01:50:33,129 INFO L270 CegarLoopResult]: At program point L170-2(lines 170 198) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 0)) (.cse8 (<= 0 ~a_t~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse6 (= ~m_run_pc~0 0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse9 .cse4 .cse10 .cse7 .cse11 .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse14 .cse6 .cse15) (and .cse8 .cse3 .cse9 (= 2 ~s_run_pc~0) .cse4 .cse10 .cse7 .cse11 .cse1 .cse12 .cse2 .cse13 .cse5 .cse14 .cse6 .cse15))) [2020-10-20 01:50:33,129 INFO L274 CegarLoopResult]: For program point L765(lines 765 769) no Hoare annotation was computed. [2020-10-20 01:50:33,129 INFO L274 CegarLoopResult]: For program point L699(lines 699 703) no Hoare annotation was computed. [2020-10-20 01:50:33,129 INFO L270 CegarLoopResult]: At program point L1294(lines 1287 1304) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,129 INFO L270 CegarLoopResult]: At program point L237(lines 230 256) the Hoare annotation is: (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse2 .cse9 (or (and .cse1 .cse5) (and .cse1 (= ~m_run_pc~0 3))) .cse3 (= 2 ~s_run_pc~0) .cse10 .cse6 .cse7 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (and .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11 .cse1 .cse0 .cse12 .cse13 .cse4 .cse5 .cse14 .cse15))) [2020-10-20 01:50:33,130 INFO L274 CegarLoopResult]: For program point L171(lines 170 198) no Hoare annotation was computed. [2020-10-20 01:50:33,130 INFO L270 CegarLoopResult]: At program point L964(lines 957 974) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-10-20 01:50:33,130 INFO L274 CegarLoopResult]: For program point L1295(lines 1247 1336) no Hoare annotation was computed. [2020-10-20 01:50:33,130 INFO L274 CegarLoopResult]: For program point L1229(lines 1229 1233) no Hoare annotation was computed. [2020-10-20 01:50:33,130 INFO L274 CegarLoopResult]: For program point L172(lines 172 176) no Hoare annotation was computed. [2020-10-20 01:50:33,130 INFO L274 CegarLoopResult]: For program point L106(lines 106 118) no Hoare annotation was computed. [2020-10-20 01:50:33,130 INFO L274 CegarLoopResult]: For program point L965(lines 957 974) no Hoare annotation was computed. [2020-10-20 01:50:33,130 INFO L270 CegarLoopResult]: At program point L437(lines 430 447) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,131 INFO L274 CegarLoopResult]: For program point L371(lines 371 375) no Hoare annotation was computed. [2020-10-20 01:50:33,131 INFO L274 CegarLoopResult]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2020-10-20 01:50:33,131 INFO L274 CegarLoopResult]: For program point L239(lines 239 243) no Hoare annotation was computed. [2020-10-20 01:50:33,131 INFO L274 CegarLoopResult]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2020-10-20 01:50:33,131 INFO L270 CegarLoopResult]: At program point L107(lines 93 835) the Hoare annotation is: false [2020-10-20 01:50:33,131 INFO L274 CegarLoopResult]: For program point L1164-2(lines 1162 1341) no Hoare annotation was computed. [2020-10-20 01:50:33,131 INFO L270 CegarLoopResult]: At program point L1032(lines 1025 1078) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-10-20 01:50:33,131 INFO L274 CegarLoopResult]: For program point L966(lines 966 970) no Hoare annotation was computed. [2020-10-20 01:50:33,132 INFO L274 CegarLoopResult]: For program point L438(lines 126 472) no Hoare annotation was computed. [2020-10-20 01:50:33,132 INFO L270 CegarLoopResult]: At program point L571(lines 564 608) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-10-20 01:50:33,132 INFO L274 CegarLoopResult]: For program point L439(lines 439 443) no Hoare annotation was computed. [2020-10-20 01:50:33,132 INFO L274 CegarLoopResult]: For program point L109(lines 109 117) no Hoare annotation was computed. [2020-10-20 01:50:33,132 INFO L274 CegarLoopResult]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2020-10-20 01:50:33,132 INFO L270 CegarLoopResult]: At program point L110(lines 93 835) the Hoare annotation is: false [2020-10-20 01:50:33,132 INFO L274 CegarLoopResult]: For program point L903(lines 903 956) no Hoare annotation was computed. [2020-10-20 01:50:33,133 INFO L270 CegarLoopResult]: At program point L771(lines 764 799) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-10-20 01:50:33,133 INFO L270 CegarLoopResult]: At program point L705(lines 698 715) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-10-20 01:50:33,133 INFO L274 CegarLoopResult]: For program point L573(lines 573 577) no Hoare annotation was computed. [2020-10-20 01:50:33,133 INFO L277 CegarLoopResult]: At program point L1366(lines 1343 1368) the Hoare annotation is: true [2020-10-20 01:50:33,133 INFO L270 CegarLoopResult]: At program point L309(lines 279 310) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,133 INFO L274 CegarLoopResult]: For program point L904(lines 904 908) no Hoare annotation was computed. [2020-10-20 01:50:33,133 INFO L274 CegarLoopResult]: For program point L706(lines 477 829) no Hoare annotation was computed. [2020-10-20 01:50:33,133 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,134 INFO L270 CegarLoopResult]: At program point L1235(lines 1228 1245) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-10-20 01:50:33,134 INFO L274 CegarLoopResult]: For program point L1169-1(lines 1162 1341) no Hoare annotation was computed. [2020-10-20 01:50:33,134 INFO L274 CegarLoopResult]: For program point L112(lines 112 116) no Hoare annotation was computed. [2020-10-20 01:50:33,134 INFO L274 CegarLoopResult]: For program point L773(lines 773 777) no Hoare annotation was computed. [2020-10-20 01:50:33,134 INFO L274 CegarLoopResult]: For program point L707(lines 707 711) no Hoare annotation was computed. [2020-10-20 01:50:33,134 INFO L270 CegarLoopResult]: At program point L377(lines 370 387) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,134 INFO L270 CegarLoopResult]: At program point L245(lines 238 255) the Hoare annotation is: (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse2 .cse9 (or (and .cse1 .cse5) (and .cse1 (= ~m_run_pc~0 3))) .cse3 (= 2 ~s_run_pc~0) .cse10 .cse6 .cse7 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (and .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11 .cse1 .cse0 .cse12 .cse13 .cse4 .cse5 .cse14 .cse15))) [2020-10-20 01:50:33,135 INFO L270 CegarLoopResult]: At program point L113(lines 93 835) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse6 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse7 (= ~c_req_a~0 0)) (.cse8 (= ~c_req_type~0 0)) (.cse10 (= ~s_memory0~0 50)) (.cse9 (= ~c_empty_req~0 1)) (.cse0 (= ~m_run_pc~0 6)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse8 .cse9 (= ~c_rsp_d~0 50) .cse10 (= ULTIMATE.start_s_run_~req_a~1 0) .cse11 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse12 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse9 .cse2 .cse4 .cse5 .cse11) (and .cse0 .cse13 .cse2 .cse4 .cse5 .cse11 .cse12))) [2020-10-20 01:50:33,135 INFO L274 CegarLoopResult]: For program point L378(lines 370 387) no Hoare annotation was computed. [2020-10-20 01:50:33,135 INFO L274 CegarLoopResult]: For program point L246(lines 126 472) no Hoare annotation was computed. [2020-10-20 01:50:33,135 INFO L274 CegarLoopResult]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2020-10-20 01:50:33,135 INFO L274 CegarLoopResult]: For program point L379(lines 379 383) no Hoare annotation was computed. [2020-10-20 01:50:33,135 INFO L274 CegarLoopResult]: For program point L247(lines 247 251) no Hoare annotation was computed. [2020-10-20 01:50:33,135 INFO L270 CegarLoopResult]: At program point L1040(lines 1033 1077) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-10-20 01:50:33,136 INFO L270 CegarLoopResult]: At program point L579(lines 572 607) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-10-20 01:50:33,136 INFO L274 CegarLoopResult]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2020-10-20 01:50:33,136 INFO L270 CegarLoopResult]: At program point L910(lines 903 956) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-10-20 01:50:33,136 INFO L274 CegarLoopResult]: For program point L316(lines 316 369) no Hoare annotation was computed. [2020-10-20 01:50:33,136 INFO L274 CegarLoopResult]: For program point L1175(lines 1175 1179) no Hoare annotation was computed. [2020-10-20 01:50:33,136 INFO L274 CegarLoopResult]: For program point L977(lines 977 991) no Hoare annotation was computed. [2020-10-20 01:50:33,136 INFO L270 CegarLoopResult]: At program point L779(lines 772 798) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-10-20 01:50:33,137 INFO L274 CegarLoopResult]: For program point L581(lines 581 585) no Hoare annotation was computed. [2020-10-20 01:50:33,137 INFO L274 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-10-20 01:50:33,137 INFO L274 CegarLoopResult]: For program point L912(lines 912 916) no Hoare annotation was computed. [2020-10-20 01:50:33,137 INFO L270 CegarLoopResult]: At program point L516(lines 486 517) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,137 INFO L274 CegarLoopResult]: For program point L781(lines 781 785) no Hoare annotation was computed. [2020-10-20 01:50:33,137 INFO L274 CegarLoopResult]: For program point L1310(lines 1310 1314) no Hoare annotation was computed. [2020-10-20 01:50:33,137 INFO L274 CegarLoopResult]: For program point L1112(lines 1111 1152) no Hoare annotation was computed. [2020-10-20 01:50:33,137 INFO L274 CegarLoopResult]: For program point L453(lines 453 457) no Hoare annotation was computed. [2020-10-20 01:50:33,138 INFO L270 CegarLoopResult]: At program point L123(lines 93 835) the Hoare annotation is: (let ((.cse6 (= 2 ~s_run_pc~0))) (let ((.cse1 (<= 0 ~a_t~0)) (.cse2 (= ~c_req_type~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_a~0 0)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse12 (not .cse6)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse3 .cse4 .cse12 .cse5 .cse8 .cse9)))) [2020-10-20 01:50:33,138 INFO L270 CegarLoopResult]: At program point L1048(lines 1041 1076) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-10-20 01:50:33,138 INFO L270 CegarLoopResult]: At program point L520-2(lines 520 548) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,138 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:50:33,138 INFO L270 CegarLoopResult]: At program point L1181(lines 1174 1227) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-10-20 01:50:33,138 INFO L274 CegarLoopResult]: For program point L58(lines 58 61) no Hoare annotation was computed. [2020-10-20 01:50:33,138 INFO L274 CegarLoopResult]: For program point L983(lines 983 990) no Hoare annotation was computed. [2020-10-20 01:50:33,139 INFO L270 CegarLoopResult]: At program point L587(lines 580 606) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-10-20 01:50:33,139 INFO L274 CegarLoopResult]: For program point L521(lines 520 548) no Hoare annotation was computed. [2020-10-20 01:50:33,139 INFO L274 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2020-10-20 01:50:33,139 INFO L270 CegarLoopResult]: At program point L389-1(lines 389 395) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,139 INFO L270 CegarLoopResult]: At program point L323(lines 316 369) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,139 INFO L274 CegarLoopResult]: For program point L1248(line 1248) no Hoare annotation was computed. [2020-10-20 01:50:33,140 INFO L274 CegarLoopResult]: For program point L1116(lines 1116 1120) no Hoare annotation was computed. [2020-10-20 01:50:33,140 INFO L274 CegarLoopResult]: For program point L1116-1(lines 1111 1152) no Hoare annotation was computed. [2020-10-20 01:50:33,140 INFO L274 CegarLoopResult]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2020-10-20 01:50:33,140 INFO L270 CegarLoopResult]: At program point L918(lines 911 955) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-10-20 01:50:33,140 INFO L274 CegarLoopResult]: For program point L522(lines 522 526) no Hoare annotation was computed. [2020-10-20 01:50:33,140 INFO L274 CegarLoopResult]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2020-10-20 01:50:33,140 INFO L270 CegarLoopResult]: At program point L126-2(lines 126 472) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse2 (<= 0 ~a_t~0)) (.cse3 (= ~c_req_type~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse11 (= ~c_req_a~0 0)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse4 (= ~c_empty_req~0 1)) (.cse12 (not (= ~s_run_st~0 0))) (.cse5 (not .cse13)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ULTIMATE.start_m_run_~a~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse10 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse12 .cse6 .cse13 (= ~m_run_pc~0 3) .cse10 (= ULTIMATE.start_s_memory_write_~v 50) .cse1 .cse4 (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) .cse8 (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse4 .cse12 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2020-10-20 01:50:33,141 INFO L274 CegarLoopResult]: For program point L853(lines 853 865) no Hoare annotation was computed. [2020-10-20 01:50:33,141 INFO L270 CegarLoopResult]: At program point L787(lines 780 797) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-10-20 01:50:33,141 INFO L274 CegarLoopResult]: For program point L721(lines 721 725) no Hoare annotation was computed. [2020-10-20 01:50:33,141 INFO L274 CegarLoopResult]: For program point L589(lines 589 593) no Hoare annotation was computed. [2020-10-20 01:50:33,141 INFO L274 CegarLoopResult]: For program point L325(lines 325 329) no Hoare annotation was computed. [2020-10-20 01:50:33,141 INFO L270 CegarLoopResult]: At program point L1316(lines 1309 1326) the Hoare annotation is: (let ((.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse17 (= ~m_run_pc~0 6)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,141 INFO L274 CegarLoopResult]: For program point L127(lines 126 472) no Hoare annotation was computed. [2020-10-20 01:50:33,141 INFO L274 CegarLoopResult]: For program point L920(lines 920 924) no Hoare annotation was computed. [2020-10-20 01:50:33,142 INFO L274 CegarLoopResult]: For program point L788(lines 477 829) no Hoare annotation was computed. [2020-10-20 01:50:33,142 INFO L274 CegarLoopResult]: For program point L1317(lines 1247 1336) no Hoare annotation was computed. [2020-10-20 01:50:33,142 INFO L274 CegarLoopResult]: For program point L128(lines 128 132) no Hoare annotation was computed. [2020-10-20 01:50:33,142 INFO L274 CegarLoopResult]: For program point L789(lines 789 793) no Hoare annotation was computed. [2020-10-20 01:50:33,142 INFO L270 CegarLoopResult]: At program point L459(lines 452 469) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,142 INFO L274 CegarLoopResult]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2020-10-20 01:50:33,142 INFO L274 CegarLoopResult]: For program point L261(lines 261 265) no Hoare annotation was computed. [2020-10-20 01:50:33,142 INFO L270 CegarLoopResult]: At program point L63(lines 54 64) the Hoare annotation is: (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_memory_read_~i 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50)) [2020-10-20 01:50:33,142 INFO L274 CegarLoopResult]: For program point L856(lines 856 864) no Hoare annotation was computed. [2020-10-20 01:50:33,143 INFO L274 CegarLoopResult]: For program point L460(lines 452 469) no Hoare annotation was computed. [2020-10-20 01:50:33,143 INFO L270 CegarLoopResult]: At program point L857(lines 852 1103) the Hoare annotation is: false [2020-10-20 01:50:33,143 INFO L270 CegarLoopResult]: At program point L659(lines 629 660) the Hoare annotation is: (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50)) [2020-10-20 01:50:33,143 INFO L274 CegarLoopResult]: For program point L461(lines 461 465) no Hoare annotation was computed. [2020-10-20 01:50:33,143 INFO L270 CegarLoopResult]: At program point L1122(lines 1111 1152) the Hoare annotation is: (let ((.cse15 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse16 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (= ~m_run_pc~0 6)) (.cse17 (= ~req_tt_a~0 0)) (.cse18 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse20 (= ~s_memory0~0 50)) (.cse21 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse7 (= ~s_run_pc~0 0)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse23 (<= 50 ~c_req_d~0)) (.cse25 (= ~c_req_type~0 1)) (.cse12 (<= 1 ~c_m_lock~0)) (.cse24 (<= ~c_req_d~0 50)) (.cse14 (<= 0 ~a_t~0)) (.cse19 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse8 (= ~m_run_st~0 0)) (.cse9 (= ~m_run_pc~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (= ~c_req_a~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse22 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse8 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse4 .cse5 .cse18 .cse11 .cse1 .cse19 .cse20 .cse21 .cse6 .cse12) (and .cse15 .cse13 .cse14 .cse16 .cse3 .cse5 .cse4 .cse22 .cse18 .cse2 .cse8 .cse20 .cse23 .cse6 .cse12 .cse24) (and .cse7 .cse1 .cse3 (not .cse19) .cse5 .cse22 .cse11) (and .cse0 .cse13 .cse14 .cse3 .cse17 .cse4 .cse5 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 50) .cse11 (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse19 .cse2 .cse8 .cse20 .cse21 (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) .cse12) (and .cse1 .cse2 .cse4 .cse5 .cse22) (and .cse7 .cse1 .cse14 .cse19 .cse2 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse7 .cse1 .cse13 .cse14 .cse23 .cse5 .cse25 .cse22 .cse6 .cse12 .cse11 .cse24) (and .cse1 .cse13 .cse14 .cse23 .cse5 .cse4 .cse25 .cse22 .cse6 .cse12 .cse11 .cse24) (and .cse1 .cse14 .cse19 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse1 .cse3 .cse5 .cse4 .cse6 .cse22))) [2020-10-20 01:50:33,144 INFO L270 CegarLoopResult]: At program point L1056(lines 1049 1075) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-10-20 01:50:33,144 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:50:33,144 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,144 INFO L274 CegarLoopResult]: For program point L1255(lines 1255 1308) no Hoare annotation was computed. [2020-10-20 01:50:33,144 INFO L270 CegarLoopResult]: At program point L1189(lines 1182 1226) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-10-20 01:50:33,144 INFO L274 CegarLoopResult]: For program point L859(lines 859 863) no Hoare annotation was computed. [2020-10-20 01:50:33,144 INFO L270 CegarLoopResult]: At program point L727(lines 720 737) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-10-20 01:50:33,145 INFO L270 CegarLoopResult]: At program point L595(lines 588 605) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 0)) (and .cse0 (= ~m_run_pc~0 3)))) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-10-20 01:50:33,145 INFO L270 CegarLoopResult]: At program point L331(lines 324 368) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,145 INFO L274 CegarLoopResult]: For program point L1256(lines 1256 1260) no Hoare annotation was computed. [2020-10-20 01:50:33,145 INFO L270 CegarLoopResult]: At program point L199(lines 169 200) the Hoare annotation is: (let ((.cse6 (= ~s_run_pc~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse1 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_req_a~0 0)) (.cse4 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse10 (= ULTIMATE.start_m_run_~a~0 0)) (.cse11 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse6 .cse7 .cse14 .cse2 .cse10 .cse12 .cse4 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse1 .cse14 .cse2 (= 2 ~s_run_pc~0) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-10-20 01:50:33,145 INFO L274 CegarLoopResult]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2020-10-20 01:50:33,146 INFO L270 CegarLoopResult]: At program point L926(lines 919 954) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-10-20 01:50:33,146 INFO L270 CegarLoopResult]: At program point L860(lines 852 1103) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse5 (= ~c_req_a~0 0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse9 (= ~m_run_pc~0 3))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (= ~req_tt_a~0 0) .cse3 .cse4 (= ULTIMATE.start_s_memory_write_~v 50) .cse5 .cse6 (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_req_type~0 1) .cse9 .cse5 .cse6 (<= 50 ~c_req_d~0) .cse7 .cse8 (<= ~c_req_d~0 50)) (and .cse6 (= ~c_empty_req~0 1) .cse2 .cse3 .cse4 .cse9))) [2020-10-20 01:50:33,146 INFO L274 CegarLoopResult]: For program point L728(lines 720 737) no Hoare annotation was computed. [2020-10-20 01:50:33,146 INFO L274 CegarLoopResult]: For program point L596(lines 477 829) no Hoare annotation was computed. [2020-10-20 01:50:33,146 INFO L274 CegarLoopResult]: For program point L398(lines 398 451) no Hoare annotation was computed. [2020-10-20 01:50:33,146 INFO L274 CegarLoopResult]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2020-10-20 01:50:33,146 INFO L274 CegarLoopResult]: For program point L68(lines 68 71) no Hoare annotation was computed. [2020-10-20 01:50:33,146 INFO L274 CegarLoopResult]: For program point L993-1(lines 868 1098) no Hoare annotation was computed. [2020-10-20 01:50:33,146 INFO L274 CegarLoopResult]: For program point L729(lines 729 733) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L597(lines 597 601) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L399(lines 399 403) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L333(lines 333 337) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L270 CegarLoopResult]: At program point L267(lines 260 277) the Hoare annotation is: (let ((.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~s_run_pc~0 0)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0)) (and .cse3 .cse0 .cse1 (not (= ~c_req_type~0 0)) .cse2 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_m_run_~req_d~0) .cse2 (= ~c_req_type~0 1) .cse6 .cse7 (= ULTIMATE.start_m_run_~req_type~0 1) .cse0 .cse3 (<= 50 ~c_req_d~0) (<= ULTIMATE.start_m_run_~req_d~0 50) .cse4 .cse5 (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)))) [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L1126(lines 1126 1133) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L994(lines 993 1017) no Hoare annotation was computed. [2020-10-20 01:50:33,147 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L928(lines 928 932) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L3-4(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L268(lines 260 277) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L995(lines 995 999) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L269(lines 269 273) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L270 CegarLoopResult]: At program point L137-2(lines 137 165) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse3 (not (= ~s_run_st~0 0))) (.cse11 (<= 0 ~a_t~0)) (.cse12 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse14 (= ~c_req_a~0 0)) (.cse9 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse10 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse15 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse16 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (not .cse13)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse12 .cse13 .cse6 .cse8 .cse14 .cse9 .cse15 .cse1 .cse16 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse11 .cse12 .cse6 .cse8 .cse14 .cse9 .cse10 .cse15 .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse5 .cse18 .cse7)))) [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L666(lines 666 719) no Hoare annotation was computed. [2020-10-20 01:50:33,148 INFO L274 CegarLoopResult]: For program point L138(lines 137 165) no Hoare annotation was computed. [2020-10-20 01:50:33,149 INFO L274 CegarLoopResult]: For program point L667(lines 667 671) no Hoare annotation was computed. [2020-10-20 01:50:33,149 INFO L270 CegarLoopResult]: At program point L1262(lines 1255 1308) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,149 INFO L274 CegarLoopResult]: For program point L139(lines 139 143) no Hoare annotation was computed. [2020-10-20 01:50:33,149 INFO L270 CegarLoopResult]: At program point L1064(lines 1057 1074) the Hoare annotation is: (let ((.cse8 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse9 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (= 2 ~s_run_pc~0)) (.cse10 (= ~m_run_pc~0 3)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse4 (= ~c_empty_req~0 1)) (.cse5 (= ~s_memory0~0 50)) (.cse11 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse8 .cse0 .cse1 .cse9 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse10 (= ULTIMATE.start_s_run_~req_type~1 1) .cse3 (= ~s_run_pc~0 0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12))) [2020-10-20 01:50:33,149 INFO L274 CegarLoopResult]: For program point L206(lines 206 259) no Hoare annotation was computed. [2020-10-20 01:50:33,150 INFO L270 CegarLoopResult]: At program point L1197(lines 1190 1225) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-10-20 01:50:33,150 INFO L274 CegarLoopResult]: For program point L1065(lines 868 1098) no Hoare annotation was computed. [2020-10-20 01:50:33,150 INFO L270 CegarLoopResult]: At program point L405(lines 398 451) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,150 INFO L270 CegarLoopResult]: At program point L339(lines 332 367) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,150 INFO L274 CegarLoopResult]: For program point L1330(lines 1330 1334) no Hoare annotation was computed. [2020-10-20 01:50:33,150 INFO L274 CegarLoopResult]: For program point L1330-1(lines 1162 1341) no Hoare annotation was computed. [2020-10-20 01:50:33,150 INFO L274 CegarLoopResult]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2020-10-20 01:50:33,150 INFO L274 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-10-20 01:50:33,151 INFO L274 CegarLoopResult]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2020-10-20 01:50:33,151 INFO L270 CegarLoopResult]: At program point L934(lines 927 953) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-10-20 01:50:33,151 INFO L270 CegarLoopResult]: At program point L868-1(lines 852 1103) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse6 (= ~s_memory0~0 50)) (.cse12 (= ~c_req_type~0 0)) (.cse5 (= ~c_empty_req~0 1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~m_run_pc~0 3)) (.cse11 (= ~c_req_a~0 0)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse7 (<= 50 ~c_req_d~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 1 ~c_m_lock~0)) (.cse10 (<= ~c_req_d~0 50))) (or (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) .cse2 .cse4 .cse11 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse12 .cse5 .cse6 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse8 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse9 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse1 .cse12 .cse5 .cse14 .cse2 .cse8 (= ~m_run_pc~0 0) (not (= ~c_m_lock~0 1)) .cse11) (and .cse0 .cse1 .cse14 (= ~c_req_type~0 1) .cse2 .cse3 .cse11 (= ~s_run_pc~0 0) .cse13 .cse7 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,151 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,151 INFO L274 CegarLoopResult]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2020-10-20 01:50:33,151 INFO L274 CegarLoopResult]: For program point L803(lines 803 807) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L270 CegarLoopResult]: At program point L473(lines 125 474) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point L407(lines 407 411) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point L936(lines 936 940) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-10-20 01:50:33,152 INFO L274 CegarLoopResult]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-10-20 01:50:33,153 INFO L274 CegarLoopResult]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-10-20 01:50:33,153 INFO L274 CegarLoopResult]: For program point L871-1(lines 868 1098) no Hoare annotation was computed. [2020-10-20 01:50:33,153 INFO L274 CegarLoopResult]: For program point L739(lines 739 745) no Hoare annotation was computed. [2020-10-20 01:50:33,153 INFO L270 CegarLoopResult]: At program point L739-1(lines 739 745) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-10-20 01:50:33,153 INFO L270 CegarLoopResult]: At program point L673(lines 666 719) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-10-20 01:50:33,153 INFO L270 CegarLoopResult]: At program point L13-3(lines 1 1368) the Hoare annotation is: (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_memory_read_~i 0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50)) [2020-10-20 01:50:33,154 INFO L270 CegarLoopResult]: At program point L13-4(lines 66 74) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse8 (= ULTIMATE.start_s_memory_write_~i 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse11 (= ~s_memory0~0 50)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~s_run_st~0 0)) .cse4 (= ~c_req_type~0 1) .cse5 .cse6 .cse7 .cse8 (= ~s_run_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 .cse6 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-10-20 01:50:33,154 INFO L274 CegarLoopResult]: For program point L872(lines 871 895) no Hoare annotation was computed. [2020-10-20 01:50:33,154 INFO L270 CegarLoopResult]: At program point L1137(lines 1111 1152) the Hoare annotation is: (let ((.cse15 (= ~m_run_pc~0 6)) (.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse17 (= ~req_tt_a~0 0)) (.cse8 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse10 (= ~s_memory0~0 50)) (.cse20 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse19 (= ~c_req_type~0 0)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse11 (<= 50 ~c_req_d~0)) (.cse24 (= ~c_req_type~0 1)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= ~c_req_d~0 50)) (.cse23 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse21 (= ~m_run_pc~0 0)) (.cse22 (not (= ~c_m_lock~0 1))) (.cse18 (= ~c_req_a~0 0)) (.cse16 (= ~c_empty_rsp~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse7 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse9 .cse4 .cse6 .cse5 .cse12) (and .cse15 .cse1 .cse2 .cse4 .cse17 .cse5 .cse6 .cse8 .cse18 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse19 .cse9 .cse10 (= ULTIMATE.start_s_run_~req_a~1 0) .cse20 .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse15 .cse16 .cse4 .cse6 .cse5 .cse12 .cse13) (and .cse16 .cse2 .cse19 .cse9 .cse4 .cse6 .cse5 .cse12 .cse21 .cse22 .cse18) (and .cse15 .cse1 .cse2 .cse0 .cse3 .cse17 .cse6 .cse5 .cse8 .cse18 .cse16 .cse19 .cse10 .cse20 .cse12 .cse13) (and .cse23 .cse16 .cse4 (not .cse19) .cse5 .cse7 .cse18) (and .cse16 .cse9 .cse6 .cse5 .cse7) (and .cse23 .cse16 .cse2 .cse19 .cse9 .cse5 .cse12 .cse21 .cse22 .cse18) (and .cse23 .cse16 .cse1 .cse2 .cse11 .cse5 .cse24 .cse7 .cse12 .cse13 .cse18 .cse14) (and .cse16 .cse1 .cse2 .cse11 .cse5 .cse6 .cse24 .cse7 .cse12 .cse13 .cse18 .cse14) (and .cse23 .cse16 .cse9 .cse4 .cse5 .cse21 .cse22 .cse18) (and .cse16 .cse4 .cse5 .cse6 .cse12 .cse7))) [2020-10-20 01:50:33,154 INFO L274 CegarLoopResult]: For program point L873(lines 873 877) no Hoare annotation was computed. [2020-10-20 01:50:33,154 INFO L274 CegarLoopResult]: For program point L675(lines 675 679) no Hoare annotation was computed. [2020-10-20 01:50:33,154 INFO L270 CegarLoopResult]: At program point L477-2(lines 477 829) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= 2 ~s_run_pc~0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse0 (= ~c_empty_rsp~0 1)) (.cse2 (= ~c_empty_req~0 1)) (.cse6 (<= 2 ~c_write_req_ev~0))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 ULTIMATE.start_m_run_~a~0)) (and .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 .cse5 .cse4 (= ~m_run_pc~0 3) .cse7 (= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse2 (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= ULTIMATE.start_m_run_~a~0 0) .cse6 (<= ~c_req_d~0 50)))) [2020-10-20 01:50:33,155 INFO L270 CegarLoopResult]: At program point L1270(lines 1263 1307) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,155 INFO L270 CegarLoopResult]: At program point L213(lines 206 259) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse1 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse15 (not (= ~c_req_type~0 0)) .cse3 .cse11 .cse12 .cse4 .cse5 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse15 .cse1 (= 2 ~s_run_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2020-10-20 01:50:33,155 INFO L274 CegarLoopResult]: For program point L478(lines 477 829) no Hoare annotation was computed. [2020-10-20 01:50:33,155 INFO L277 CegarLoopResult]: At program point L1337(lines 1159 1342) the Hoare annotation is: true [2020-10-20 01:50:33,155 INFO L270 CegarLoopResult]: At program point L280-2(lines 280 308) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0))) (let ((.cse13 (= ~c_empty_req~0 1)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (not (= ~s_run_st~0 0))) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse16 (not (= ~c_req_type~0 0))) (.cse6 (= ~c_req_type~0 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (<= 50 ~c_req_d~0)) (.cse15 (not .cse5)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse8 (<= 1 ~c_m_lock~0)) (.cse10 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse4 .cse5 .cse7) (and .cse1 .cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse11 .cse4 .cse5 .cse12 (= ULTIMATE.start_s_memory_write_~v 50) .cse13 (= ~s_memory0~0 50) .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse12) (and .cse14 .cse0 .cse11 .cse15 .cse16 .cse4 .cse9) (and .cse1 .cse2 .cse16 .cse6 .cse4 .cse9 .cse14 .cse0 .cse3 .cse15 .cse7 .cse8 .cse10)))) [2020-10-20 01:50:33,156 INFO L270 CegarLoopResult]: At program point L1205(lines 1198 1224) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-10-20 01:50:33,156 INFO L270 CegarLoopResult]: At program point L809(lines 802 819) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-10-20 01:50:33,156 INFO L274 CegarLoopResult]: For program point L611(lines 611 615) no Hoare annotation was computed. [2020-10-20 01:50:33,156 INFO L274 CegarLoopResult]: For program point L479(lines 479 483) no Hoare annotation was computed. [2020-10-20 01:50:33,156 INFO L270 CegarLoopResult]: At program point L413(lines 406 450) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,156 INFO L270 CegarLoopResult]: At program point L347(lines 340 366) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,156 INFO L274 CegarLoopResult]: For program point L281(lines 280 308) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L215(lines 215 219) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L270 CegarLoopResult]: At program point L942(lines 935 952) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse13 (<= 50 ~c_req_d~0)) (.cse16 (<= ~c_req_d~0 50)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse4 (not (= ~s_run_st~0 0))) (.cse17 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_req_a~0 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~m_run_pc~0 6) .cse1 .cse2 .cse4 (= ~req_tt_a~0 0) .cse17 .cse5 (= ULTIMATE.start_s_memory_write_~v 50) .cse9 (= ULTIMATE.start_s_run_~req_type~1 0) .cse10 (= ~c_req_type~0 0) .cse11 (= ~s_memory0~0 50) .cse12 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse14 .cse15))) [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L810(lines 802 819) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L1141(lines 1141 1148) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L943(lines 868 1098) no Hoare annotation was computed. [2020-10-20 01:50:33,157 INFO L274 CegarLoopResult]: For program point L811(lines 811 815) no Hoare annotation was computed. [2020-10-20 01:50:33,158 INFO L274 CegarLoopResult]: For program point L415(lines 415 419) no Hoare annotation was computed. [2020-10-20 01:50:33,158 INFO L274 CegarLoopResult]: For program point L349(lines 349 353) no Hoare annotation was computed. [2020-10-20 01:50:33,158 INFO L274 CegarLoopResult]: For program point L944(lines 944 948) no Hoare annotation was computed. [2020-10-20 01:50:33,158 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:50:33,158 INFO L270 CegarLoopResult]: At program point L681(lines 674 718) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-10-20 01:50:33,158 INFO L270 CegarLoopResult]: At program point L549(lines 519 550) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,158 INFO L274 CegarLoopResult]: For program point L748(lines 748 801) no Hoare annotation was computed. [2020-10-20 01:50:33,158 INFO L274 CegarLoopResult]: For program point L749(lines 749 753) no Hoare annotation was computed. [2020-10-20 01:50:33,159 INFO L274 CegarLoopResult]: For program point L683(lines 683 687) no Hoare annotation was computed. [2020-10-20 01:50:33,159 INFO L270 CegarLoopResult]: At program point L617(lines 610 627) the Hoare annotation is: (and (= ~c_empty_rsp~0 1) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (<= 1 ~c_m_lock~0)) [2020-10-20 01:50:33,159 INFO L270 CegarLoopResult]: At program point L1278(lines 1271 1306) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,159 INFO L270 CegarLoopResult]: At program point L221(lines 214 258) the Hoare annotation is: (let ((.cse7 (= ~s_run_pc~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse1 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_req_a~0 0)) (.cse5 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse8 .cse15 (not (= ~c_req_type~0 0)) .cse3 .cse11 .cse12 .cse4 .cse5 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse15 .cse1 (= 2 ~s_run_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2020-10-20 01:50:33,159 INFO L274 CegarLoopResult]: For program point L1080(lines 1080 1084) no Hoare annotation was computed. [2020-10-20 01:50:33,159 INFO L274 CegarLoopResult]: For program point L618(lines 610 627) no Hoare annotation was computed. [2020-10-20 01:50:33,160 INFO L270 CegarLoopResult]: At program point L1213(lines 1206 1223) the Hoare annotation is: (let ((.cse0 (= ~c_empty_rsp~0 1)) (.cse1 (= ~c_empty_req~0 1)) (.cse2 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 (= ~m_run_pc~0 ~s_run_pc~0) .cse3 .cse4 .cse5) (and (= ~s_run_pc~0 0) .cse0 (<= 0 ~a_t~0) (= ~c_req_type~0 0) .cse1 .cse2 .cse3 (<= 2 ~c_write_req_ev~0) .cse4 .cse5))) [2020-10-20 01:50:33,160 INFO L274 CegarLoopResult]: For program point L619(lines 619 623) no Hoare annotation was computed. [2020-10-20 01:50:33,160 INFO L270 CegarLoopResult]: At program point L421(lines 414 449) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,160 INFO L270 CegarLoopResult]: At program point L487-2(lines 487 515) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,160 INFO L270 CegarLoopResult]: At program point L355(lines 348 365) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,160 INFO L274 CegarLoopResult]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2020-10-20 01:50:33,160 INFO L274 CegarLoopResult]: For program point L223(lines 223 227) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L1214(lines 1162 1341) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L488(lines 487 515) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L356(lines 126 472) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L423(lines 423 427) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L270 CegarLoopResult]: At program point L1018(lines 992 1019) the Hoare annotation is: (let ((.cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse2 (<= 0 ~a_t~0)) (.cse3 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse13 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse14 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ~s_memory0~0 50)) (.cse9 (<= 50 ~c_req_d~0)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0)) (.cse12 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~s_run_st~0 0)) .cse4 (= ~c_req_type~0 1) .cse5 (= ULTIMATE.start_s_run_~req_type~1 1) .cse6 (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= ~m_run_pc~0 6) .cse1 .cse2 (= ~req_tt_a~0 0) .cse4 .cse13 .cse6 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse14 (= ~c_req_type~0 0) .cse7 .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse10 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse11 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L556(lines 556 609) no Hoare annotation was computed. [2020-10-20 01:50:33,161 INFO L274 CegarLoopResult]: For program point L94(lines 94 122) no Hoare annotation was computed. [2020-10-20 01:50:33,162 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:50:33,162 INFO L274 CegarLoopResult]: For program point L821(lines 821 827) no Hoare annotation was computed. [2020-10-20 01:50:33,162 INFO L270 CegarLoopResult]: At program point L821-1(lines 821 827) the Hoare annotation is: (and (= ~m_run_pc~0 6) (= ~c_empty_rsp~0 1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~c_empty_req~0 1) (not (= ~s_run_st~0 0)) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (<= 2 ~c_write_req_ev~0) (not (= ~c_m_lock~0 1))) [2020-10-20 01:50:33,162 INFO L270 CegarLoopResult]: At program point L755(lines 748 801) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-10-20 01:50:33,162 INFO L270 CegarLoopResult]: At program point L689(lines 682 717) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (= .cse0 ULTIMATE.start_m_run_~rsp_d___0~0) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ULTIMATE.start_s_memory_write_~v 50) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ~c_req_a~0 0) (= .cse0 ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_s_memory_read_#res| 50) (= ULTIMATE.start_s_memory_read_~x~0 50) (<= 1 ~c_m_lock~0))) [2020-10-20 01:50:33,162 INFO L274 CegarLoopResult]: For program point L557(lines 557 561) no Hoare annotation was computed. [2020-10-20 01:50:33,162 INFO L270 CegarLoopResult]: At program point L1086(lines 1079 1096) the Hoare annotation is: (let ((.cse4 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~s_run_pc~0)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse5 (= ~s_memory0~0 50)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse3 (= ULTIMATE.start_s_memory_write_~v 50))) (or (and (= ~m_run_pc~0 6) .cse0 .cse1 (= ~req_tt_a~0 0) .cse2 .cse3 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) (= ~c_req_type~0 0) .cse4 .cse5 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and (let ((.cse8 (= ~m_run_pc~0 3))) (or (and (= ~s_run_pc~0 0) .cse4 (not (= ~s_run_st~0 0)) .cse8) (and .cse4 .cse2 .cse8))) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 .cse5 (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 50 ~c_req_d~0) .cse6 .cse7 .cse3 (<= ~c_req_d~0 50)))) [2020-10-20 01:50:33,163 INFO L270 CegarLoopResult]: At program point L1153(lines 1105 1158) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,163 INFO L274 CegarLoopResult]: For program point L1087(lines 1079 1096) no Hoare annotation was computed. [2020-10-20 01:50:33,163 INFO L274 CegarLoopResult]: For program point L757(lines 757 761) no Hoare annotation was computed. [2020-10-20 01:50:33,163 INFO L274 CegarLoopResult]: For program point L691(lines 691 695) no Hoare annotation was computed. [2020-10-20 01:50:33,163 INFO L270 CegarLoopResult]: At program point L1286(lines 1279 1305) the Hoare annotation is: (let ((.cse17 (= ~m_run_pc~0 6)) (.cse13 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse14 (= ULTIMATE.start_s_memory_write_~v 50)) (.cse2 (= ~c_req_type~0 0)) (.cse15 (= ~s_memory0~0 50)) (.cse16 (<= 1 ~c_m_lock~0)) (.cse5 (= 2 ~s_run_pc~0)) (.cse7 (<= 2 ~c_write_req_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse11 (= ~s_run_pc~0 0)) (.cse0 (= ~c_empty_rsp~0 1)) (.cse3 (= ~c_empty_req~0 1)) (.cse4 (not (= ~s_run_st~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 0)) (.cse9 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_req_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse4 (not .cse2) .cse6 .cse12 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse13 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse14 .cse3 .cse15 (<= 50 ~c_req_d~0) .cse7 .cse16 (<= ~c_req_d~0 50)) (and .cse17 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse17 .cse0 .cse4 .cse5 .cse6 .cse7 .cse16) (and .cse17 .cse13 .cse1 .cse4 (= ~req_tt_a~0 0) .cse6 .cse5 .cse14 .cse10 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= (+ ULTIMATE.start_m_run_~req_a___0~0 50) ~c_rsp_d~0) (= ULTIMATE.start_s_run_~req_type~1 0) .cse2 .cse3 .cse15 (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse7 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse16 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-10-20 01:50:33,164 INFO L270 CegarLoopResult]: At program point L229(lines 222 257) the Hoare annotation is: (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse8 (<= 0 ~a_t~0)) (.cse9 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse11 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse12 (<= 50 ~c_req_d~0)) (.cse13 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse5 (= ~m_run_pc~0 0)) (.cse14 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50))) (or (and .cse0 .cse1 .cse2 (not (= ~c_req_type~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse8 .cse2 .cse9 (or (and .cse1 .cse5) (and .cse1 (= ~m_run_pc~0 3))) .cse3 (= 2 ~s_run_pc~0) .cse10 .cse6 .cse7 .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (and .cse8 .cse9 .cse3 .cse10 .cse6 .cse7 .cse11 .cse1 .cse0 .cse12 .cse13 .cse4 .cse5 .cse14 .cse15))) [2020-10-20 01:50:33,164 INFO L274 CegarLoopResult]: For program point L97(lines 97 121) no Hoare annotation was computed. [2020-10-20 01:50:33,164 INFO L274 CegarLoopResult]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2020-10-20 01:50:33,164 INFO L270 CegarLoopResult]: At program point L98(lines 93 835) the Hoare annotation is: false [2020-10-20 01:50:33,164 INFO L270 CegarLoopResult]: At program point L429(lines 422 448) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-10-20 01:50:33,164 INFO L274 CegarLoopResult]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2020-10-20 01:50:33,164 INFO L274 CegarLoopResult]: For program point L231(lines 231 235) no Hoare annotation was computed. [2020-10-20 01:50:33,164 INFO L274 CegarLoopResult]: For program point L958(lines 958 962) no Hoare annotation was computed. [2020-10-20 01:50:33,165 INFO L270 CegarLoopResult]: At program point L166(lines 136 167) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse3 (not (= ~s_run_st~0 0))) (.cse11 (<= 0 ~a_t~0)) (.cse12 (<= 50 ULTIMATE.start_m_run_~req_d~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse14 (= ~c_req_a~0 0)) (.cse9 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse10 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse15 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse16 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse17 (<= ULTIMATE.start_m_run_~req_d~0 50)) (.cse4 (not .cse13)) (.cse5 (= ULTIMATE.start_m_run_~a~0 0)) (.cse18 (<= 2 ~c_write_req_ev~0)) (.cse7 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse3 .cse12 .cse13 .cse6 .cse8 .cse14 .cse9 .cse15 .cse1 .cse16 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse11 .cse12 .cse6 .cse8 .cse14 .cse9 .cse10 .cse15 .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse5 .cse18 .cse7)))) [2020-10-20 01:50:33,165 INFO L274 CegarLoopResult]: For program point L100(lines 100 120) no Hoare annotation was computed. [2020-10-20 01:50:33,165 INFO L274 CegarLoopResult]: For program point L1025(lines 1025 1078) no Hoare annotation was computed. [2020-10-20 01:50:33,165 INFO L270 CegarLoopResult]: At program point L563(lines 556 609) the Hoare annotation is: (and (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) (not (= ~s_run_st~0 0)) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~m_run_pc~0 3) (= ULTIMATE.start_s_memory_write_~v 50) (= ~c_req_a~0 0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_req_type~0 0) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 1 ~c_m_lock~0)) [2020-10-20 01:50:33,165 INFO L274 CegarLoopResult]: For program point L431(lines 431 435) no Hoare annotation was computed. [2020-10-20 01:50:33,165 INFO L270 CegarLoopResult]: At program point L101(lines 93 835) the Hoare annotation is: false [2020-10-20 01:50:33,165 INFO L274 CegarLoopResult]: For program point L1026(lines 1026 1030) no Hoare annotation was computed. [2020-10-20 01:50:33,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:50:33 BoogieIcfgContainer [2020-10-20 01:50:33,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:50:33,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:50:33,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:50:33,284 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:50:33,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:49:17" (3/4) ... [2020-10-20 01:50:33,288 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:50:33,321 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-10-20 01:50:33,323 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-10-20 01:50:33,324 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:50:33,326 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:50:33,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2020-10-20 01:50:33,362 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-10-20 01:50:33,362 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2020-10-20 01:50:33,362 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-10-20 01:50:33,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-10-20 01:50:33,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-10-20 01:50:33,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-10-20 01:50:33,364 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-10-20 01:50:33,364 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) [2020-10-20 01:50:33,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-10-20 01:50:33,366 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-10-20 01:50:33,372 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((m_run_pc == 6 && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((m_run_pc == 6 && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) [2020-10-20 01:50:33,373 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-10-20 01:50:33,373 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-10-20 01:50:33,375 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-10-20 01:50:33,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((s_run_pc == 0 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == 3) || ((c_empty_req == 1 && 2 == s_run_pc) && m_run_pc == 3)) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && v == 50) && c_req_d <= 50) [2020-10-20 01:50:33,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-10-20 01:50:33,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) [2020-10-20 01:50:33,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) [2020-10-20 01:50:33,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 [2020-10-20 01:50:33,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && i == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 [2020-10-20 01:50:33,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-10-20 01:50:33,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-10-20 01:50:33,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-10-20 01:50:33,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-10-20 01:50:33,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-10-20 01:50:33,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock [2020-10-20 01:50:33,379 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-10-20 01:50:33,379 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-10-20 01:50:33,379 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-10-20 01:50:33,379 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-10-20 01:50:33,379 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-10-20 01:50:33,379 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-10-20 01:50:33,380 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-10-20 01:50:33,537 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:50:33,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:50:33,538 INFO L168 Benchmark]: Toolchain (without parser) took 78232.39 ms. Allocated memory was 39.3 MB in the beginning and 444.1 MB in the end (delta: 404.8 MB). Free memory was 16.2 MB in the beginning and 18.7 MB in the end (delta: -2.5 MB). Peak memory consumption was 402.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,539 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 30.9 MB. Free memory was 7.0 MB in the beginning and 7.0 MB in the end (delta: 43.9 kB). Peak memory consumption was 43.9 kB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.77 ms. Allocated memory was 39.3 MB in the beginning and 41.9 MB in the end (delta: 2.6 MB). Free memory was 15.3 MB in the beginning and 19.5 MB in the end (delta: -4.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.19 ms. Allocated memory is still 41.9 MB. Free memory was 19.5 MB in the beginning and 15.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,548 INFO L168 Benchmark]: Boogie Preprocessor took 55.13 ms. Allocated memory is still 41.9 MB. Free memory was 15.9 MB in the beginning and 12.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,549 INFO L168 Benchmark]: RCFGBuilder took 1125.99 ms. Allocated memory was 41.9 MB in the beginning and 47.7 MB in the end (delta: 5.8 MB). Free memory was 12.3 MB in the beginning and 17.7 MB in the end (delta: -5.4 MB). Peak memory consumption was 8.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,550 INFO L168 Benchmark]: TraceAbstraction took 76076.85 ms. Allocated memory was 47.7 MB in the beginning and 444.1 MB in the end (delta: 396.4 MB). Free memory was 17.3 MB in the beginning and 41.6 MB in the end (delta: -24.3 MB). Peak memory consumption was 400.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,551 INFO L168 Benchmark]: Witness Printer took 253.41 ms. Allocated memory is still 444.1 MB. Free memory was 41.6 MB in the beginning and 18.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:33,553 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.92 ms. Allocated memory is still 30.9 MB. Free memory was 7.0 MB in the beginning and 7.0 MB in the end (delta: 43.9 kB). Peak memory consumption was 43.9 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 619.77 ms. Allocated memory was 39.3 MB in the beginning and 41.9 MB in the end (delta: 2.6 MB). Free memory was 15.3 MB in the beginning and 19.5 MB in the end (delta: -4.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 90.19 ms. Allocated memory is still 41.9 MB. Free memory was 19.5 MB in the beginning and 15.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 55.13 ms. Allocated memory is still 41.9 MB. Free memory was 15.9 MB in the beginning and 12.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1125.99 ms. Allocated memory was 41.9 MB in the beginning and 47.7 MB in the end (delta: 5.8 MB). Free memory was 12.3 MB in the beginning and 17.7 MB in the end (delta: -5.4 MB). Peak memory consumption was 8.2 MB. Max. memory is 14.3 GB. * TraceAbstraction took 76076.85 ms. Allocated memory was 47.7 MB in the beginning and 444.1 MB in the end (delta: 396.4 MB). Free memory was 17.3 MB in the beginning and 41.6 MB in the end (delta: -24.3 MB). Peak memory consumption was 400.6 MB. Max. memory is 14.3 GB. * Witness Printer took 253.41 ms. Allocated memory is still 444.1 MB. Free memory was 41.6 MB in the beginning and 18.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 903]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((((((((((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_st == 0) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1079]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || ((((((((((((((s_run_pc == 0 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == 3) || ((c_empty_req == 1 && 2 == s_run_pc) && m_run_pc == 3)) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && s_memory0 == 50) && req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && v == 50) && c_req_d <= 50) - InvariantResult [Line: 556]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 852]: Loop Invariant Derived loop invariant: ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((((((((0 <= a && 0 <= a_t) && !(s_run_st == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0)) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((0 <= a_t && 50 <= req_d) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && 50 <= req_d) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1263]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 821]: Loop Invariant Derived loop invariant: ((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && !(c_m_lock == 1) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && 50 <= req_d) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1271]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 748]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((((((m_run_pc == 6 && c_empty_rsp == 1) && 0 <= a_t) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 1 <= a) || (((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50) - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && c_req_a == 0) && c_empty_rsp == 1) && c_empty_req == 1) && req_a == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 1343]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: (((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 1 <= c_m_lock - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type___0 == 0) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 1 <= c_m_lock - InvariantResult [Line: 1279]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 1309]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 1287]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((((((m_run_pc == 6 && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && c_rsp_d == 50) && s_memory0 == 50) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((m_run_pc == 6 && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && rsp_d == 50) && c_req_a == 0) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50) && 1 <= c_m_lock - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1174]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 630]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && c_empty_rsp == 1) && c_req_type == 0) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 1 <= c_m_lock) - InvariantResult [Line: 802]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && 50 <= c_req_d) && req_d <= 50) && a == 0) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0))) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && 50 <= c_req_d) && req_d <= 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50 - InvariantResult [Line: 1182]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50) && 1 <= a - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || (((((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50) && 1 <= a)) || (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || ((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && !(c_m_lock == 1)) - InvariantResult [Line: 1105]: Loop Invariant Derived loop invariant: (((((((((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev)) || ((((((m_run_pc == 6 && c_empty_rsp == 1) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && 1 <= c_m_lock)) || ((((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0)) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0)) || ((((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) || ((((((((((c_empty_rsp == 1 && 0 <= a_t) && 50 <= c_req_d) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_req_a == 0)) || (((((((((((((0 <= a_t && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((0 <= a_t && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && 2 <= c_write_req_ev) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && req_a == 0) && !(req_type == 0)) || ((((((((((((((0 <= a_t && 50 <= req_d) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || (((((((((((((((0 <= a_t && !(s_run_st == 0)) && 50 <= req_d) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && i == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && req_type == 1) && m_run_pc == 3) && v == 50) && i == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && i == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1033]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: (((((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && req_a == 0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50)) || ((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 1159]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((c_empty_rsp == 1 && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && c_req_a == 0)) || (((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: (((((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && v == 50) && c_req_a == 0) && rsp_d == 50) && req_a___0 + 50 == c_rsp_d) && req_type == 0) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && 1 <= c_m_lock) && x == 50) || (((((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && !(s_run_st == 0)) && c_req_type == 1) && m_run_pc == 3) && req_type == 1) && v == 50) && s_run_pc == 0) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((50 <= req_d && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - InvariantResult [Line: 452]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1198]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && !(c_m_lock == 1)) && v == 50) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((((m_run_pc == 6 && 0 <= a) && 0 <= a_t) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && v == 50) && c_req_a == 0) && req_type == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && s_memory0 == 50) && req_a == 0) && 0 == req_a___0) && i == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 1228]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: (((((((c_empty_rsp == 1 && c_empty_req == 1) && !(s_run_st == 0)) && m_run_pc == c_m_lock) && m_run_pc == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 0) && c_req_a == 0) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && 0 <= a_t) && c_req_type == 0) && c_empty_req == 1) && m_run_pc == c_m_lock) && 2 == c_write_rsp_ev) && 2 <= c_write_req_ev) && m_run_pc == 0) && c_req_a == 0) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: ((((((((((((((c_empty_rsp == 1 && 0 <= a) && 0 <= a_t) && 50 <= c_req_d) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_a == 0) && c_req_d <= 50) || ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || ((((((((((((((0 <= a && 0 <= a_t) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && v == 50) && c_empty_req == 1) && s_memory0 == 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((c_empty_rsp == 1 && c_empty_req == 1) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3)) || ((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && c_req_a == 0)) || ((((((((((((0 <= a && 0 <= a_t) && !(c_req_type == 0)) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_a == 0) && s_run_pc == 0) && c_empty_rsp == 1) && 50 <= c_req_d) && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 275 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.4s, OverallIterations: 22, TraceHistogramMax: 4, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 55.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12251 SDtfs, 15781 SDslu, 21939 SDs, 0 SdLazy, 3001 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 858 GetRequests, 712 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7429occurred 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: 4.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 40828 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 639 NumberOfFragments, 10680 HoareAnnotationTreeSize, 98 FomulaSimplifications, 25592519 FormulaSimplificationTreeSizeReduction, 10.5s HoareSimplificationTime, 98 FomulaSimplificationsInter, 4591601 FormulaSimplificationTreeSizeReductionInter, 44.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2614 ConstructedInterpolants, 0 QuantifiedInterpolants, 1020917 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2151 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 323/447 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...