/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:05:28,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:05:28,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:05:28,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:05:28,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:05:28,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:05:28,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:05:28,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:05:28,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:05:28,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:05:28,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:05:28,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:05:28,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:05:28,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:05:28,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:05:28,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:05:28,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:05:28,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:05:28,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:05:28,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:05:28,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:05:28,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:05:28,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:05:28,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:05:28,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:05:28,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:05:28,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:05:28,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:05:28,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:05:28,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:05:28,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:05:28,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:05:28,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:05:28,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:05:28,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:05:28,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:05:28,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:05:28,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:05:28,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:05:28,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:05:28,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:05:28,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:05:28,871 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:05:28,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:05:28,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:05:28,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:05:28,874 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:05:28,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:05:28,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:05:28,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:05:28,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:05:28,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:05:28,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:05:28,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:05:28,876 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:05:28,876 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:05:28,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:05:28,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:05:28,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:05:28,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:05:28,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:05:28,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:05:28,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:05:28,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:05:28,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:05:28,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:05:28,878 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:05:28,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:05:29,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:05:29,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:05:29,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:05:29,299 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:05:29,300 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:05:29,301 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-12-22 07:05:29,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac2c1ed2/f87923316e7d48a4b09b609c1aef4b7c/FLAGa2476ec36 [2020-12-22 07:05:30,109 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:05:30,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2020-12-22 07:05:30,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac2c1ed2/f87923316e7d48a4b09b609c1aef4b7c/FLAGa2476ec36 [2020-12-22 07:05:30,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac2c1ed2/f87923316e7d48a4b09b609c1aef4b7c [2020-12-22 07:05:30,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:05:30,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:05:30,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:05:30,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:05:30,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:05:30,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:05:30" (1/1) ... [2020-12-22 07:05:30,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27cd7cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:30, skipping insertion in model container [2020-12-22 07:05:30,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:05:30" (1/1) ... [2020-12-22 07:05:30,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:05:30,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:05:30,719 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[341,354] [2020-12-22 07:05:30,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:05:30,968 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:05:30,984 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[341,354] [2020-12-22 07:05:31,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:05:31,119 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:05:31,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31 WrapperNode [2020-12-22 07:05:31,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:05:31,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:05:31,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:05:31,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:05:31,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:05:31,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:05:31,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:05:31,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:05:31,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (1/1) ... [2020-12-22 07:05:31,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:05:31,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:05:31,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:05:31,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:05:31,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (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-12-22 07:05:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:05:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:05:31,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:05:31,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:05:32,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:05:32,496 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2020-12-22 07:05:32,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:32 BoogieIcfgContainer [2020-12-22 07:05:32,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:05:32,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:05:32,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:05:32,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:05:32,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:05:30" (1/3) ... [2020-12-22 07:05:32,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25492964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:05:32, skipping insertion in model container [2020-12-22 07:05:32,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:05:31" (2/3) ... [2020-12-22 07:05:32,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25492964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:05:32, skipping insertion in model container [2020-12-22 07:05:32,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:32" (3/3) ... [2020-12-22 07:05:32,512 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2020-12-22 07:05:32,520 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:05:32,526 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-22 07:05:32,545 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-22 07:05:32,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:05:32,576 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:05:32,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:05:32,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:05:32,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:05:32,577 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:05:32,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:05:32,577 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:05:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2020-12-22 07:05:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 07:05:32,613 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:32,614 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-12-22 07:05:32,615 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:32,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 991682984, now seen corresponding path program 1 times [2020-12-22 07:05:32,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:32,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552581529] [2020-12-22 07:05:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:32,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552581529] [2020-12-22 07:05:32,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:32,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:32,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076481241] [2020-12-22 07:05:32,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:32,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:32,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:32,992 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 3 states. [2020-12-22 07:05:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:33,451 INFO L93 Difference]: Finished difference Result 713 states and 1292 transitions. [2020-12-22 07:05:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:33,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-22 07:05:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:33,470 INFO L225 Difference]: With dead ends: 713 [2020-12-22 07:05:33,471 INFO L226 Difference]: Without dead ends: 440 [2020-12-22 07:05:33,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-22 07:05:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 424. [2020-12-22 07:05:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-12-22 07:05:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 666 transitions. [2020-12-22 07:05:33,558 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 666 transitions. Word has length 27 [2020-12-22 07:05:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:33,559 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 666 transitions. [2020-12-22 07:05:33,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 666 transitions. [2020-12-22 07:05:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-22 07:05:33,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:33,562 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-12-22 07:05:33,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:05:33,566 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2034129844, now seen corresponding path program 1 times [2020-12-22 07:05:33,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:33,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379910976] [2020-12-22 07:05:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:33,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379910976] [2020-12-22 07:05:33,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:33,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:33,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277609438] [2020-12-22 07:05:33,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:33,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:33,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:33,692 INFO L87 Difference]: Start difference. First operand 424 states and 666 transitions. Second operand 3 states. [2020-12-22 07:05:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:33,863 INFO L93 Difference]: Finished difference Result 1111 states and 1767 transitions. [2020-12-22 07:05:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:33,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-12-22 07:05:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:33,869 INFO L225 Difference]: With dead ends: 1111 [2020-12-22 07:05:33,869 INFO L226 Difference]: Without dead ends: 701 [2020-12-22 07:05:33,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-12-22 07:05:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 685. [2020-12-22 07:05:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2020-12-22 07:05:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1105 transitions. [2020-12-22 07:05:33,923 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1105 transitions. Word has length 36 [2020-12-22 07:05:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:33,924 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 1105 transitions. [2020-12-22 07:05:33,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1105 transitions. [2020-12-22 07:05:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-22 07:05:33,927 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:33,927 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-12-22 07:05:33,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:05:33,928 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash -838577631, now seen corresponding path program 1 times [2020-12-22 07:05:33,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:33,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236054668] [2020-12-22 07:05:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:33,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236054668] [2020-12-22 07:05:33,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:33,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:33,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991881054] [2020-12-22 07:05:33,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:33,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:33,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:33,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:33,991 INFO L87 Difference]: Start difference. First operand 685 states and 1105 transitions. Second operand 3 states. [2020-12-22 07:05:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:34,055 INFO L93 Difference]: Finished difference Result 1731 states and 2796 transitions. [2020-12-22 07:05:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:34,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-12-22 07:05:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:34,064 INFO L225 Difference]: With dead ends: 1731 [2020-12-22 07:05:34,064 INFO L226 Difference]: Without dead ends: 1071 [2020-12-22 07:05:34,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2020-12-22 07:05:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1059. [2020-12-22 07:05:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2020-12-22 07:05:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1708 transitions. [2020-12-22 07:05:34,112 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1708 transitions. Word has length 37 [2020-12-22 07:05:34,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:34,112 INFO L481 AbstractCegarLoop]: Abstraction has 1059 states and 1708 transitions. [2020-12-22 07:05:34,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1708 transitions. [2020-12-22 07:05:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-22 07:05:34,115 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:34,116 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-12-22 07:05:34,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:05:34,116 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:34,117 INFO L82 PathProgramCache]: Analyzing trace with hash -981805896, now seen corresponding path program 1 times [2020-12-22 07:05:34,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:34,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287456469] [2020-12-22 07:05:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:34,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287456469] [2020-12-22 07:05:34,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:34,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:34,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450186778] [2020-12-22 07:05:34,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:34,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:34,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:34,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:34,214 INFO L87 Difference]: Start difference. First operand 1059 states and 1708 transitions. Second operand 4 states. [2020-12-22 07:05:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:34,671 INFO L93 Difference]: Finished difference Result 2909 states and 4673 transitions. [2020-12-22 07:05:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:34,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-12-22 07:05:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:34,683 INFO L225 Difference]: With dead ends: 2909 [2020-12-22 07:05:34,683 INFO L226 Difference]: Without dead ends: 1875 [2020-12-22 07:05:34,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-12-22 07:05:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1645. [2020-12-22 07:05:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2020-12-22 07:05:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2616 transitions. [2020-12-22 07:05:34,762 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2616 transitions. Word has length 46 [2020-12-22 07:05:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:34,763 INFO L481 AbstractCegarLoop]: Abstraction has 1645 states and 2616 transitions. [2020-12-22 07:05:34,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2616 transitions. [2020-12-22 07:05:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-22 07:05:34,768 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:34,768 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-12-22 07:05:34,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:05:34,768 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2020-12-22 07:05:34,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:34,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547714320] [2020-12-22 07:05:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:34,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547714320] [2020-12-22 07:05:34,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:34,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:34,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115689913] [2020-12-22 07:05:34,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:34,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:34,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:34,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:34,896 INFO L87 Difference]: Start difference. First operand 1645 states and 2616 transitions. Second operand 4 states. [2020-12-22 07:05:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:35,538 INFO L93 Difference]: Finished difference Result 4885 states and 7660 transitions. [2020-12-22 07:05:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:05:35,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-22 07:05:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:35,557 INFO L225 Difference]: With dead ends: 4885 [2020-12-22 07:05:35,558 INFO L226 Difference]: Without dead ends: 3259 [2020-12-22 07:05:35,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2020-12-22 07:05:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2889. [2020-12-22 07:05:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2020-12-22 07:05:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4519 transitions. [2020-12-22 07:05:35,689 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4519 transitions. Word has length 52 [2020-12-22 07:05:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:35,690 INFO L481 AbstractCegarLoop]: Abstraction has 2889 states and 4519 transitions. [2020-12-22 07:05:35,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4519 transitions. [2020-12-22 07:05:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-22 07:05:35,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:35,692 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-12-22 07:05:35,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:05:35,692 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2020-12-22 07:05:35,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:35,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143913211] [2020-12-22 07:05:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:35,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143913211] [2020-12-22 07:05:35,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:35,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:35,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021208342] [2020-12-22 07:05:35,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:35,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:35,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:35,755 INFO L87 Difference]: Start difference. First operand 2889 states and 4519 transitions. Second operand 3 states. [2020-12-22 07:05:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:35,992 INFO L93 Difference]: Finished difference Result 6783 states and 10562 transitions. [2020-12-22 07:05:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:35,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-22 07:05:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:36,016 INFO L225 Difference]: With dead ends: 6783 [2020-12-22 07:05:36,016 INFO L226 Difference]: Without dead ends: 3917 [2020-12-22 07:05:36,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2020-12-22 07:05:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3733. [2020-12-22 07:05:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-12-22 07:05:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5757 transitions. [2020-12-22 07:05:36,216 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5757 transitions. Word has length 52 [2020-12-22 07:05:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:36,218 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 5757 transitions. [2020-12-22 07:05:36,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5757 transitions. [2020-12-22 07:05:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-22 07:05:36,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:36,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:05:36,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:05:36,221 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -471765361, now seen corresponding path program 1 times [2020-12-22 07:05:36,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:36,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363573833] [2020-12-22 07:05:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:36,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363573833] [2020-12-22 07:05:36,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:36,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:36,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651824741] [2020-12-22 07:05:36,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:36,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:36,318 INFO L87 Difference]: Start difference. First operand 3733 states and 5757 transitions. Second operand 3 states. [2020-12-22 07:05:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:36,823 INFO L93 Difference]: Finished difference Result 8963 states and 13937 transitions. [2020-12-22 07:05:36,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:36,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-22 07:05:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:36,854 INFO L225 Difference]: With dead ends: 8963 [2020-12-22 07:05:36,854 INFO L226 Difference]: Without dead ends: 5253 [2020-12-22 07:05:36,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2020-12-22 07:05:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4515. [2020-12-22 07:05:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2020-12-22 07:05:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6698 transitions. [2020-12-22 07:05:37,115 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6698 transitions. Word has length 56 [2020-12-22 07:05:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:37,115 INFO L481 AbstractCegarLoop]: Abstraction has 4515 states and 6698 transitions. [2020-12-22 07:05:37,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6698 transitions. [2020-12-22 07:05:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-22 07:05:37,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:37,118 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-12-22 07:05:37,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:05:37,118 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1405970949, now seen corresponding path program 1 times [2020-12-22 07:05:37,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:37,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405146203] [2020-12-22 07:05:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:37,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405146203] [2020-12-22 07:05:37,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:37,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:37,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423153045] [2020-12-22 07:05:37,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:37,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:37,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:37,186 INFO L87 Difference]: Start difference. First operand 4515 states and 6698 transitions. Second operand 3 states. [2020-12-22 07:05:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:37,417 INFO L93 Difference]: Finished difference Result 8873 states and 13173 transitions. [2020-12-22 07:05:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:37,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-12-22 07:05:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:37,441 INFO L225 Difference]: With dead ends: 8873 [2020-12-22 07:05:37,442 INFO L226 Difference]: Without dead ends: 4381 [2020-12-22 07:05:37,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2020-12-22 07:05:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4381. [2020-12-22 07:05:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4381 states. [2020-12-22 07:05:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 6397 transitions. [2020-12-22 07:05:37,714 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 6397 transitions. Word has length 58 [2020-12-22 07:05:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:37,716 INFO L481 AbstractCegarLoop]: Abstraction has 4381 states and 6397 transitions. [2020-12-22 07:05:37,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 6397 transitions. [2020-12-22 07:05:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-22 07:05:37,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:37,719 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-12-22 07:05:37,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:05:37,719 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1675488665, now seen corresponding path program 1 times [2020-12-22 07:05:37,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:37,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196315604] [2020-12-22 07:05:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:37,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196315604] [2020-12-22 07:05:37,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:37,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:37,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778115355] [2020-12-22 07:05:37,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:37,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:37,790 INFO L87 Difference]: Start difference. First operand 4381 states and 6397 transitions. Second operand 3 states. [2020-12-22 07:05:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:38,111 INFO L93 Difference]: Finished difference Result 9409 states and 13912 transitions. [2020-12-22 07:05:38,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:38,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-12-22 07:05:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:38,156 INFO L225 Difference]: With dead ends: 9409 [2020-12-22 07:05:38,156 INFO L226 Difference]: Without dead ends: 5051 [2020-12-22 07:05:38,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2020-12-22 07:05:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 3399. [2020-12-22 07:05:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3399 states. [2020-12-22 07:05:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 5031 transitions. [2020-12-22 07:05:38,395 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 5031 transitions. Word has length 59 [2020-12-22 07:05:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:38,396 INFO L481 AbstractCegarLoop]: Abstraction has 3399 states and 5031 transitions. [2020-12-22 07:05:38,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 5031 transitions. [2020-12-22 07:05:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-22 07:05:38,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:38,398 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-12-22 07:05:38,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:05:38,399 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:38,399 INFO L82 PathProgramCache]: Analyzing trace with hash -920667186, now seen corresponding path program 1 times [2020-12-22 07:05:38,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:38,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659159666] [2020-12-22 07:05:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:38,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659159666] [2020-12-22 07:05:38,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:38,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 07:05:38,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579700179] [2020-12-22 07:05:38,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:05:38,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:38,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:05:38,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:38,485 INFO L87 Difference]: Start difference. First operand 3399 states and 5031 transitions. Second operand 6 states. [2020-12-22 07:05:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:39,929 INFO L93 Difference]: Finished difference Result 16205 states and 23855 transitions. [2020-12-22 07:05:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 07:05:39,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2020-12-22 07:05:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:39,968 INFO L225 Difference]: With dead ends: 16205 [2020-12-22 07:05:39,968 INFO L226 Difference]: Without dead ends: 13025 [2020-12-22 07:05:39,978 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-12-22 07:05:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13025 states. [2020-12-22 07:05:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13025 to 4265. [2020-12-22 07:05:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4265 states. [2020-12-22 07:05:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 6289 transitions. [2020-12-22 07:05:40,306 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 6289 transitions. Word has length 61 [2020-12-22 07:05:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:40,306 INFO L481 AbstractCegarLoop]: Abstraction has 4265 states and 6289 transitions. [2020-12-22 07:05:40,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:05:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 6289 transitions. [2020-12-22 07:05:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-22 07:05:40,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:40,308 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-12-22 07:05:40,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 07:05:40,309 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1524549323, now seen corresponding path program 1 times [2020-12-22 07:05:40,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:40,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921971527] [2020-12-22 07:05:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:40,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921971527] [2020-12-22 07:05:40,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:40,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 07:05:40,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516763479] [2020-12-22 07:05:40,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 07:05:40,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 07:05:40,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:40,407 INFO L87 Difference]: Start difference. First operand 4265 states and 6289 transitions. Second operand 7 states. [2020-12-22 07:05:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:42,709 INFO L93 Difference]: Finished difference Result 25491 states and 37406 transitions. [2020-12-22 07:05:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-22 07:05:42,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-12-22 07:05:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:42,771 INFO L225 Difference]: With dead ends: 25491 [2020-12-22 07:05:42,771 INFO L226 Difference]: Without dead ends: 25489 [2020-12-22 07:05:42,780 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-12-22 07:05:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25489 states. [2020-12-22 07:05:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25489 to 4573. [2020-12-22 07:05:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4573 states. [2020-12-22 07:05:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 6699 transitions. [2020-12-22 07:05:43,355 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 6699 transitions. Word has length 62 [2020-12-22 07:05:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:43,355 INFO L481 AbstractCegarLoop]: Abstraction has 4573 states and 6699 transitions. [2020-12-22 07:05:43,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 07:05:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 6699 transitions. [2020-12-22 07:05:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-22 07:05:43,364 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:43,364 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-12-22 07:05:43,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:05:43,364 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1908319894, now seen corresponding path program 1 times [2020-12-22 07:05:43,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:43,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30526734] [2020-12-22 07:05:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:43,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30526734] [2020-12-22 07:05:43,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:43,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:43,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061074924] [2020-12-22 07:05:43,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:43,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:43,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:43,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:43,404 INFO L87 Difference]: Start difference. First operand 4573 states and 6699 transitions. Second operand 3 states. [2020-12-22 07:05:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:43,802 INFO L93 Difference]: Finished difference Result 9620 states and 14052 transitions. [2020-12-22 07:05:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:43,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-22 07:05:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:43,815 INFO L225 Difference]: With dead ends: 9620 [2020-12-22 07:05:43,815 INFO L226 Difference]: Without dead ends: 5068 [2020-12-22 07:05:43,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2020-12-22 07:05:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4994. [2020-12-22 07:05:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4994 states. [2020-12-22 07:05:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4994 states to 4994 states and 7280 transitions. [2020-12-22 07:05:44,114 INFO L78 Accepts]: Start accepts. Automaton has 4994 states and 7280 transitions. Word has length 77 [2020-12-22 07:05:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:44,114 INFO L481 AbstractCegarLoop]: Abstraction has 4994 states and 7280 transitions. [2020-12-22 07:05:44,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4994 states and 7280 transitions. [2020-12-22 07:05:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-22 07:05:44,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:44,118 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-12-22 07:05:44,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:05:44,118 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1154888105, now seen corresponding path program 1 times [2020-12-22 07:05:44,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:44,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525430967] [2020-12-22 07:05:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:44,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525430967] [2020-12-22 07:05:44,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:44,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:05:44,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427128976] [2020-12-22 07:05:44,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:05:44,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:44,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:05:44,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:05:44,161 INFO L87 Difference]: Start difference. First operand 4994 states and 7280 transitions. Second operand 4 states. [2020-12-22 07:05:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:45,171 INFO L93 Difference]: Finished difference Result 13350 states and 19292 transitions. [2020-12-22 07:05:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:45,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-22 07:05:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:45,195 INFO L225 Difference]: With dead ends: 13350 [2020-12-22 07:05:45,195 INFO L226 Difference]: Without dead ends: 8256 [2020-12-22 07:05:45,205 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-12-22 07:05:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8256 states. [2020-12-22 07:05:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8256 to 7429. [2020-12-22 07:05:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2020-12-22 07:05:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 10640 transitions. [2020-12-22 07:05:45,841 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 10640 transitions. Word has length 88 [2020-12-22 07:05:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:45,841 INFO L481 AbstractCegarLoop]: Abstraction has 7429 states and 10640 transitions. [2020-12-22 07:05:45,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:05:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 10640 transitions. [2020-12-22 07:05:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-22 07:05:45,845 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:45,846 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-12-22 07:05:45,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:05:45,846 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash -258076045, now seen corresponding path program 1 times [2020-12-22 07:05:45,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:45,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081749117] [2020-12-22 07:05:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:45,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081749117] [2020-12-22 07:05:45,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:45,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:45,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556873990] [2020-12-22 07:05:45,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:45,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:45,891 INFO L87 Difference]: Start difference. First operand 7429 states and 10640 transitions. Second operand 3 states. [2020-12-22 07:05:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:46,170 INFO L93 Difference]: Finished difference Result 10736 states and 15421 transitions. [2020-12-22 07:05:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:46,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-22 07:05:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:46,178 INFO L225 Difference]: With dead ends: 10736 [2020-12-22 07:05:46,178 INFO L226 Difference]: Without dead ends: 3315 [2020-12-22 07:05:46,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2020-12-22 07:05:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3262. [2020-12-22 07:05:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-12-22 07:05:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4385 transitions. [2020-12-22 07:05:46,387 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4385 transitions. Word has length 95 [2020-12-22 07:05:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:46,387 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 4385 transitions. [2020-12-22 07:05:46,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4385 transitions. [2020-12-22 07:05:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-22 07:05:46,389 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:46,390 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-12-22 07:05:46,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:05:46,390 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash 635068147, now seen corresponding path program 1 times [2020-12-22 07:05:46,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:46,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857569667] [2020-12-22 07:05:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:46,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857569667] [2020-12-22 07:05:46,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:46,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:46,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96372875] [2020-12-22 07:05:46,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:46,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:46,442 INFO L87 Difference]: Start difference. First operand 3262 states and 4385 transitions. Second operand 5 states. [2020-12-22 07:05:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:47,479 INFO L93 Difference]: Finished difference Result 12465 states and 16771 transitions. [2020-12-22 07:05:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 07:05:47,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-22 07:05:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:47,499 INFO L225 Difference]: With dead ends: 12465 [2020-12-22 07:05:47,499 INFO L226 Difference]: Without dead ends: 9377 [2020-12-22 07:05:47,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 07:05:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2020-12-22 07:05:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 3264. [2020-12-22 07:05:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2020-12-22 07:05:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4381 transitions. [2020-12-22 07:05:47,805 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4381 transitions. Word has length 98 [2020-12-22 07:05:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:47,805 INFO L481 AbstractCegarLoop]: Abstraction has 3264 states and 4381 transitions. [2020-12-22 07:05:47,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4381 transitions. [2020-12-22 07:05:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-22 07:05:47,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:47,807 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-12-22 07:05:47,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:05:47,808 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:47,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1367461198, now seen corresponding path program 1 times [2020-12-22 07:05:47,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:47,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039958415] [2020-12-22 07:05:47,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:47,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039958415] [2020-12-22 07:05:47,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462478997] [2020-12-22 07:05:47,867 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-12-22 07:05:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:48,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-22 07:05:48,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:05:48,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:48,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-22 07:05:48,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302353236] [2020-12-22 07:05:48,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:48,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:48,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:48,225 INFO L87 Difference]: Start difference. First operand 3264 states and 4381 transitions. Second operand 3 states. [2020-12-22 07:05:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:48,570 INFO L93 Difference]: Finished difference Result 3891 states and 5212 transitions. [2020-12-22 07:05:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:48,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-22 07:05:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:48,578 INFO L225 Difference]: With dead ends: 3891 [2020-12-22 07:05:48,579 INFO L226 Difference]: Without dead ends: 3887 [2020-12-22 07:05:48,581 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-12-22 07:05:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2020-12-22 07:05:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3837. [2020-12-22 07:05:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2020-12-22 07:05:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5136 transitions. [2020-12-22 07:05:48,937 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5136 transitions. Word has length 100 [2020-12-22 07:05:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:48,938 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 5136 transitions. [2020-12-22 07:05:48,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5136 transitions. [2020-12-22 07:05:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-22 07:05:48,941 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:48,941 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-12-22 07:05:49,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-22 07:05:49,143 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash -913357440, now seen corresponding path program 1 times [2020-12-22 07:05:49,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:49,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859638246] [2020-12-22 07:05:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:49,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859638246] [2020-12-22 07:05:49,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299352492] [2020-12-22 07:05:49,236 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-12-22 07:05:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:49,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-22 07:05:49,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:05:49,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:49,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-22 07:05:49,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544378308] [2020-12-22 07:05:49,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:49,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:05:49,552 INFO L87 Difference]: Start difference. First operand 3837 states and 5136 transitions. Second operand 3 states. [2020-12-22 07:05:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:49,837 INFO L93 Difference]: Finished difference Result 6823 states and 9177 transitions. [2020-12-22 07:05:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:49,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2020-12-22 07:05:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:49,842 INFO L225 Difference]: With dead ends: 6823 [2020-12-22 07:05:49,842 INFO L226 Difference]: Without dead ends: 2995 [2020-12-22 07:05:49,849 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-12-22 07:05:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-12-22 07:05:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2774. [2020-12-22 07:05:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2020-12-22 07:05:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3648 transitions. [2020-12-22 07:05:50,088 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3648 transitions. Word has length 152 [2020-12-22 07:05:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:50,089 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 3648 transitions. [2020-12-22 07:05:50,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3648 transitions. [2020-12-22 07:05:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-22 07:05:50,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:50,094 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-12-22 07:05:50,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-22 07:05:50,309 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash 124699861, now seen corresponding path program 1 times [2020-12-22 07:05:50,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:50,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375857029] [2020-12-22 07:05:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-22 07:05:50,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375857029] [2020-12-22 07:05:50,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:50,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:05:50,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274383473] [2020-12-22 07:05:50,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:05:50,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:05:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:50,472 INFO L87 Difference]: Start difference. First operand 2774 states and 3648 transitions. Second operand 3 states. [2020-12-22 07:05:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:50,774 INFO L93 Difference]: Finished difference Result 3357 states and 4372 transitions. [2020-12-22 07:05:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:05:50,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2020-12-22 07:05:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:50,777 INFO L225 Difference]: With dead ends: 3357 [2020-12-22 07:05:50,778 INFO L226 Difference]: Without dead ends: 641 [2020-12-22 07:05:50,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:05:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-12-22 07:05:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 633. [2020-12-22 07:05:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-12-22 07:05:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 680 transitions. [2020-12-22 07:05:50,863 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 680 transitions. Word has length 155 [2020-12-22 07:05:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:50,863 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 680 transitions. [2020-12-22 07:05:50,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:05:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 680 transitions. [2020-12-22 07:05:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-22 07:05:50,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:50,866 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-12-22 07:05:50,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 07:05:50,867 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1963184793, now seen corresponding path program 1 times [2020-12-22 07:05:50,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:50,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731245719] [2020-12-22 07:05:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:05:50,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731245719] [2020-12-22 07:05:50,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274854355] [2020-12-22 07:05:50,972 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-12-22 07:05:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:51,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-22 07:05:51,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:05:51,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 07:05:51,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-12-22 07:05:51,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616983471] [2020-12-22 07:05:51,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:51,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:51,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:51,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:51,383 INFO L87 Difference]: Start difference. First operand 633 states and 680 transitions. Second operand 5 states. [2020-12-22 07:05:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:51,525 INFO L93 Difference]: Finished difference Result 923 states and 990 transitions. [2020-12-22 07:05:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:05:51,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2020-12-22 07:05:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:51,528 INFO L225 Difference]: With dead ends: 923 [2020-12-22 07:05:51,528 INFO L226 Difference]: Without dead ends: 537 [2020-12-22 07:05:51,529 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-12-22 07:05:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-12-22 07:05:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-12-22 07:05:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-12-22 07:05:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 575 transitions. [2020-12-22 07:05:51,612 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 575 transitions. Word has length 158 [2020-12-22 07:05:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:51,613 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 575 transitions. [2020-12-22 07:05:51,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 575 transitions. [2020-12-22 07:05:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-22 07:05:51,615 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:51,616 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-12-22 07:05:51,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:51,832 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1495401652, now seen corresponding path program 1 times [2020-12-22 07:05:51,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:51,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141130000] [2020-12-22 07:05:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-22 07:05:51,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141130000] [2020-12-22 07:05:51,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:51,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 07:05:51,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687637447] [2020-12-22 07:05:51,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 07:05:51,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 07:05:51,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:05:51,992 INFO L87 Difference]: Start difference. First operand 537 states and 575 transitions. Second operand 7 states. [2020-12-22 07:05:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:52,270 INFO L93 Difference]: Finished difference Result 1008 states and 1085 transitions. [2020-12-22 07:05:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 07:05:52,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2020-12-22 07:05:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:52,273 INFO L225 Difference]: With dead ends: 1008 [2020-12-22 07:05:52,274 INFO L226 Difference]: Without dead ends: 1006 [2020-12-22 07:05:52,274 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-12-22 07:05:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2020-12-22 07:05:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 535. [2020-12-22 07:05:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2020-12-22 07:05:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 572 transitions. [2020-12-22 07:05:52,340 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 572 transitions. Word has length 160 [2020-12-22 07:05:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:52,340 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 572 transitions. [2020-12-22 07:05:52,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 07:05:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 572 transitions. [2020-12-22 07:05:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-22 07:05:52,343 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:52,343 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-12-22 07:05:52,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 07:05:52,344 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash 887650061, now seen corresponding path program 1 times [2020-12-22 07:05:52,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:52,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728268643] [2020-12-22 07:05:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-22 07:05:52,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728268643] [2020-12-22 07:05:52,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:05:52,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:05:52,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653613717] [2020-12-22 07:05:52,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:05:52,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:05:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:05:52,423 INFO L87 Difference]: Start difference. First operand 535 states and 572 transitions. Second operand 5 states. [2020-12-22 07:05:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:52,557 INFO L93 Difference]: Finished difference Result 748 states and 799 transitions. [2020-12-22 07:05:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 07:05:52,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2020-12-22 07:05:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:52,559 INFO L225 Difference]: With dead ends: 748 [2020-12-22 07:05:52,559 INFO L226 Difference]: Without dead ends: 644 [2020-12-22 07:05:52,560 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-12-22 07:05:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-12-22 07:05:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 527. [2020-12-22 07:05:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2020-12-22 07:05:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 559 transitions. [2020-12-22 07:05:52,622 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 559 transitions. Word has length 161 [2020-12-22 07:05:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:52,623 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 559 transitions. [2020-12-22 07:05:52,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:05:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 559 transitions. [2020-12-22 07:05:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-12-22 07:05:52,626 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:05:52,627 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-12-22 07:05:52,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 07:05:52,627 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:05:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:05:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1388250693, now seen corresponding path program 1 times [2020-12-22 07:05:52,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:05:52,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711482480] [2020-12-22 07:05:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:05:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:53,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711482480] [2020-12-22 07:05:53,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715069173] [2020-12-22 07:05:53,157 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-12-22 07:05:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:05:53,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-22 07:05:53,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:05:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:05:53,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:05:53,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2020-12-22 07:05:53,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404746852] [2020-12-22 07:05:53,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-22 07:05:53,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:05:53,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-22 07:05:53,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-12-22 07:05:53,874 INFO L87 Difference]: Start difference. First operand 527 states and 559 transitions. Second operand 21 states. [2020-12-22 07:05:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:05:54,999 INFO L93 Difference]: Finished difference Result 836 states and 893 transitions. [2020-12-22 07:05:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-22 07:05:55,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 220 [2020-12-22 07:05:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:05:55,001 INFO L225 Difference]: With dead ends: 836 [2020-12-22 07:05:55,001 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 07:05:55,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=355, Invalid=1715, Unknown=0, NotChecked=0, Total=2070 [2020-12-22 07:05:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 07:05:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 07:05:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 07:05:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 07:05:55,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2020-12-22 07:05:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:05:55,004 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 07:05:55,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-22 07:05:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 07:05:55,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 07:05:55,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:05:55,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 07:05:55,495 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 164 [2020-12-22 07:05:57,264 WARN L197 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 675 DAG size of output: 477 [2020-12-22 07:05:57,749 WARN L197 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 202 [2020-12-22 07:05:58,148 WARN L197 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 162 [2020-12-22 07:05:58,593 WARN L197 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 202 [2020-12-22 07:05:59,036 WARN L197 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 287 [2020-12-22 07:05:59,213 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 164 [2020-12-22 07:05:59,323 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 144 [2020-12-22 07:05:59,512 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 164 [2020-12-22 07:05:59,667 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 147 [2020-12-22 07:06:00,682 WARN L197 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 296 [2020-12-22 07:06:01,134 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 287 [2020-12-22 07:06:01,557 WARN L197 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 274 [2020-12-22 07:06:01,819 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 164 [2020-12-22 07:06:02,356 WARN L197 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 274 [2020-12-22 07:06:02,823 WARN L197 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 502 DAG size of output: 300 [2020-12-22 07:06:03,153 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 274 [2020-12-22 07:06:04,569 WARN L197 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 765 DAG size of output: 540 [2020-12-22 07:06:04,754 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 144 [2020-12-22 07:06:05,170 WARN L197 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 202 [2020-12-22 07:06:05,584 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 287 [2020-12-22 07:06:06,074 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 202 [2020-12-22 07:06:06,433 WARN L197 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 268 [2020-12-22 07:06:06,746 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 202 [2020-12-22 07:06:06,933 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 181 [2020-12-22 07:06:07,760 WARN L197 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 66 [2020-12-22 07:06:11,408 WARN L197 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 456 DAG size of output: 104 [2020-12-22 07:06:12,557 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 200 DAG size of output: 72 [2020-12-22 07:06:13,611 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 157 DAG size of output: 67 [2020-12-22 07:06:13,799 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-12-22 07:06:14,960 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 200 DAG size of output: 72 [2020-12-22 07:06:15,210 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2020-12-22 07:06:16,844 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 276 DAG size of output: 91 [2020-12-22 07:06:17,010 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-12-22 07:06:18,047 WARN L197 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 66 [2020-12-22 07:06:18,604 WARN L197 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 54 [2020-12-22 07:06:19,629 WARN L197 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 66 [2020-12-22 07:06:20,238 WARN L197 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 54 [2020-12-22 07:06:20,426 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2020-12-22 07:06:20,643 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2020-12-22 07:06:20,753 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2020-12-22 07:06:23,437 WARN L197 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 287 DAG size of output: 81 [2020-12-22 07:06:23,747 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-12-22 07:06:24,106 WARN L197 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2020-12-22 07:06:24,375 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-22 07:06:24,827 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2020-12-22 07:06:26,470 WARN L197 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 276 DAG size of output: 91 [2020-12-22 07:06:26,976 WARN L197 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2020-12-22 07:06:28,552 WARN L197 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 263 DAG size of output: 91 [2020-12-22 07:06:28,737 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-22 07:06:29,800 WARN L197 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 66 [2020-12-22 07:06:30,012 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-12-22 07:06:30,986 WARN L197 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 66 [2020-12-22 07:06:31,564 WARN L197 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-12-22 07:06:32,547 WARN L197 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 66 [2020-12-22 07:06:32,850 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-12-22 07:06:33,333 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2020-12-22 07:06:34,899 WARN L197 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 263 DAG size of output: 91 [2020-12-22 07:06:35,078 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-22 07:06:36,861 WARN L197 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 289 DAG size of output: 91 [2020-12-22 07:06:38,446 WARN L197 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 263 DAG size of output: 91 [2020-12-22 07:06:38,620 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-22 07:06:38,964 WARN L197 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2020-12-22 07:06:39,273 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-22 07:06:43,751 WARN L197 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 521 DAG size of output: 102 [2020-12-22 07:06:44,290 WARN L197 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-12-22 07:06:44,592 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-22 07:06:45,311 WARN L197 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 71 [2020-12-22 07:06:45,488 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-22 07:06:46,000 WARN L197 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-12-22 07:06:46,178 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-12-22 07:06:46,533 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 46 [2020-12-22 07:06:47,708 WARN L197 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 200 DAG size of output: 72 [2020-12-22 07:06:47,844 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2020-12-22 07:06:47,963 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-22 07:06:48,205 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 45 [2020-12-22 07:06:48,412 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-22 07:06:48,786 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2020-12-22 07:06:50,452 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 276 DAG size of output: 91 [2020-12-22 07:06:50,739 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-12-22 07:06:51,028 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-12-22 07:06:51,791 WARN L197 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 57 [2020-12-22 07:06:52,523 WARN L197 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 52 [2020-12-22 07:06:52,889 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 50 [2020-12-22 07:06:54,090 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 200 DAG size of output: 72 [2020-12-22 07:06:56,273 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 262 DAG size of output: 76 [2020-12-22 07:06:56,529 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-12-22 07:06:57,718 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 200 DAG size of output: 72 [2020-12-22 07:06:57,883 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-22 07:06:58,294 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2020-12-22 07:06:58,417 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-22 07:06:58,541 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-22 07:06:59,602 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 175 DAG size of output: 62 [2020-12-22 07:06:59,607 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,609 INFO L185 CegarLoopUtils]: At program point L630-2(lines 630 658) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse4 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse3 (<= 0 ~a_t~0)) (.cse14 (= ~req_tt_a~0 0)) (.cse7 (= ~c_req_a~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (= ~s_memory0~0 50)) (.cse11 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse15 (= ~m_run_pc~0 6)) (.cse17 (= ~c_empty_req~0 1)) (.cse8 (= ~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)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ULTIMATE.start_m_run_~a~0 0) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ULTIMATE.start_s_memory_write_~v 50) .cse15 .cse2 .cse3 .cse16 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse14 .cse6 .cse5 .cse7 (= 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) .cse9 .cse17 .cse10 .cse11 (= ULTIMATE.start_s_run_~req_a~1 0) .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse15 .cse8 .cse17 .cse16 .cse6 .cse5 .cse12) (and .cse8 .cse16 .cse5 .cse6 .cse12 .cse13))) [2020-12-22 07:06:59,610 INFO L185 CegarLoopUtils]: At program point L763(lines 756 800) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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)) (= ~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-12-22 07:06:59,610 INFO L185 CegarLoopUtils]: At program point L697(lines 690 716) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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) (= ~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) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-12-22 07:06:59,611 INFO L189 CegarLoopUtils]: For program point L631(lines 630 658) no Hoare annotation was computed. [2020-12-22 07:06:59,611 INFO L189 CegarLoopUtils]: For program point L565(lines 565 569) no Hoare annotation was computed. [2020-12-22 07:06:59,611 INFO L189 CegarLoopUtils]: For program point L103(lines 103 119) no Hoare annotation was computed. [2020-12-22 07:06:59,611 INFO L185 CegarLoopUtils]: 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 (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .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-12-22 07:06:59,611 INFO L189 CegarLoopUtils]: For program point L632(lines 632 636) no Hoare annotation was computed. [2020-12-22 07:06:59,611 INFO L185 CegarLoopUtils]: At program point L104(lines 93 835) the Hoare annotation is: (let ((.cse3 (= 2 ~s_run_pc~0))) (let ((.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)) (.cse15 (not .cse3)) (.cse5 (<= 0 ~a_t~0)) (.cse1 (= ~c_empty_req~0 1)) (.cse6 (<= 50 ~c_req_d~0)) (.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 .cse14 .cse2 .cse7 .cse4 .cse10 .cse12 .cse0 .cse6 .cse15 .cse8 .cse9 .cse11) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse5 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse13 .cse2 .cse3 .cse4 .cse1 .cse6 .cse8 .cse9 .cse11) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse8)))) [2020-12-22 07:06:59,612 INFO L185 CegarLoopUtils]: At program point L170-2(lines 170 198) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse6 (= ~s_run_pc~0 0)) (.cse0 (<= 0 ~a_t~0)) (.cse15 (not (= ~s_run_st~0 0))) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse4 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse5 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 0)) (.cse9 (= ~c_empty_req~0 1)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (= ~m_run_pc~0 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 .cse6 .cse7 .cse9 .cse15 .cse1 .cse11 .cse13 .cse3 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse0 .cse15 (= 2 ~s_run_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-12-22 07:06:59,612 INFO L189 CegarLoopUtils]: For program point L765(lines 765 769) no Hoare annotation was computed. [2020-12-22 07:06:59,612 INFO L189 CegarLoopUtils]: For program point L699(lines 699 703) no Hoare annotation was computed. [2020-12-22 07:06:59,612 INFO L185 CegarLoopUtils]: At program point L1294(lines 1287 1304) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 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 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 .cse14 .cse1 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse6 .cse5 .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 (= ~s_memory0~0 50) (= 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) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse4 .cse5 .cse6 .cse7 .cse15) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse15 (<= ~c_req_d~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-12-22 07:06:59,612 INFO L185 CegarLoopUtils]: At program point L237(lines 230 256) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (<= 0 ~a_t~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (<= ~c_req_d~0 .cse16)) (.cse9 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse15 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~m_run_pc~0 0)) (.cse7 (= ~c_req_a~0 0)) (.cse8 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3) (and .cse2 (= ~m_run_pc~0 3))) .cse4 (= 2 ~s_run_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse15 .cse11 .cse12 .cse3 .cse13 .cse14) (and .cse15 .cse2 .cse1 (not (= ~c_req_type~0 0)) .cse4 .cse12 .cse3 .cse7 .cse8 (not (= ULTIMATE.start_m_run_~req_type~0 0)))))) [2020-12-22 07:06:59,612 INFO L189 CegarLoopUtils]: For program point L171(lines 170 198) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L185 CegarLoopUtils]: At program point L964(lines 957 974) the Hoare annotation is: (let ((.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse13 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse17 (<= ~c_req_d~0 50))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 (= ~c_req_type~0 0) .cse7 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse13 .cse14 .cse15 .cse5 (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse3 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17))) [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L1295(lines 1247 1336) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L1229(lines 1229 1233) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L172(lines 172 176) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L106(lines 106 118) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L965(lines 957 974) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L185 CegarLoopUtils]: At program point L437(lines 430 447) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L371(lines 371 375) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L239(lines 239 243) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L189 CegarLoopUtils]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2020-12-22 07:06:59,613 INFO L185 CegarLoopUtils]: At program point L107(lines 93 835) the Hoare annotation is: false [2020-12-22 07:06:59,614 INFO L189 CegarLoopUtils]: For program point L1164-2(lines 1162 1341) no Hoare annotation was computed. [2020-12-22 07:06:59,614 INFO L185 CegarLoopUtils]: At program point L1032(lines 1025 1078) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (<= 50 ~c_req_d~0)) (.cse11 (<= ~c_req_d~0 50)) (.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 1) (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse3 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse12 (= ~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) .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-22 07:06:59,614 INFO L189 CegarLoopUtils]: For program point L966(lines 966 970) no Hoare annotation was computed. [2020-12-22 07:06:59,614 INFO L189 CegarLoopUtils]: For program point L438(lines 126 472) no Hoare annotation was computed. [2020-12-22 07:06:59,614 INFO L185 CegarLoopUtils]: At program point L571(lines 564 608) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~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-12-22 07:06:59,614 INFO L189 CegarLoopUtils]: For program point L439(lines 439 443) no Hoare annotation was computed. [2020-12-22 07:06:59,615 INFO L189 CegarLoopUtils]: For program point L109(lines 109 117) no Hoare annotation was computed. [2020-12-22 07:06:59,615 INFO L189 CegarLoopUtils]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2020-12-22 07:06:59,615 INFO L185 CegarLoopUtils]: At program point L110(lines 93 835) the Hoare annotation is: false [2020-12-22 07:06:59,615 INFO L189 CegarLoopUtils]: For program point L903(lines 903 956) no Hoare annotation was computed. [2020-12-22 07:06:59,615 INFO L185 CegarLoopUtils]: At program point L771(lines 764 799) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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)) (= ~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-12-22 07:06:59,615 INFO L185 CegarLoopUtils]: At program point L705(lines 698 715) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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) (= ~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) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-12-22 07:06:59,616 INFO L189 CegarLoopUtils]: For program point L573(lines 573 577) no Hoare annotation was computed. [2020-12-22 07:06:59,616 INFO L192 CegarLoopUtils]: At program point L1366(lines 1343 1368) the Hoare annotation is: true [2020-12-22 07:06:59,616 INFO L185 CegarLoopUtils]: At program point L309(lines 279 310) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,616 INFO L189 CegarLoopUtils]: For program point L904(lines 904 908) no Hoare annotation was computed. [2020-12-22 07:06:59,616 INFO L189 CegarLoopUtils]: For program point L706(lines 477 829) no Hoare annotation was computed. [2020-12-22 07:06:59,616 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,616 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,616 INFO L189 CegarLoopUtils]: For program point L1169-1(lines 1162 1341) no Hoare annotation was computed. [2020-12-22 07:06:59,616 INFO L189 CegarLoopUtils]: For program point L112(lines 112 116) no Hoare annotation was computed. [2020-12-22 07:06:59,617 INFO L189 CegarLoopUtils]: For program point L773(lines 773 777) no Hoare annotation was computed. [2020-12-22 07:06:59,617 INFO L189 CegarLoopUtils]: For program point L707(lines 707 711) no Hoare annotation was computed. [2020-12-22 07:06:59,617 INFO L185 CegarLoopUtils]: At program point L377(lines 370 387) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,617 INFO L185 CegarLoopUtils]: At program point L245(lines 238 255) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (<= 0 ~a_t~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (<= ~c_req_d~0 .cse16)) (.cse9 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse15 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~m_run_pc~0 0)) (.cse7 (= ~c_req_a~0 0)) (.cse8 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3) (and .cse2 (= ~m_run_pc~0 3))) .cse4 (= 2 ~s_run_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse15 .cse11 .cse12 .cse3 .cse13 .cse14) (and .cse15 .cse2 .cse1 (not (= ~c_req_type~0 0)) .cse4 .cse12 .cse3 .cse7 .cse8 (not (= ULTIMATE.start_m_run_~req_type~0 0)))))) [2020-12-22 07:06:59,617 INFO L185 CegarLoopUtils]: At program point L113(lines 93 835) the Hoare annotation is: (let ((.cse1 (<= 0 ~a_t~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse6 (= ~c_req_a~0 0)) (.cse7 (= ~c_req_type~0 0)) (.cse9 (= ~s_memory0~0 50)) (.cse8 (= ~c_empty_req~0 1)) (.cse0 (= ~m_run_pc~0 6)) (.cse12 (= ~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)) (.cse10 (<= 2 ~c_write_req_ev~0)) (.cse11 (<= 1 ~c_m_lock~0))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse7 .cse8 (= ~c_rsp_d~0 50) .cse9 (= 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 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse8 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse10 .cse11))) [2020-12-22 07:06:59,618 INFO L189 CegarLoopUtils]: For program point L378(lines 370 387) no Hoare annotation was computed. [2020-12-22 07:06:59,618 INFO L189 CegarLoopUtils]: For program point L246(lines 126 472) no Hoare annotation was computed. [2020-12-22 07:06:59,618 INFO L189 CegarLoopUtils]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2020-12-22 07:06:59,618 INFO L189 CegarLoopUtils]: For program point L379(lines 379 383) no Hoare annotation was computed. [2020-12-22 07:06:59,618 INFO L189 CegarLoopUtils]: For program point L247(lines 247 251) no Hoare annotation was computed. [2020-12-22 07:06:59,618 INFO L185 CegarLoopUtils]: At program point L1040(lines 1033 1077) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (<= 50 ~c_req_d~0)) (.cse11 (<= ~c_req_d~0 50)) (.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 1) (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse3 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse12 (= ~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) .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-22 07:06:59,618 INFO L185 CegarLoopUtils]: At program point L579(lines 572 607) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~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-12-22 07:06:59,619 INFO L189 CegarLoopUtils]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2020-12-22 07:06:59,619 INFO L185 CegarLoopUtils]: At program point L910(lines 903 956) the Hoare annotation is: (let ((.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse13 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse17 (<= ~c_req_d~0 50))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 (= ~c_req_type~0 0) .cse7 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse13 .cse14 .cse15 .cse5 (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse3 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17))) [2020-12-22 07:06:59,619 INFO L189 CegarLoopUtils]: For program point L316(lines 316 369) no Hoare annotation was computed. [2020-12-22 07:06:59,619 INFO L189 CegarLoopUtils]: For program point L1175(lines 1175 1179) no Hoare annotation was computed. [2020-12-22 07:06:59,619 INFO L189 CegarLoopUtils]: For program point L977(lines 977 991) no Hoare annotation was computed. [2020-12-22 07:06:59,620 INFO L185 CegarLoopUtils]: At program point L779(lines 772 798) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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)) (= ~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-12-22 07:06:59,620 INFO L189 CegarLoopUtils]: For program point L581(lines 581 585) no Hoare annotation was computed. [2020-12-22 07:06:59,620 INFO L189 CegarLoopUtils]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-12-22 07:06:59,620 INFO L189 CegarLoopUtils]: For program point L912(lines 912 916) no Hoare annotation was computed. [2020-12-22 07:06:59,620 INFO L185 CegarLoopUtils]: At program point L516(lines 486 517) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (<= ~c_req_d~0 .cse0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= .cse0 ~c_req_d~0))) [2020-12-22 07:06:59,620 INFO L189 CegarLoopUtils]: For program point L781(lines 781 785) no Hoare annotation was computed. [2020-12-22 07:06:59,620 INFO L189 CegarLoopUtils]: For program point L1310(lines 1310 1314) no Hoare annotation was computed. [2020-12-22 07:06:59,620 INFO L189 CegarLoopUtils]: For program point L1112(lines 1111 1152) no Hoare annotation was computed. [2020-12-22 07:06:59,621 INFO L189 CegarLoopUtils]: For program point L453(lines 453 457) no Hoare annotation was computed. [2020-12-22 07:06:59,621 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,621 INFO L185 CegarLoopUtils]: At program point L1048(lines 1041 1076) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (<= 50 ~c_req_d~0)) (.cse11 (<= ~c_req_d~0 50)) (.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 1) (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse3 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse12 (= ~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) .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-22 07:06:59,621 INFO L185 CegarLoopUtils]: At program point L520-2(lines 520 548) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (<= ~c_req_d~0 .cse0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 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) (<= .cse0 ~c_req_d~0))) [2020-12-22 07:06:59,621 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 07:06:59,622 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,622 INFO L189 CegarLoopUtils]: For program point L58(lines 58 61) no Hoare annotation was computed. [2020-12-22 07:06:59,622 INFO L189 CegarLoopUtils]: For program point L983(lines 983 990) no Hoare annotation was computed. [2020-12-22 07:06:59,622 INFO L185 CegarLoopUtils]: At program point L587(lines 580 606) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~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-12-22 07:06:59,622 INFO L189 CegarLoopUtils]: For program point L521(lines 520 548) no Hoare annotation was computed. [2020-12-22 07:06:59,622 INFO L189 CegarLoopUtils]: For program point L389(lines 389 395) no Hoare annotation was computed. [2020-12-22 07:06:59,623 INFO L185 CegarLoopUtils]: At program point L389-1(lines 389 395) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,623 INFO L185 CegarLoopUtils]: At program point L323(lines 316 369) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,623 INFO L189 CegarLoopUtils]: For program point L1248(line 1248) no Hoare annotation was computed. [2020-12-22 07:06:59,623 INFO L189 CegarLoopUtils]: For program point L1116(lines 1116 1120) no Hoare annotation was computed. [2020-12-22 07:06:59,623 INFO L189 CegarLoopUtils]: For program point L1116-1(lines 1111 1152) no Hoare annotation was computed. [2020-12-22 07:06:59,623 INFO L189 CegarLoopUtils]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2020-12-22 07:06:59,624 INFO L185 CegarLoopUtils]: At program point L918(lines 911 955) the Hoare annotation is: (let ((.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse13 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse17 (<= ~c_req_d~0 50))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 (= ~c_req_type~0 0) .cse7 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse13 .cse14 .cse15 .cse5 (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse3 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17))) [2020-12-22 07:06:59,624 INFO L189 CegarLoopUtils]: For program point L522(lines 522 526) no Hoare annotation was computed. [2020-12-22 07:06:59,624 INFO L189 CegarLoopUtils]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2020-12-22 07:06:59,624 INFO L185 CegarLoopUtils]: 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 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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 .cse1 .cse4 (<= 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-12-22 07:06:59,624 INFO L189 CegarLoopUtils]: For program point L853(lines 853 865) no Hoare annotation was computed. [2020-12-22 07:06:59,624 INFO L185 CegarLoopUtils]: At program point L787(lines 780 797) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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)) (= ~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-12-22 07:06:59,625 INFO L189 CegarLoopUtils]: For program point L721(lines 721 725) no Hoare annotation was computed. [2020-12-22 07:06:59,625 INFO L189 CegarLoopUtils]: For program point L589(lines 589 593) no Hoare annotation was computed. [2020-12-22 07:06:59,625 INFO L189 CegarLoopUtils]: For program point L325(lines 325 329) no Hoare annotation was computed. [2020-12-22 07:06:59,625 INFO L185 CegarLoopUtils]: At program point L1316(lines 1309 1326) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 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 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 .cse14 .cse1 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse6 .cse5 .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 (= ~s_memory0~0 50) (= 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) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse4 .cse5 .cse6 .cse7 .cse15) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse15 (<= ~c_req_d~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-12-22 07:06:59,625 INFO L189 CegarLoopUtils]: For program point L127(lines 126 472) no Hoare annotation was computed. [2020-12-22 07:06:59,625 INFO L189 CegarLoopUtils]: For program point L920(lines 920 924) no Hoare annotation was computed. [2020-12-22 07:06:59,626 INFO L189 CegarLoopUtils]: For program point L788(lines 477 829) no Hoare annotation was computed. [2020-12-22 07:06:59,626 INFO L189 CegarLoopUtils]: For program point L1317(lines 1247 1336) no Hoare annotation was computed. [2020-12-22 07:06:59,626 INFO L189 CegarLoopUtils]: For program point L128(lines 128 132) no Hoare annotation was computed. [2020-12-22 07:06:59,626 INFO L189 CegarLoopUtils]: For program point L789(lines 789 793) no Hoare annotation was computed. [2020-12-22 07:06:59,626 INFO L185 CegarLoopUtils]: At program point L459(lines 452 469) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,626 INFO L189 CegarLoopUtils]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2020-12-22 07:06:59,626 INFO L189 CegarLoopUtils]: For program point L261(lines 261 265) no Hoare annotation was computed. [2020-12-22 07:06:59,626 INFO L185 CegarLoopUtils]: At program point L63(lines 54 64) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~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-12-22 07:06:59,627 INFO L189 CegarLoopUtils]: For program point L856(lines 856 864) no Hoare annotation was computed. [2020-12-22 07:06:59,627 INFO L189 CegarLoopUtils]: For program point L460(lines 452 469) no Hoare annotation was computed. [2020-12-22 07:06:59,627 INFO L185 CegarLoopUtils]: At program point L857(lines 852 1103) the Hoare annotation is: false [2020-12-22 07:06:59,627 INFO L185 CegarLoopUtils]: At program point L659(lines 629 660) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) (= 2 ~c_write_rsp_ev~0) (= 2 ~s_run_pc~0) (= ~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-12-22 07:06:59,627 INFO L189 CegarLoopUtils]: For program point L461(lines 461 465) no Hoare annotation was computed. [2020-12-22 07:06:59,628 INFO L185 CegarLoopUtils]: At program point L1122(lines 1111 1152) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse14 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse17 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse7 (= ~s_run_pc~0 0)) (.cse19 (<= 50 ~c_req_d~0)) (.cse25 (= ~c_req_type~0 1)) (.cse20 (<= ~c_req_d~0 50)) (.cse9 (= ~m_run_pc~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse0 (= ~m_run_pc~0 6)) (.cse15 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse16 (<= 0 ~a_t~0)) (.cse21 (= ~req_tt_a~0 0)) (.cse11 (= ~c_req_a~0 0)) (.cse22 (= ~c_req_type~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse8 (= ~m_run_st~0 0)) (.cse23 (= ~s_memory0~0 50)) (.cse24 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse12 (<= 1 ~c_m_lock~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)) (.cse18 (= ~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 .cse13 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse15 .cse16 .cse17 .cse3 .cse5 .cse4 .cse18 .cse2 .cse8 .cse19 .cse6 .cse12 .cse20) (and .cse13 .cse0 .cse15 .cse16 .cse14 .cse17 .cse21 .cse4 .cse5 .cse11 .cse1 .cse22 .cse23 .cse24 .cse6 .cse12) (and .cse7 .cse1 .cse3 (not .cse22) .cse5 .cse18 .cse11) (and .cse1 .cse2 .cse4 .cse5 .cse18) (and .cse7 .cse1 .cse16 .cse22 .cse2 .cse5 .cse6 .cse9 .cse10 .cse11) (and .cse7 .cse1 .cse15 .cse16 .cse19 .cse5 .cse25 .cse18 .cse6 .cse12 .cse11 .cse20) (and .cse1 .cse15 .cse16 .cse19 .cse5 .cse4 .cse25 .cse18 .cse6 .cse12 .cse11 .cse20) (and .cse1 .cse16 .cse22 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse15 .cse16 .cse3 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse21 .cse4 .cse5 (= 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) .cse22 .cse2 .cse8 .cse23 .cse24 (= 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 .cse3 .cse5 .cse4 .cse6 .cse18))) [2020-12-22 07:06:59,628 INFO L185 CegarLoopUtils]: At program point L1056(lines 1049 1075) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (<= 50 ~c_req_d~0)) (.cse11 (<= ~c_req_d~0 50)) (.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 1) (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse3 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse12 (= ~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) .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-22 07:06:59,628 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 07:06:59,628 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,628 INFO L189 CegarLoopUtils]: For program point L1255(lines 1255 1308) no Hoare annotation was computed. [2020-12-22 07:06:59,629 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,629 INFO L189 CegarLoopUtils]: For program point L859(lines 859 863) no Hoare annotation was computed. [2020-12-22 07:06:59,629 INFO L185 CegarLoopUtils]: At program point L727(lines 720 737) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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) (= ~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) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-12-22 07:06:59,629 INFO L185 CegarLoopUtils]: At program point L595(lines 588 605) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~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-12-22 07:06:59,629 INFO L185 CegarLoopUtils]: At program point L331(lines 324 368) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,630 INFO L189 CegarLoopUtils]: For program point L1256(lines 1256 1260) no Hoare annotation was computed. [2020-12-22 07:06:59,630 INFO L185 CegarLoopUtils]: At program point L199(lines 169 200) the Hoare annotation is: (let ((.cse15 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse2 (not (= ~s_run_st~0 0))) (.cse7 (<= 0 ~a_t~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse9 (<= .cse15 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse0 (= ~s_run_pc~0 0)) (.cse1 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_req_type~0 0)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse15)) (.cse4 (= ULTIMATE.start_m_run_~a~0 0)) (.cse13 (<= 2 ~c_write_req_ev~0)) (.cse5 (= ~m_run_pc~0 0)) (.cse14 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (and .cse7 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse8 .cse6 .cse9 .cse10 .cse1 .cse11 .cse12 .cse4 .cse13 .cse5 .cse14) (and .cse7 .cse3 .cse8 .cse6 .cse9 .cse10 .cse0 .cse1 .cse11 .cse12 .cse4 .cse13 .cse5 .cse14)))) [2020-12-22 07:06:59,630 INFO L189 CegarLoopUtils]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2020-12-22 07:06:59,630 INFO L185 CegarLoopUtils]: At program point L926(lines 919 954) the Hoare annotation is: (let ((.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse13 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse17 (<= ~c_req_d~0 50))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 (= ~c_req_type~0 0) .cse7 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse13 .cse14 .cse15 .cse5 (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse3 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17))) [2020-12-22 07:06:59,631 INFO L185 CegarLoopUtils]: 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 (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .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-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L728(lines 720 737) no Hoare annotation was computed. [2020-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L596(lines 477 829) no Hoare annotation was computed. [2020-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L398(lines 398 451) no Hoare annotation was computed. [2020-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2020-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L68(lines 68 71) no Hoare annotation was computed. [2020-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L993-1(lines 868 1098) no Hoare annotation was computed. [2020-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L729(lines 729 733) no Hoare annotation was computed. [2020-12-22 07:06:59,631 INFO L189 CegarLoopUtils]: For program point L597(lines 597 601) no Hoare annotation was computed. [2020-12-22 07:06:59,632 INFO L189 CegarLoopUtils]: For program point L399(lines 399 403) no Hoare annotation was computed. [2020-12-22 07:06:59,632 INFO L189 CegarLoopUtils]: For program point L333(lines 333 337) no Hoare annotation was computed. [2020-12-22 07:06:59,632 INFO L185 CegarLoopUtils]: At program point L267(lines 260 277) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~s_run_st~0 0))) (.cse0 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ULTIMATE.start_m_run_~a~0 0)) (.cse7 (= ~m_run_pc~0 0)) (.cse2 (= ~c_req_a~0 0)) (.cse3 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (let ((.cse1 (+ ULTIMATE.start_m_run_~a~0 50))) (and (<= 0 ~a_t~0) .cse0 (= ~c_req_type~0 1) (<= ~c_req_d~0 .cse1) .cse2 .cse3 (<= .cse1 ULTIMATE.start_m_run_~req_d~0) (= ULTIMATE.start_m_run_~req_type~0 1) .cse4 .cse5 (<= ULTIMATE.start_m_run_~req_d~0 .cse1) .cse6 .cse7 (<= 1 ~c_m_lock~0) (<= .cse1 ~c_req_d~0))) (and .cse4 .cse8 .cse0 (= 2 ~s_run_pc~0)) (and .cse5 .cse4 .cse8 (not (= ~c_req_type~0 0)) .cse0 .cse6 .cse7 .cse2 .cse3 (not (= ULTIMATE.start_m_run_~req_type~0 0))))) [2020-12-22 07:06:59,632 INFO L189 CegarLoopUtils]: For program point L1126(lines 1126 1133) no Hoare annotation was computed. [2020-12-22 07:06:59,632 INFO L189 CegarLoopUtils]: For program point L994(lines 993 1017) no Hoare annotation was computed. [2020-12-22 07:06:59,632 INFO L189 CegarLoopUtils]: For program point L928(lines 928 932) no Hoare annotation was computed. [2020-12-22 07:06:59,632 INFO L189 CegarLoopUtils]: For program point L268(lines 260 277) no Hoare annotation was computed. [2020-12-22 07:06:59,632 INFO L189 CegarLoopUtils]: For program point L995(lines 995 999) no Hoare annotation was computed. [2020-12-22 07:06:59,633 INFO L189 CegarLoopUtils]: For program point L269(lines 269 273) no Hoare annotation was computed. [2020-12-22 07:06:59,633 INFO L185 CegarLoopUtils]: At program point L137-2(lines 137 165) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse19 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (not (= ~s_run_st~0 0))) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse7 (<= .cse19 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_req_type~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse19)) (.cse17 (not .cse2)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse9 .cse11 .cse1 .cse17 .cse13 .cse3 .cse15 .cse4 .cse6 .cse18) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15)))) [2020-12-22 07:06:59,633 INFO L189 CegarLoopUtils]: For program point L666(lines 666 719) no Hoare annotation was computed. [2020-12-22 07:06:59,633 INFO L189 CegarLoopUtils]: For program point L138(lines 137 165) no Hoare annotation was computed. [2020-12-22 07:06:59,633 INFO L189 CegarLoopUtils]: For program point L667(lines 667 671) no Hoare annotation was computed. [2020-12-22 07:06:59,634 INFO L185 CegarLoopUtils]: At program point L1262(lines 1255 1308) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 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 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 .cse14 .cse1 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse6 .cse5 .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 (= ~s_memory0~0 50) (= 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) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse4 .cse5 .cse6 .cse7 .cse15) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse15 (<= ~c_req_d~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-12-22 07:06:59,634 INFO L189 CegarLoopUtils]: For program point L139(lines 139 143) no Hoare annotation was computed. [2020-12-22 07:06:59,634 INFO L185 CegarLoopUtils]: At program point L1064(lines 1057 1074) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (<= 50 ~c_req_d~0)) (.cse11 (<= ~c_req_d~0 50)) (.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse12 (= 2 ~s_run_pc~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s_run_st~0 0)) (= ~c_req_type~0 1) .cse6 (= ULTIMATE.start_s_run_~req_type~1 1) (= ~s_run_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse3 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse12 (= ~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) .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse10 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-22 07:06:59,634 INFO L189 CegarLoopUtils]: For program point L206(lines 206 259) no Hoare annotation was computed. [2020-12-22 07:06:59,634 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,635 INFO L189 CegarLoopUtils]: For program point L1065(lines 868 1098) no Hoare annotation was computed. [2020-12-22 07:06:59,635 INFO L185 CegarLoopUtils]: At program point L405(lines 398 451) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,635 INFO L185 CegarLoopUtils]: At program point L339(lines 332 367) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,635 INFO L189 CegarLoopUtils]: For program point L1330(lines 1330 1334) no Hoare annotation was computed. [2020-12-22 07:06:59,635 INFO L189 CegarLoopUtils]: For program point L1330-1(lines 1162 1341) no Hoare annotation was computed. [2020-12-22 07:06:59,635 INFO L189 CegarLoopUtils]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2020-12-22 07:06:59,635 INFO L189 CegarLoopUtils]: For program point L207(lines 207 211) no Hoare annotation was computed. [2020-12-22 07:06:59,636 INFO L189 CegarLoopUtils]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2020-12-22 07:06:59,636 INFO L185 CegarLoopUtils]: At program point L934(lines 927 953) the Hoare annotation is: (let ((.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse13 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse17 (<= ~c_req_d~0 50))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 (= ~c_req_type~0 0) .cse7 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse13 .cse14 .cse15 .cse5 (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse3 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17))) [2020-12-22 07:06:59,636 INFO L185 CegarLoopUtils]: At program point L868-1(lines 852 1103) the Hoare annotation is: (let ((.cse4 (= ~c_req_type~0 0)) (.cse5 (= ~c_empty_req~0 1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (not (= ~s_run_st~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse3 (= ~c_req_a~0 0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse9 (<= 50 ~c_req_d~0)) (.cse6 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse10 (<= ~c_req_d~0 50))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) .cse2 .cse3 (= 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) .cse4 .cse5 (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse0 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse2 .cse8 .cse5 .cse9 .cse6 .cse7 .cse10) (and .cse11 .cse1 .cse4 .cse5 .cse12 .cse2 .cse6 (= ~m_run_pc~0 0) (not (= ~c_m_lock~0 1)) .cse3) (and .cse0 .cse1 .cse12 (= ~c_req_type~0 1) .cse2 .cse8 .cse3 (= ~s_run_pc~0 0) .cse11 .cse9 .cse6 .cse7 .cse10))) [2020-12-22 07:06:59,636 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,636 INFO L189 CegarLoopUtils]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2020-12-22 07:06:59,637 INFO L189 CegarLoopUtils]: For program point L803(lines 803 807) no Hoare annotation was computed. [2020-12-22 07:06:59,637 INFO L185 CegarLoopUtils]: At program point L473(lines 125 474) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50) (<= 1 ULTIMATE.start_m_run_~a~0)) [2020-12-22 07:06:59,637 INFO L189 CegarLoopUtils]: For program point L407(lines 407 411) no Hoare annotation was computed. [2020-12-22 07:06:59,637 INFO L189 CegarLoopUtils]: For program point L341(lines 341 345) no Hoare annotation was computed. [2020-12-22 07:06:59,637 INFO L189 CegarLoopUtils]: For program point L936(lines 936 940) no Hoare annotation was computed. [2020-12-22 07:06:59,637 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,637 INFO L189 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,637 INFO L189 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,638 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,638 INFO L189 CegarLoopUtils]: For program point L12-3(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,638 INFO L189 CegarLoopUtils]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-12-22 07:06:59,638 INFO L189 CegarLoopUtils]: For program point L871-1(lines 868 1098) no Hoare annotation was computed. [2020-12-22 07:06:59,638 INFO L189 CegarLoopUtils]: For program point L739(lines 739 745) no Hoare annotation was computed. [2020-12-22 07:06:59,638 INFO L185 CegarLoopUtils]: At program point L739-1(lines 739 745) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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_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) (= 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-12-22 07:06:59,638 INFO L185 CegarLoopUtils]: At program point L673(lines 666 719) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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) (= ~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) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-12-22 07:06:59,639 INFO L185 CegarLoopUtils]: At program point L13-3(lines 1 1368) the Hoare annotation is: (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) (= 2 ~s_run_pc~0) (= 2 ~c_write_rsp_ev~0) (= ~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-12-22 07:06:59,639 INFO L185 CegarLoopUtils]: At program point L13-4(lines 66 74) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 3)) (.cse7 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse9 (= ULTIMATE.start_s_memory_write_~i 0)) (.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_empty_req~0 1)) (.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 .cse4 .cse5 (= 2 ~s_run_pc~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s_run_st~0 0)) .cse6 (= ~c_req_type~0 1) .cse8 .cse7 .cse9 (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-12-22 07:06:59,639 INFO L189 CegarLoopUtils]: For program point L872(lines 871 895) no Hoare annotation was computed. [2020-12-22 07:06:59,639 INFO L185 CegarLoopUtils]: At program point L1137(lines 1111 1152) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse9 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse0 (= ~m_run_pc~0 6)) (.cse16 (= ~req_tt_a~0 0)) (.cse19 (= ~s_memory0~0 50)) (.cse20 (= 0 ULTIMATE.start_m_run_~req_a___0~0)) (.cse18 (= ~c_req_type~0 0)) (.cse10 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse11 (<= 0 ~a_t~0)) (.cse14 (<= 50 ~c_req_d~0)) (.cse24 (= ~c_req_type~0 1)) (.cse7 (<= 1 ~c_m_lock~0)) (.cse15 (<= ~c_req_d~0 50)) (.cse23 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse21 (= ~m_run_pc~0 0)) (.cse22 (not (= ~c_m_lock~0 1))) (.cse17 (= ~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)) (.cse13 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) .cse9 .cse10 .cse11 .cse12 .cse3 .cse5 .cse4 .cse13 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse10 .cse11 .cse9 .cse12 .cse16 .cse4 .cse5 .cse17 .cse1 .cse18 .cse19 .cse20 .cse6 .cse7) (and .cse1 .cse11 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse17) (and .cse23 .cse1 .cse3 (not .cse18) .cse5 .cse13 .cse17) (and (<= ULTIMATE.start_s_memory_write_~v 50) .cse0 .cse10 .cse11 .cse3 (<= 50 ULTIMATE.start_s_memory_write_~v) .cse16 .cse5 .cse4 .cse17 (= 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) .cse18 .cse2 .cse19 (= ULTIMATE.start_s_run_~req_a~1 0) .cse20 .cse6 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse7 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse1 .cse2 .cse4 .cse5 .cse13) (and .cse23 .cse1 .cse11 .cse18 .cse2 .cse5 .cse6 .cse21 .cse22 .cse17) (and .cse23 .cse1 .cse10 .cse11 .cse14 .cse5 .cse24 .cse13 .cse6 .cse7 .cse17 .cse15) (and .cse1 .cse10 .cse11 .cse14 .cse5 .cse4 .cse24 .cse13 .cse6 .cse7 .cse17 .cse15) (and .cse23 .cse1 .cse2 .cse3 .cse5 .cse21 .cse22 .cse17) (and .cse1 .cse3 .cse5 .cse4 .cse6 .cse13))) [2020-12-22 07:06:59,640 INFO L189 CegarLoopUtils]: For program point L873(lines 873 877) no Hoare annotation was computed. [2020-12-22 07:06:59,640 INFO L189 CegarLoopUtils]: For program point L675(lines 675 679) no Hoare annotation was computed. [2020-12-22 07:06:59,640 INFO L185 CegarLoopUtils]: At program point L477-2(lines 477 829) the Hoare annotation is: (let ((.cse6 (= ~c_empty_rsp~0 1)) (.cse0 (<= 0 ~a_t~0)) (.cse7 (= ~c_empty_req~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse5 (not (= ~c_m_lock~0 1)))) (or (let ((.cse4 (+ ULTIMATE.start_m_run_~a~0 50))) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse0 (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse1 .cse2 .cse3 (= ~m_run_pc~0 3) (<= ~c_req_d~0 .cse4) .cse5 .cse6 .cse7 (= ~s_memory0~0 50) (= ULTIMATE.start_m_run_~a~0 0) .cse8 (<= .cse4 ~c_req_d~0))) (and (= ~m_run_pc~0 6) .cse6 .cse0 .cse7 .cse1 .cse3 .cse2 .cse8 .cse5 (<= 1 ULTIMATE.start_m_run_~a~0)))) [2020-12-22 07:06:59,640 INFO L185 CegarLoopUtils]: At program point L1270(lines 1263 1307) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 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 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 .cse14 .cse1 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse6 .cse5 .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 (= ~s_memory0~0 50) (= 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) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse4 .cse5 .cse6 .cse7 .cse15) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse15 (<= ~c_req_d~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-12-22 07:06:59,641 INFO L185 CegarLoopUtils]: At program point L213(lines 206 259) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (<= 0 ~a_t~0)) (.cse2 (= ~c_req_type~0 1)) (.cse4 (<= ~c_req_d~0 .cse16)) (.cse7 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse15 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (and .cse0 .cse1 (= 2 ~s_run_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse9 .cse1 (not (= ~c_req_type~0 0)) .cse3 .cse11 .cse12 .cse5 .cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0)))))) [2020-12-22 07:06:59,641 INFO L189 CegarLoopUtils]: For program point L478(lines 477 829) no Hoare annotation was computed. [2020-12-22 07:06:59,641 INFO L192 CegarLoopUtils]: At program point L1337(lines 1159 1342) the Hoare annotation is: true [2020-12-22 07:06:59,641 INFO L185 CegarLoopUtils]: 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 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) .cse1 .cse2 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) (<= ULTIMATE.start_s_run_~req_d~1 50) .cse11 .cse4 .cse5 .cse12 .cse13 .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse11 .cse4 .cse5 .cse7) (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-12-22 07:06:59,641 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,641 INFO L185 CegarLoopUtils]: At program point L809(lines 802 819) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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)) (= ~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-12-22 07:06:59,642 INFO L189 CegarLoopUtils]: For program point L611(lines 611 615) no Hoare annotation was computed. [2020-12-22 07:06:59,642 INFO L189 CegarLoopUtils]: For program point L479(lines 479 483) no Hoare annotation was computed. [2020-12-22 07:06:59,642 INFO L185 CegarLoopUtils]: At program point L413(lines 406 450) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,642 INFO L185 CegarLoopUtils]: At program point L347(lines 340 366) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,642 INFO L189 CegarLoopUtils]: For program point L281(lines 280 308) no Hoare annotation was computed. [2020-12-22 07:06:59,642 INFO L189 CegarLoopUtils]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2020-12-22 07:06:59,642 INFO L189 CegarLoopUtils]: For program point L215(lines 215 219) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L185 CegarLoopUtils]: At program point L942(lines 935 952) the Hoare annotation is: (let ((.cse11 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse0 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse12 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= 2 ~s_run_pc~0)) (.cse13 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse15 (= ULTIMATE.start_s_run_~req_type~1 1)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~c_empty_req~0 1)) (.cse8 (= ULTIMATE.start_s_run_~req_a~1 0)) (.cse16 (<= 50 ~c_req_d~0)) (.cse9 (<= 2 ~c_write_req_ev~0)) (.cse10 (<= 1 ~c_m_lock~0)) (.cse17 (<= ~c_req_d~0 50))) (or (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse0 .cse1 .cse2 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_s_run_~req_type~1 0) .cse6 (= ~c_req_type~0 0) .cse7 (= ~s_memory0~0 50) .cse8 (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse13 .cse14 .cse15 .cse5 (= ~s_run_pc~0 0) .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse4 .cse3 .cse13 .cse14 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17))) [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L810(lines 802 819) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L1141(lines 1141 1148) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L943(lines 868 1098) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L811(lines 811 815) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L415(lines 415 419) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L349(lines 349 353) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point L944(lines 944 948) no Hoare annotation was computed. [2020-12-22 07:06:59,643 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 07:06:59,644 INFO L185 CegarLoopUtils]: At program point L681(lines 674 718) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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) (= ~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) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-12-22 07:06:59,644 INFO L185 CegarLoopUtils]: At program point L549(lines 519 550) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (<= ~c_req_d~0 .cse0) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~s_memory0~0 50) (= 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) (<= .cse0 ~c_req_d~0))) [2020-12-22 07:06:59,644 INFO L189 CegarLoopUtils]: For program point L748(lines 748 801) no Hoare annotation was computed. [2020-12-22 07:06:59,644 INFO L189 CegarLoopUtils]: For program point L749(lines 749 753) no Hoare annotation was computed. [2020-12-22 07:06:59,644 INFO L189 CegarLoopUtils]: For program point L683(lines 683 687) no Hoare annotation was computed. [2020-12-22 07:06:59,644 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,645 INFO L185 CegarLoopUtils]: At program point L1278(lines 1271 1306) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 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 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 .cse14 .cse1 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse6 .cse5 .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 (= ~s_memory0~0 50) (= 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) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse4 .cse5 .cse6 .cse7 .cse15) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse15 (<= ~c_req_d~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-12-22 07:06:59,645 INFO L185 CegarLoopUtils]: At program point L221(lines 214 258) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (<= 0 ~a_t~0)) (.cse2 (= ~c_req_type~0 1)) (.cse4 (<= ~c_req_d~0 .cse16)) (.cse7 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse10 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse15 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ULTIMATE.start_m_run_~a~0 0)) (.cse12 (= ~m_run_pc~0 0)) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (and .cse0 .cse1 (= 2 ~s_run_pc~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse9 .cse1 (not (= ~c_req_type~0 0)) .cse3 .cse11 .cse12 .cse5 .cse6 (not (= ULTIMATE.start_m_run_~req_type~0 0)))))) [2020-12-22 07:06:59,645 INFO L189 CegarLoopUtils]: For program point L1080(lines 1080 1084) no Hoare annotation was computed. [2020-12-22 07:06:59,645 INFO L189 CegarLoopUtils]: For program point L618(lines 610 627) no Hoare annotation was computed. [2020-12-22 07:06:59,645 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,646 INFO L189 CegarLoopUtils]: For program point L619(lines 619 623) no Hoare annotation was computed. [2020-12-22 07:06:59,646 INFO L185 CegarLoopUtils]: At program point L421(lines 414 449) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,646 INFO L185 CegarLoopUtils]: At program point L487-2(lines 487 515) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~a~0 50))) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (<= ~c_req_d~0 .cse0) (not (= ~c_m_lock~0 1)) (= ULTIMATE.start_m_run_~req_type___0~0 0) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_m_run_~a~0 0) (<= 2 ~c_write_req_ev~0) (<= .cse0 ~c_req_d~0))) [2020-12-22 07:06:59,646 INFO L185 CegarLoopUtils]: At program point L355(lines 348 365) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= 1 ~c_m_lock~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,646 INFO L189 CegarLoopUtils]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2020-12-22 07:06:59,646 INFO L189 CegarLoopUtils]: For program point L223(lines 223 227) no Hoare annotation was computed. [2020-12-22 07:06:59,646 INFO L189 CegarLoopUtils]: For program point L1214(lines 1162 1341) no Hoare annotation was computed. [2020-12-22 07:06:59,647 INFO L189 CegarLoopUtils]: For program point L488(lines 487 515) no Hoare annotation was computed. [2020-12-22 07:06:59,647 INFO L189 CegarLoopUtils]: For program point L356(lines 126 472) no Hoare annotation was computed. [2020-12-22 07:06:59,647 INFO L189 CegarLoopUtils]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2020-12-22 07:06:59,647 INFO L189 CegarLoopUtils]: For program point L489(lines 489 493) no Hoare annotation was computed. [2020-12-22 07:06:59,647 INFO L189 CegarLoopUtils]: For program point L423(lines 423 427) no Hoare annotation was computed. [2020-12-22 07:06:59,647 INFO L189 CegarLoopUtils]: For program point L357(lines 357 361) no Hoare annotation was computed. [2020-12-22 07:06:59,647 INFO L185 CegarLoopUtils]: At program point L1018(lines 992 1019) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1)) (.cse1 (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1)) (.cse2 (<= 50 ULTIMATE.start_s_run_~req_d~1)) (.cse5 (<= ULTIMATE.start_s_run_~req_d~1 50)) (.cse8 (= ~m_run_pc~0 3)) (.cse11 (<= 50 ~c_req_d~0)) (.cse14 (<= ~c_req_d~0 50)) (.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= 2 ~s_run_pc~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_empty_req~0 1)) (.cse12 (<= 2 ~c_write_req_ev~0)) (.cse13 (<= 1 ~c_m_lock~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~s_run_st~0 0)) .cse7 (= ~c_req_type~0 1) .cse8 (= ULTIMATE.start_s_run_~req_type~1 1) (= ~s_run_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse3 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse7 .cse6 (= ~c_req_a~0 0) (= ULTIMATE.start_s_run_~rsp_d~1 50) (= ULTIMATE.start_s_run_~req_type~1 0) .cse9 (= ~c_req_type~0 0) .cse10 (= ~s_memory0~0 50) (= 0 ULTIMATE.start_m_run_~req_a___0~0) (= ULTIMATE.start_s_run_~req_a~1 0) .cse12 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse13 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-22 07:06:59,647 INFO L189 CegarLoopUtils]: For program point L556(lines 556 609) no Hoare annotation was computed. [2020-12-22 07:06:59,648 INFO L189 CegarLoopUtils]: For program point L94(lines 94 122) no Hoare annotation was computed. [2020-12-22 07:06:59,648 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 07:06:59,648 INFO L189 CegarLoopUtils]: For program point L821(lines 821 827) no Hoare annotation was computed. [2020-12-22 07:06:59,648 INFO L185 CegarLoopUtils]: 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-12-22 07:06:59,648 INFO L185 CegarLoopUtils]: At program point L755(lines 748 801) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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)) (= ~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-12-22 07:06:59,648 INFO L185 CegarLoopUtils]: At program point L689(lines 682 717) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_m_run_~req_a___0~0 50))) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (not (= ~s_run_st~0 0)) (<= 50 ULTIMATE.start_s_memory_write_~v) (= .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) (= ~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) (<= 1 ~c_m_lock~0) (= ULTIMATE.start_s_memory_read_~x~0 50))) [2020-12-22 07:06:59,649 INFO L189 CegarLoopUtils]: For program point L557(lines 557 561) no Hoare annotation was computed. [2020-12-22 07:06:59,649 INFO L185 CegarLoopUtils]: At program point L1086(lines 1079 1096) the Hoare annotation is: (let ((.cse3 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse4 (<= 0 ~a_t~0)) (.cse2 (= 2 ~s_run_pc~0)) (.cse0 (= ~c_empty_req~0 1)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse6 (<= 1 ~c_m_lock~0))) (or (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (let ((.cse1 (= ~m_run_pc~0 3))) (or (and (= ~s_run_pc~0 0) .cse0 (not (= ~s_run_st~0 0)) .cse1) (and .cse0 .cse2 .cse1))) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse3 .cse4 (<= ULTIMATE.start_s_run_~req_d~1 50) (<= 50 ~c_req_d~0) .cse5 .cse6 (<= ~c_req_d~0 50)) (and (<= ULTIMATE.start_s_memory_write_~v 50) (= ~m_run_pc~0 6) .cse3 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse2 (= ~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) .cse0 (= ~s_memory0~0 50) (= ULTIMATE.start_s_run_~req_a~1 0) (= 0 ULTIMATE.start_m_run_~req_a___0~0) .cse5 (= |ULTIMATE.start_s_memory_read_#res| 50) .cse6 (= ULTIMATE.start_s_memory_read_~x~0 50)))) [2020-12-22 07:06:59,649 INFO L185 CegarLoopUtils]: At program point L1153(lines 1105 1158) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 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 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 .cse14 .cse1 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse6 .cse5 .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 (= ~s_memory0~0 50) (= 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) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse4 .cse5 .cse6 .cse7 .cse15) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse15 (<= ~c_req_d~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-12-22 07:06:59,649 INFO L189 CegarLoopUtils]: For program point L1087(lines 1079 1096) no Hoare annotation was computed. [2020-12-22 07:06:59,649 INFO L189 CegarLoopUtils]: For program point L757(lines 757 761) no Hoare annotation was computed. [2020-12-22 07:06:59,649 INFO L189 CegarLoopUtils]: For program point L691(lines 691 695) no Hoare annotation was computed. [2020-12-22 07:06:59,650 INFO L185 CegarLoopUtils]: At program point L1286(lines 1279 1305) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 0)) (.cse13 (= ~m_run_pc~0 6)) (.cse14 (<= 0 ULTIMATE.start_m_run_~a~0)) (.cse1 (<= 0 ~a_t~0)) (.cse15 (<= 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 (<= ULTIMATE.start_s_memory_write_~v 50) .cse13 .cse14 .cse1 .cse4 (<= 50 ULTIMATE.start_s_memory_write_~v) (= ~req_tt_a~0 0) .cse6 .cse5 .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 (= ~s_memory0~0 50) (= 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) .cse15 (= ULTIMATE.start_s_memory_read_~x~0 50)) (and .cse13 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse13 .cse0 .cse4 .cse5 .cse6 .cse7 .cse15) (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 50 ULTIMATE.start_s_run_~req_d~1) .cse14 .cse1 (<= ULTIMATE.start_s_run_~req_d~1 50) .cse4 .cse6 .cse5 .cse12 .cse3 (<= 50 ~c_req_d~0) .cse7 .cse15 (<= ~c_req_d~0 50)) (and .cse0 .cse4 .cse6 .cse5 .cse7 .cse12) (and .cse11 .cse0 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10))) [2020-12-22 07:06:59,650 INFO L185 CegarLoopUtils]: At program point L229(lines 222 257) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse0 (<= 0 ~a_t~0)) (.cse5 (= ~c_req_type~0 1)) (.cse6 (<= ~c_req_d~0 .cse16)) (.cse9 (<= .cse16 ULTIMATE.start_m_run_~req_d~0)) (.cse10 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse11 (<= ULTIMATE.start_m_run_~req_d~0 .cse16)) (.cse13 (<= 1 ~c_m_lock~0)) (.cse14 (<= .cse16 ~c_req_d~0)) (.cse15 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse1 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ULTIMATE.start_m_run_~a~0 0)) (.cse3 (= ~m_run_pc~0 0)) (.cse7 (= ~c_req_a~0 0)) (.cse8 (= ULTIMATE.start_m_run_~req_a~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3) (and .cse2 (= ~m_run_pc~0 3))) .cse4 (= 2 ~s_run_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse15 .cse11 .cse12 .cse3 .cse13 .cse14) (and .cse15 .cse2 .cse1 (not (= ~c_req_type~0 0)) .cse4 .cse12 .cse3 .cse7 .cse8 (not (= ULTIMATE.start_m_run_~req_type~0 0)))))) [2020-12-22 07:06:59,650 INFO L189 CegarLoopUtils]: For program point L97(lines 97 121) no Hoare annotation was computed. [2020-12-22 07:06:59,650 INFO L189 CegarLoopUtils]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2020-12-22 07:06:59,651 INFO L185 CegarLoopUtils]: At program point L98(lines 93 835) the Hoare annotation is: false [2020-12-22 07:06:59,651 INFO L185 CegarLoopUtils]: At program point L429(lines 422 448) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 0 ULTIMATE.start_m_run_~a~0) (<= 0 ~a_t~0) (= ~s_memory0~0 ULTIMATE.start_s_run_~req_d~1) (<= 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)) (= ~c_empty_rsp~0 1) (= ~c_empty_req~0 1) (<= 50 ~c_req_d~0) (<= 2 ~c_write_req_ev~0) (<= ~c_req_d~0 50)) [2020-12-22 07:06:59,651 INFO L189 CegarLoopUtils]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2020-12-22 07:06:59,651 INFO L189 CegarLoopUtils]: For program point L231(lines 231 235) no Hoare annotation was computed. [2020-12-22 07:06:59,651 INFO L189 CegarLoopUtils]: For program point L958(lines 958 962) no Hoare annotation was computed. [2020-12-22 07:06:59,651 INFO L185 CegarLoopUtils]: At program point L166(lines 136 167) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse19 (+ ULTIMATE.start_m_run_~a~0 50))) (let ((.cse1 (not (= ~s_run_st~0 0))) (.cse0 (<= 0 ~a_t~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (= ~c_req_a~0 0)) (.cse6 (= ULTIMATE.start_m_run_~req_a~0 0)) (.cse18 (not (= ULTIMATE.start_m_run_~req_type~0 0))) (.cse7 (<= .cse19 ULTIMATE.start_m_run_~req_d~0)) (.cse8 (= ULTIMATE.start_m_run_~req_type~0 1)) (.cse16 (= ~s_run_pc~0 0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_req_type~0 0)) (.cse11 (= ~c_empty_req~0 1)) (.cse12 (<= ULTIMATE.start_m_run_~req_d~0 .cse19)) (.cse17 (not .cse2)) (.cse13 (= ULTIMATE.start_m_run_~a~0 0)) (.cse14 (<= 2 ~c_write_req_ev~0)) (.cse15 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse9 .cse11 .cse1 .cse17 .cse13 .cse3 .cse15 .cse4 .cse6 .cse18) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15)))) [2020-12-22 07:06:59,651 INFO L189 CegarLoopUtils]: For program point L100(lines 100 120) no Hoare annotation was computed. [2020-12-22 07:06:59,652 INFO L189 CegarLoopUtils]: For program point L1025(lines 1025 1078) no Hoare annotation was computed. [2020-12-22 07:06:59,652 INFO L185 CegarLoopUtils]: At program point L563(lines 556 609) the Hoare annotation is: (and (= ULTIMATE.start_s_memory_write_~v ULTIMATE.start_s_run_~req_d~1) (<= 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) (= ~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-12-22 07:06:59,652 INFO L189 CegarLoopUtils]: For program point L431(lines 431 435) no Hoare annotation was computed. [2020-12-22 07:06:59,652 INFO L185 CegarLoopUtils]: At program point L101(lines 93 835) the Hoare annotation is: false [2020-12-22 07:06:59,652 INFO L189 CegarLoopUtils]: For program point L1026(lines 1026 1030) no Hoare annotation was computed. [2020-12-22 07:06:59,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:06:59 BoogieIcfgContainer [2020-12-22 07:06:59,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:06:59,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:06:59,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:06:59,763 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:06:59,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:05:32" (3/4) ... [2020-12-22 07:06:59,766 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 07:06:59,802 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-12-22 07:06:59,803 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-22 07:06:59,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 07:06:59,806 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 07:06:59,842 WARN L220 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) || ((((((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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((v == req_d && 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) && 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)) || ((((((((((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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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 && 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-12-22 07:06:59,842 WARN L220 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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-12-22 07:06:59,843 WARN L220 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)) || (((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((v == req_d && 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) && 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)) || (((((((((((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)) || ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 3) [2020-12-22 07:06:59,843 WARN L220 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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-12-22 07:06:59,844 WARN L220 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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-12-22 07:06:59,844 WARN L220 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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-12-22 07:06:59,844 WARN L220 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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-12-22 07:06:59,844 WARN L220 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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-12-22 07:06:59,844 WARN L220 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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-12-22 07:06:59,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 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-12-22 07:06:59,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) [2020-12-22 07:06:59,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((v == req_d && 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) && 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-12-22 07:06:59,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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-12-22 07:06:59,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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-12-22 07:06:59,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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-12-22 07:06:59,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((v == req_d && ((((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))) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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-12-22 07:06:59,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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-12-22 07:06:59,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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-12-22 07:06:59,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((v == req_d && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) || ((((((((((((((v == req_d && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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)) || (((((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-12-22 07:06:59,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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-12-22 07:06:59,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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-12-22 07:06:59,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 [2020-12-22 07:06:59,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 [2020-12-22 07:06:59,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 [2020-12-22 07:06:59,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 [2020-12-22 07:06:59,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 [2020-12-22 07:06:59,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 [2020-12-22 07:06:59,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 [2020-12-22 07:06:59,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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-12-22 07:06:59,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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-12-22 07:06:59,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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-12-22 07:06:59,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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-12-22 07:06:59,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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-12-22 07:06:59,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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-12-22 07:06:59,992 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/mem_slave_tlm.1.cil.c-witness.graphml [2020-12-22 07:06:59,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:06:59,994 INFO L168 Benchmark]: Toolchain (without parser) took 89582.40 ms. Allocated memory was 151.0 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 125.3 MB in the beginning and 669.5 MB in the end (delta: -544.2 MB). Peak memory consumption was 577.9 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:59,995 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 151.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:06:59,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.60 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 105.4 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:59,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.39 ms. Allocated memory is still 151.0 MB. Free memory was 105.4 MB in the beginning and 102.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:59,996 INFO L168 Benchmark]: Boogie Preprocessor took 61.75 ms. Allocated memory is still 151.0 MB. Free memory was 102.0 MB in the beginning and 98.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:59,998 INFO L168 Benchmark]: RCFGBuilder took 1227.81 ms. Allocated memory is still 151.0 MB. Free memory was 98.7 MB in the beginning and 56.0 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:59,998 INFO L168 Benchmark]: TraceAbstraction took 87260.44 ms. Allocated memory was 151.0 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 55.5 MB in the beginning and 690.5 MB in the end (delta: -635.0 MB). Peak memory consumption was 740.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:59,998 INFO L168 Benchmark]: Witness Printer took 230.15 ms. Allocated memory is still 1.3 GB. Free memory was 690.5 MB in the beginning and 669.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2020-12-22 07:07:00,003 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.16 ms. Allocated memory is still 151.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 700.60 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 105.4 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 87.39 ms. Allocated memory is still 151.0 MB. Free memory was 105.4 MB in the beginning and 102.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 61.75 ms. Allocated memory is still 151.0 MB. Free memory was 102.0 MB in the beginning and 98.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1227.81 ms. Allocated memory is still 151.0 MB. Free memory was 98.7 MB in the beginning and 56.0 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 87260.44 ms. Allocated memory was 151.0 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 55.5 MB in the beginning and 690.5 MB in the end (delta: -635.0 MB). Peak memory consumption was 740.7 MB. Max. memory is 8.0 GB. * Witness Printer took 230.15 ms. Allocated memory is still 1.3 GB. Free memory was 690.5 MB in the beginning and 669.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 903]: Loop Invariant Derived loop invariant: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((((((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) - 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)) || (((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && m_run_st == 0) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((v == req_d && 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) && 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)) || (((((((((((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)) || ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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 && !(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: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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: 1079]: Loop Invariant Derived loop invariant: ((((((((((v == req_d && ((((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))) && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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: 556]: Loop Invariant Derived loop invariant: ((((((((((((((v == req_d && 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_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: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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: 93]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && 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_req_d <= a + 50) && !(c_m_lock == 1)) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && a + 50 <= c_req_d - 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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: (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && req_a == 0) && 0 == req_a___0) && 2 <= c_write_req_ev) && \result == 50) && x == 50 - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((((((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) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: ((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((((((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) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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: ((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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: ((((((((((((((v == req_d && 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_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: (((((((((((((((v == req_d && 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_req_d <= a + 50) && req_type___0 == 0) && c_empty_rsp == 1) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 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: (((((((((((((v == req_d && 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) && 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: ((((((((((((((((0 <= a_t && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && !(2 == s_run_pc)) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((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 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock)) || (((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && req_d <= a + 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 && !(s_run_st == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((((((0 <= a_t && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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 && !(s_run_st == 0)) && 2 == s_run_pc) && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((((((0 <= a_t && c_req_type == 1) && 2 == c_write_rsp_ev) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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: 682]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((((((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) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: (((((((((((((((v == req_d && 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_req_d <= a + 50) && !(c_m_lock == 1)) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && a == 0) && 2 <= c_write_req_ev) && a + 50 <= c_req_d) || (((((((((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) - InvariantResult [Line: 957]: Loop Invariant Derived loop invariant: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((((((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) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && req_d <= a + 50) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((((((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) - InvariantResult [Line: 1343]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 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: (((((((((((((v == req_d && 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) && 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: (((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_req == 1) && 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 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: (((((((((((((v == req_d && 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) && 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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: 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || (((((((((((((v == req_d && 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) && 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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 1 <= c_m_lock) && x == 50 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - 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) || ((((((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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((v == req_d && 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) && 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)) || ((((((((((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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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 && 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: (((((((((((((((0 <= a_t && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && req_d <= a + 50) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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: 630]: Loop Invariant Derived loop invariant: (((((((((((((((((v == req_d && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) || ((((((((((((((v == req_d && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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)) || (((((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: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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: 238]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && !(s_run_st == 0)) && ((c_empty_rsp == 1 && m_run_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && req_d <= a + 50) && a == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || ((((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d)) || (((((((((s_run_pc == 0 && c_empty_rsp == 1) && !(s_run_st == 0)) && !(c_req_type == 0)) && 2 == c_write_rsp_ev) && a == 0) && m_run_pc == 0) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_a___0 + 50 == rsp_d___0) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && 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: 260]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && c_req_type == 1) && c_req_d <= a + 50) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && s_run_pc == 0) && req_d <= a + 50) && a == 0) && m_run_pc == 0) && 1 <= c_m_lock) && a + 50 <= c_req_d) || (((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)) - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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: 520]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && 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_req_d <= a + 50) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && a + 50 <= c_req_d - 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && 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_req_d <= a + 50) && !(c_m_lock == 1)) && req_type___0 == 0) && c_empty_rsp == 1) && c_empty_req == 1) && s_memory0 == 50) && 0 == req_a___0) && a == 0) && 2 <= c_write_req_ev) && a + 50 <= c_req_d - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((v == req_d && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 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) || (((((((((((((((v == req_d && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 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)) || (((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && !(s_run_st == 0)) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) && 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)) || ((((((((((((((v == req_d && s_memory0 == req_d) && 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) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev) && 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: ((((((((((((((((0 <= a_t && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) || ((((((((((s_run_pc == 0 && c_empty_rsp == 1) && c_empty_req == 1) && !(s_run_st == 0)) && !(2 == s_run_pc)) && a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 0) && !(c_m_lock == 1)) && req_a == 0) && !(req_type == 0))) || ((((((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && !(c_m_lock == 1)) && c_req_a == 0) && req_a == 0) && !(req_type == 0)) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 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 && !(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)) || (((((((((((((v == req_d && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 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: (((((((((((((((0 <= a_t && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && s_run_pc == 0) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) || ((((((((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 && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_req_a == 0) && req_a == 0) && a + 50 <= req_d) && req_type == 1) && c_empty_rsp == 1) && c_req_type == 0) && c_empty_req == 1) && req_d <= a + 50) && a == 0) && 2 <= c_write_req_ev) && m_run_pc == 0) && 1 <= c_m_lock) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && i == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && i == 0) && s_run_pc == 0) && c_empty_rsp == 1) && c_empty_req == 1) && 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: (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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: 992]: Loop Invariant Derived loop invariant: (((((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 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) - 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: ((((((((((((((((v == req_d && s_memory0 == req_d) && 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) && s_run_pc == 0) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50) || ((((((((((((v == req_d && s_memory0 == req_d) && 50 <= req_d) && 0 <= a) && 0 <= a_t) && req_d <= 50) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || (((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 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: 452]: Loop Invariant Derived loop invariant: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 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: ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 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)) && c_empty_rsp == 1) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && c_req_d <= 50 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((v <= 50 && m_run_pc == 6) && 0 <= a) && 0 <= a_t) && 50 <= v) && req_tt_a == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && 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) || ((((((((((((((v == req_d && 0 <= a) && 0 <= a_t) && s_memory0 == req_d) && 50 <= req_d) && req_d <= 50) && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && m_run_pc == 3) && c_empty_req == 1) && 50 <= c_req_d) && 2 <= c_write_req_ev) && 1 <= c_m_lock) && c_req_d <= 50)) || ((((c_empty_rsp == 1 && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && 2 == s_run_pc) && 2 <= c_write_req_ev)) || ((((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, 270 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 22.6s, OverallIterations: 22, TraceHistogramMax: 4, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 64.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12251 SDtfs, 15903 SDslu, 22192 SDs, 0 SdLazy, 3029 SolverSat, 435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 859 GetRequests, 710 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.6s 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.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 40828 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 639 NumberOfFragments, 10949 HoareAnnotationTreeSize, 98 FomulaSimplifications, 25593102 FormulaSimplificationTreeSizeReduction, 11.6s HoareSimplificationTime, 98 FomulaSimplificationsInter, 4591885 FormulaSimplificationTreeSizeReductionInter, 52.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2614 ConstructedInterpolants, 0 QuantifiedInterpolants, 1068659 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2151 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 321/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...