/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:50,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:50,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:50,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:50,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:50,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:50,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:50,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:50,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:50,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:50,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:50,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:50,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:50,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:50,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:50,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:50,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:50,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:50,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:50,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:50,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:50,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:50,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:50,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:50,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:50,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:50,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:50,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:50,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:50,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:50,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:50,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:50,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:50,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:50,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:50,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:50,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:50,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:50,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:50,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:50,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:50,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:48:50,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:50,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:50,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:50,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:50,923 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:50,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:50,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:50,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:50,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:50,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:50,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:50,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:50,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:50,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:50,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:50,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:50,926 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:50,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:50,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:50,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:50,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:50,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:50,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:50,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:50,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:50,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:50,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:50,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:50,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:50,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:51,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:51,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:51,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:51,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:51,215 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:51,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-11-23 22:48:51,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07c4a33/3c0847d8d56e42b8a0ee42b85bee9585/FLAG82a4ec92b [2019-11-23 22:48:51,780 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:51,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-11-23 22:48:51,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07c4a33/3c0847d8d56e42b8a0ee42b85bee9585/FLAG82a4ec92b [2019-11-23 22:48:52,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07c4a33/3c0847d8d56e42b8a0ee42b85bee9585 [2019-11-23 22:48:52,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:52,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:52,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:52,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:52,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:52,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c891e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52, skipping insertion in model container [2019-11-23 22:48:52,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:52,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:52,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:52,428 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:52,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:52,592 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:52,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52 WrapperNode [2019-11-23 22:48:52,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:52,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:52,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:52,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:52,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:52,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:52,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:52,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:52,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:52,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:52,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:52,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:52,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (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 [2019-11-23 22:48:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:53,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:53,220 INFO L284 CfgBuilder]: Removed 58 assume(true) statements. [2019-11-23 22:48:53,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:53 BoogieIcfgContainer [2019-11-23 22:48:53,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:53,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:53,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:53,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:53,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:52" (1/3) ... [2019-11-23 22:48:53,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fe0182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:53, skipping insertion in model container [2019-11-23 22:48:53,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (2/3) ... [2019-11-23 22:48:53,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fe0182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:53, skipping insertion in model container [2019-11-23 22:48:53,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:53" (3/3) ... [2019-11-23 22:48:53,230 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-11-23 22:48:53,240 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:53,248 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-23 22:48:53,260 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-23 22:48:53,295 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:53,296 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:53,296 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:53,296 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:53,296 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:53,296 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:53,296 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:53,297 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2019-11-23 22:48:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:48:53,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:53,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:53,326 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595671, now seen corresponding path program 1 times [2019-11-23 22:48:53,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:53,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498558063] [2019-11-23 22:48:53,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:53,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498558063] [2019-11-23 22:48:53,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579651818] [2019-11-23 22:48:53,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,544 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2019-11-23 22:48:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:53,732 INFO L93 Difference]: Finished difference Result 266 states and 419 transitions. [2019-11-23 22:48:53,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:53,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:48:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:53,753 INFO L225 Difference]: With dead ends: 266 [2019-11-23 22:48:53,754 INFO L226 Difference]: Without dead ends: 174 [2019-11-23 22:48:53,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-23 22:48:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2019-11-23 22:48:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-23 22:48:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2019-11-23 22:48:53,860 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2019-11-23 22:48:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:53,860 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2019-11-23 22:48:53,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2019-11-23 22:48:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:48:53,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:53,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:53,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:53,864 INFO L82 PathProgramCache]: Analyzing trace with hash 32121146, now seen corresponding path program 1 times [2019-11-23 22:48:53,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:53,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296963776] [2019-11-23 22:48:53,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:53,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296963776] [2019-11-23 22:48:53,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171828956] [2019-11-23 22:48:53,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,961 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 3 states. [2019-11-23 22:48:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,052 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2019-11-23 22:48:54,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:54,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:48:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,056 INFO L225 Difference]: With dead ends: 489 [2019-11-23 22:48:54,056 INFO L226 Difference]: Without dead ends: 335 [2019-11-23 22:48:54,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-23 22:48:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2019-11-23 22:48:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-23 22:48:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 481 transitions. [2019-11-23 22:48:54,089 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 481 transitions. Word has length 39 [2019-11-23 22:48:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,089 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 481 transitions. [2019-11-23 22:48:54,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 481 transitions. [2019-11-23 22:48:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:48:54,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:54,093 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1962023560, now seen corresponding path program 1 times [2019-11-23 22:48:54,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:54,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336797719] [2019-11-23 22:48:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:54,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336797719] [2019-11-23 22:48:54,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:54,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:54,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421630946] [2019-11-23 22:48:54,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:54,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,198 INFO L87 Difference]: Start difference. First operand 331 states and 481 transitions. Second operand 3 states. [2019-11-23 22:48:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,307 INFO L93 Difference]: Finished difference Result 855 states and 1233 transitions. [2019-11-23 22:48:54,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:54,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-23 22:48:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,314 INFO L225 Difference]: With dead ends: 855 [2019-11-23 22:48:54,315 INFO L226 Difference]: Without dead ends: 615 [2019-11-23 22:48:54,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-23 22:48:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2019-11-23 22:48:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-23 22:48:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 869 transitions. [2019-11-23 22:48:54,368 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 869 transitions. Word has length 39 [2019-11-23 22:48:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,370 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 869 transitions. [2019-11-23 22:48:54,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 869 transitions. [2019-11-23 22:48:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:48:54,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:54,389 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:54,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:54,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1461928521, now seen corresponding path program 1 times [2019-11-23 22:48:54,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:54,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894459144] [2019-11-23 22:48:54,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:54,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894459144] [2019-11-23 22:48:54,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:54,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:54,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160810520] [2019-11-23 22:48:54,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:54,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,487 INFO L87 Difference]: Start difference. First operand 611 states and 869 transitions. Second operand 3 states. [2019-11-23 22:48:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,551 INFO L93 Difference]: Finished difference Result 1523 states and 2157 transitions. [2019-11-23 22:48:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:54,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:48:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,558 INFO L225 Difference]: With dead ends: 1523 [2019-11-23 22:48:54,558 INFO L226 Difference]: Without dead ends: 1023 [2019-11-23 22:48:54,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-11-23 22:48:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 979. [2019-11-23 22:48:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-11-23 22:48:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1361 transitions. [2019-11-23 22:48:54,600 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1361 transitions. Word has length 40 [2019-11-23 22:48:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,601 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1361 transitions. [2019-11-23 22:48:54,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1361 transitions. [2019-11-23 22:48:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:48:54,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:54,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1414888532, now seen corresponding path program 1 times [2019-11-23 22:48:54,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:54,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505586455] [2019-11-23 22:48:54,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:54,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505586455] [2019-11-23 22:48:54,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:54,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:54,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581959236] [2019-11-23 22:48:54,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:54,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:54,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,665 INFO L87 Difference]: Start difference. First operand 979 states and 1361 transitions. Second operand 3 states. [2019-11-23 22:48:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,753 INFO L93 Difference]: Finished difference Result 2628 states and 3649 transitions. [2019-11-23 22:48:54,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:54,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:48:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,763 INFO L225 Difference]: With dead ends: 2628 [2019-11-23 22:48:54,763 INFO L226 Difference]: Without dead ends: 1693 [2019-11-23 22:48:54,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-11-23 22:48:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1653. [2019-11-23 22:48:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-11-23 22:48:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2260 transitions. [2019-11-23 22:48:54,835 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2260 transitions. Word has length 40 [2019-11-23 22:48:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,835 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 2260 transitions. [2019-11-23 22:48:54,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2260 transitions. [2019-11-23 22:48:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:48:54,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:54,838 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:54,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2068899576, now seen corresponding path program 1 times [2019-11-23 22:48:54,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:54,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317396613] [2019-11-23 22:48:54,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:54,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317396613] [2019-11-23 22:48:54,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:54,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:54,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885282074] [2019-11-23 22:48:54,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:54,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,889 INFO L87 Difference]: Start difference. First operand 1653 states and 2260 transitions. Second operand 3 states. [2019-11-23 22:48:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:55,000 INFO L93 Difference]: Finished difference Result 3689 states and 5014 transitions. [2019-11-23 22:48:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:55,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-23 22:48:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:55,013 INFO L225 Difference]: With dead ends: 3689 [2019-11-23 22:48:55,013 INFO L226 Difference]: Without dead ends: 2065 [2019-11-23 22:48:55,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2019-11-23 22:48:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 2021. [2019-11-23 22:48:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-11-23 22:48:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2730 transitions. [2019-11-23 22:48:55,109 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2730 transitions. Word has length 45 [2019-11-23 22:48:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:55,111 INFO L462 AbstractCegarLoop]: Abstraction has 2021 states and 2730 transitions. [2019-11-23 22:48:55,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2730 transitions. [2019-11-23 22:48:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 22:48:55,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:55,115 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:55,115 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:55,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:55,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1733130536, now seen corresponding path program 1 times [2019-11-23 22:48:55,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:55,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886016697] [2019-11-23 22:48:55,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:55,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886016697] [2019-11-23 22:48:55,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:55,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:48:55,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445816623] [2019-11-23 22:48:55,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:55,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:55,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:55,218 INFO L87 Difference]: Start difference. First operand 2021 states and 2730 transitions. Second operand 4 states. [2019-11-23 22:48:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:55,331 INFO L93 Difference]: Finished difference Result 2439 states and 3292 transitions. [2019-11-23 22:48:55,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:55,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-23 22:48:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:55,346 INFO L225 Difference]: With dead ends: 2439 [2019-11-23 22:48:55,347 INFO L226 Difference]: Without dead ends: 2437 [2019-11-23 22:48:55,348 INFO L630 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 [2019-11-23 22:48:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-11-23 22:48:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2019. [2019-11-23 22:48:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-11-23 22:48:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2717 transitions. [2019-11-23 22:48:55,447 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2717 transitions. Word has length 46 [2019-11-23 22:48:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:55,448 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 2717 transitions. [2019-11-23 22:48:55,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2717 transitions. [2019-11-23 22:48:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 22:48:55,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:55,450 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:55,450 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2107539801, now seen corresponding path program 1 times [2019-11-23 22:48:55,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:55,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718122728] [2019-11-23 22:48:55,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:55,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718122728] [2019-11-23 22:48:55,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755153573] [2019-11-23 22:48:55,581 INFO L94 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 [2019-11-23 22:48:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 22:48:55,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:55,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:55,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-23 22:48:55,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154949613] [2019-11-23 22:48:55,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:48:55,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:55,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:48:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:55,792 INFO L87 Difference]: Start difference. First operand 2019 states and 2717 transitions. Second operand 7 states. [2019-11-23 22:48:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:56,111 INFO L93 Difference]: Finished difference Result 5451 states and 7392 transitions. [2019-11-23 22:48:56,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:48:56,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-23 22:48:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:56,137 INFO L225 Difference]: With dead ends: 5451 [2019-11-23 22:48:56,137 INFO L226 Difference]: Without dead ends: 5449 [2019-11-23 22:48:56,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-11-23 22:48:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 3949. [2019-11-23 22:48:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2019-11-23 22:48:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 5343 transitions. [2019-11-23 22:48:56,385 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 5343 transitions. Word has length 47 [2019-11-23 22:48:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:56,385 INFO L462 AbstractCegarLoop]: Abstraction has 3949 states and 5343 transitions. [2019-11-23 22:48:56,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:48:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 5343 transitions. [2019-11-23 22:48:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-23 22:48:56,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:56,387 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-23 22:48:56,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:56,594 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1562188045, now seen corresponding path program 2 times [2019-11-23 22:48:56,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:56,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633022442] [2019-11-23 22:48:56,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:56,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633022442] [2019-11-23 22:48:56,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:56,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:56,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446010994] [2019-11-23 22:48:56,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:56,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:56,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:56,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:56,643 INFO L87 Difference]: Start difference. First operand 3949 states and 5343 transitions. Second operand 3 states. [2019-11-23 22:48:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:56,790 INFO L93 Difference]: Finished difference Result 5955 states and 8100 transitions. [2019-11-23 22:48:56,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:56,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-23 22:48:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:56,803 INFO L225 Difference]: With dead ends: 5955 [2019-11-23 22:48:56,803 INFO L226 Difference]: Without dead ends: 2461 [2019-11-23 22:48:56,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2019-11-23 22:48:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2429. [2019-11-23 22:48:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-11-23 22:48:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 3223 transitions. [2019-11-23 22:48:57,026 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 3223 transitions. Word has length 50 [2019-11-23 22:48:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:57,026 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 3223 transitions. [2019-11-23 22:48:57,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3223 transitions. [2019-11-23 22:48:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:48:57,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:57,029 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:48:57,029 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1320977374, now seen corresponding path program 1 times [2019-11-23 22:48:57,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:57,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578294144] [2019-11-23 22:48:57,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:57,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578294144] [2019-11-23 22:48:57,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:57,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:57,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999547336] [2019-11-23 22:48:57,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:57,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:57,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:57,081 INFO L87 Difference]: Start difference. First operand 2429 states and 3223 transitions. Second operand 3 states. [2019-11-23 22:48:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:57,387 INFO L93 Difference]: Finished difference Result 6935 states and 9176 transitions. [2019-11-23 22:48:57,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:57,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:48:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:57,410 INFO L225 Difference]: With dead ends: 6935 [2019-11-23 22:48:57,412 INFO L226 Difference]: Without dead ends: 4583 [2019-11-23 22:48:57,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-23 22:48:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4583. [2019-11-23 22:48:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-11-23 22:48:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5953 transitions. [2019-11-23 22:48:57,687 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5953 transitions. Word has length 54 [2019-11-23 22:48:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:57,687 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5953 transitions. [2019-11-23 22:48:57,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5953 transitions. [2019-11-23 22:48:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:48:57,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:57,690 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-23 22:48:57,691 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1050588449, now seen corresponding path program 1 times [2019-11-23 22:48:57,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:57,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366177164] [2019-11-23 22:48:57,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:48:57,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366177164] [2019-11-23 22:48:57,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:57,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:57,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671529318] [2019-11-23 22:48:57,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:57,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:57,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:57,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:57,729 INFO L87 Difference]: Start difference. First operand 4583 states and 5953 transitions. Second operand 3 states. [2019-11-23 22:48:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:57,949 INFO L93 Difference]: Finished difference Result 8165 states and 10658 transitions. [2019-11-23 22:48:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:57,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-23 22:48:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:57,971 INFO L225 Difference]: With dead ends: 8165 [2019-11-23 22:48:57,971 INFO L226 Difference]: Without dead ends: 4583 [2019-11-23 22:48:57,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-23 22:48:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4583. [2019-11-23 22:48:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-11-23 22:48:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5857 transitions. [2019-11-23 22:48:58,266 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5857 transitions. Word has length 61 [2019-11-23 22:48:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:58,266 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5857 transitions. [2019-11-23 22:48:58,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5857 transitions. [2019-11-23 22:48:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-23 22:48:58,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:58,270 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-23 22:48:58,270 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:58,271 INFO L82 PathProgramCache]: Analyzing trace with hash -117700456, now seen corresponding path program 1 times [2019-11-23 22:48:58,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:58,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964245073] [2019-11-23 22:48:58,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:48:58,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964245073] [2019-11-23 22:48:58,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:58,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:58,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48756372] [2019-11-23 22:48:58,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:58,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:58,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:58,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:58,313 INFO L87 Difference]: Start difference. First operand 4583 states and 5857 transitions. Second operand 3 states. [2019-11-23 22:48:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:58,496 INFO L93 Difference]: Finished difference Result 8677 states and 11107 transitions. [2019-11-23 22:48:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:58,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-23 22:48:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:58,528 INFO L225 Difference]: With dead ends: 8677 [2019-11-23 22:48:58,528 INFO L226 Difference]: Without dead ends: 4585 [2019-11-23 22:48:58,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2019-11-23 22:48:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4583. [2019-11-23 22:48:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4583 states. [2019-11-23 22:48:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 5713 transitions. [2019-11-23 22:48:58,813 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 5713 transitions. Word has length 62 [2019-11-23 22:48:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:58,814 INFO L462 AbstractCegarLoop]: Abstraction has 4583 states and 5713 transitions. [2019-11-23 22:48:58,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 5713 transitions. [2019-11-23 22:48:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 22:48:58,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:58,826 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 22:48:58,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1892541846, now seen corresponding path program 1 times [2019-11-23 22:48:58,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:58,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224629885] [2019-11-23 22:48:58,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:48:58,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224629885] [2019-11-23 22:48:58,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:58,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:48:58,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18457649] [2019-11-23 22:48:58,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:48:58,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:48:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:48:58,910 INFO L87 Difference]: Start difference. First operand 4583 states and 5713 transitions. Second operand 5 states. [2019-11-23 22:48:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:59,480 INFO L93 Difference]: Finished difference Result 14009 states and 17462 transitions. [2019-11-23 22:48:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:48:59,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-23 22:48:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:59,500 INFO L225 Difference]: With dead ends: 14009 [2019-11-23 22:48:59,501 INFO L226 Difference]: Without dead ends: 9885 [2019-11-23 22:48:59,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9885 states. [2019-11-23 22:48:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9885 to 4703. [2019-11-23 22:48:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4703 states. [2019-11-23 22:48:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 5769 transitions. [2019-11-23 22:48:59,762 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 5769 transitions. Word has length 89 [2019-11-23 22:48:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:59,762 INFO L462 AbstractCegarLoop]: Abstraction has 4703 states and 5769 transitions. [2019-11-23 22:48:59,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:48:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 5769 transitions. [2019-11-23 22:48:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 22:48:59,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:59,768 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 22:48:59,768 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:59,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash -69278234, now seen corresponding path program 1 times [2019-11-23 22:48:59,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:59,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898021538] [2019-11-23 22:48:59,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:59,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898021538] [2019-11-23 22:48:59,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:59,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:59,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55433092] [2019-11-23 22:48:59,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:59,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:59,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:59,827 INFO L87 Difference]: Start difference. First operand 4703 states and 5769 transitions. Second operand 3 states. [2019-11-23 22:49:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:00,154 INFO L93 Difference]: Finished difference Result 7531 states and 9279 transitions. [2019-11-23 22:49:00,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:00,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-23 22:49:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:00,165 INFO L225 Difference]: With dead ends: 7531 [2019-11-23 22:49:00,165 INFO L226 Difference]: Without dead ends: 4777 [2019-11-23 22:49:00,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2019-11-23 22:49:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4687. [2019-11-23 22:49:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4687 states. [2019-11-23 22:49:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 5641 transitions. [2019-11-23 22:49:00,395 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 5641 transitions. Word has length 89 [2019-11-23 22:49:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:00,395 INFO L462 AbstractCegarLoop]: Abstraction has 4687 states and 5641 transitions. [2019-11-23 22:49:00,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 5641 transitions. [2019-11-23 22:49:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 22:49:00,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:00,401 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-23 22:49:00,401 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1125340559, now seen corresponding path program 1 times [2019-11-23 22:49:00,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:00,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35112158] [2019-11-23 22:49:00,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 22:49:00,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35112158] [2019-11-23 22:49:00,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:00,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:49:00,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551362888] [2019-11-23 22:49:00,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:49:00,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:00,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:49:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:49:00,452 INFO L87 Difference]: Start difference. First operand 4687 states and 5641 transitions. Second operand 5 states. [2019-11-23 22:49:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:01,006 INFO L93 Difference]: Finished difference Result 11329 states and 13692 transitions. [2019-11-23 22:49:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:49:01,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-11-23 22:49:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:01,018 INFO L225 Difference]: With dead ends: 11329 [2019-11-23 22:49:01,018 INFO L226 Difference]: Without dead ends: 6505 [2019-11-23 22:49:01,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:49:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6505 states. [2019-11-23 22:49:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6505 to 3411. [2019-11-23 22:49:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2019-11-23 22:49:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 4075 transitions. [2019-11-23 22:49:01,257 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 4075 transitions. Word has length 90 [2019-11-23 22:49:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:01,257 INFO L462 AbstractCegarLoop]: Abstraction has 3411 states and 4075 transitions. [2019-11-23 22:49:01,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:49:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 4075 transitions. [2019-11-23 22:49:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:49:01,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:01,264 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-23 22:49:01,264 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2125598100, now seen corresponding path program 1 times [2019-11-23 22:49:01,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:01,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291087018] [2019-11-23 22:49:01,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-23 22:49:01,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291087018] [2019-11-23 22:49:01,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:01,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:49:01,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457136206] [2019-11-23 22:49:01,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:01,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:01,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:01,299 INFO L87 Difference]: Start difference. First operand 3411 states and 4075 transitions. Second operand 3 states. [2019-11-23 22:49:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:01,727 INFO L93 Difference]: Finished difference Result 8333 states and 9990 transitions. [2019-11-23 22:49:01,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:01,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:49:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:01,740 INFO L225 Difference]: With dead ends: 8333 [2019-11-23 22:49:01,740 INFO L226 Difference]: Without dead ends: 4816 [2019-11-23 22:49:01,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-11-23 22:49:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4437. [2019-11-23 22:49:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2019-11-23 22:49:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 5305 transitions. [2019-11-23 22:49:02,100 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 5305 transitions. Word has length 101 [2019-11-23 22:49:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:02,100 INFO L462 AbstractCegarLoop]: Abstraction has 4437 states and 5305 transitions. [2019-11-23 22:49:02,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 5305 transitions. [2019-11-23 22:49:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:49:02,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:02,106 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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] [2019-11-23 22:49:02,107 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -459464668, now seen corresponding path program 1 times [2019-11-23 22:49:02,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:02,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986656908] [2019-11-23 22:49:02,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 22:49:02,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986656908] [2019-11-23 22:49:02,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:02,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:02,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479107706] [2019-11-23 22:49:02,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:02,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,188 INFO L87 Difference]: Start difference. First operand 4437 states and 5305 transitions. Second operand 3 states. [2019-11-23 22:49:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:02,610 INFO L93 Difference]: Finished difference Result 8727 states and 10456 transitions. [2019-11-23 22:49:02,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:02,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:49:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:02,622 INFO L225 Difference]: With dead ends: 8727 [2019-11-23 22:49:02,622 INFO L226 Difference]: Without dead ends: 4400 [2019-11-23 22:49:02,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2019-11-23 22:49:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 4353. [2019-11-23 22:49:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4353 states. [2019-11-23 22:49:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 5057 transitions. [2019-11-23 22:49:03,307 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 5057 transitions. Word has length 152 [2019-11-23 22:49:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:03,307 INFO L462 AbstractCegarLoop]: Abstraction has 4353 states and 5057 transitions. [2019-11-23 22:49:03,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 5057 transitions. [2019-11-23 22:49:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:49:03,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:03,313 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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] [2019-11-23 22:49:03,313 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:03,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1055203894, now seen corresponding path program 1 times [2019-11-23 22:49:03,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:03,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719579922] [2019-11-23 22:49:03,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-23 22:49:03,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719579922] [2019-11-23 22:49:03,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:03,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:03,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009371310] [2019-11-23 22:49:03,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:03,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:03,369 INFO L87 Difference]: Start difference. First operand 4353 states and 5057 transitions. Second operand 3 states. [2019-11-23 22:49:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:03,687 INFO L93 Difference]: Finished difference Result 8538 states and 9960 transitions. [2019-11-23 22:49:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:03,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:49:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:03,699 INFO L225 Difference]: With dead ends: 8538 [2019-11-23 22:49:03,699 INFO L226 Difference]: Without dead ends: 4337 [2019-11-23 22:49:03,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2019-11-23 22:49:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 4331. [2019-11-23 22:49:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4331 states. [2019-11-23 22:49:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 4974 transitions. [2019-11-23 22:49:03,992 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 4974 transitions. Word has length 154 [2019-11-23 22:49:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:03,992 INFO L462 AbstractCegarLoop]: Abstraction has 4331 states and 4974 transitions. [2019-11-23 22:49:03,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 4974 transitions. [2019-11-23 22:49:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:49:03,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:03,998 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 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] [2019-11-23 22:49:03,998 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 842292872, now seen corresponding path program 1 times [2019-11-23 22:49:03,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:03,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835106678] [2019-11-23 22:49:03,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 22:49:04,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835106678] [2019-11-23 22:49:04,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:04,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:04,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234206176] [2019-11-23 22:49:04,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:04,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:04,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:04,052 INFO L87 Difference]: Start difference. First operand 4331 states and 4974 transitions. Second operand 3 states. [2019-11-23 22:49:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:04,223 INFO L93 Difference]: Finished difference Result 6029 states and 6890 transitions. [2019-11-23 22:49:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:04,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:49:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:04,229 INFO L225 Difference]: With dead ends: 6029 [2019-11-23 22:49:04,230 INFO L226 Difference]: Without dead ends: 1854 [2019-11-23 22:49:04,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-23 22:49:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854. [2019-11-23 22:49:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-11-23 22:49:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2070 transitions. [2019-11-23 22:49:04,406 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2070 transitions. Word has length 154 [2019-11-23 22:49:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:04,406 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 2070 transitions. [2019-11-23 22:49:04,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2070 transitions. [2019-11-23 22:49:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:49:04,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:49:04,411 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:49:04,411 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:49:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:49:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1206640657, now seen corresponding path program 1 times [2019-11-23 22:49:04,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:49:04,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63566496] [2019-11-23 22:49:04,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:49:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:49:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-23 22:49:04,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63566496] [2019-11-23 22:49:04,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:49:04,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:49:04,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508826727] [2019-11-23 22:49:04,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:49:04,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:49:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:49:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:04,460 INFO L87 Difference]: Start difference. First operand 1854 states and 2070 transitions. Second operand 3 states. [2019-11-23 22:49:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:49:04,515 INFO L93 Difference]: Finished difference Result 2119 states and 2354 transitions. [2019-11-23 22:49:04,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:49:04,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:49:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:49:04,516 INFO L225 Difference]: With dead ends: 2119 [2019-11-23 22:49:04,517 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:49:04,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:49:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:49:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:49:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:49:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:49:04,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2019-11-23 22:49:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:49:04,521 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:49:04,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:49:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:49:04,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:49:04,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:49:04,755 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-23 22:49:04,978 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-23 22:49:05,223 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 151 [2019-11-23 22:49:05,394 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 133 [2019-11-23 22:49:05,699 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-23 22:49:05,976 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 153 [2019-11-23 22:49:06,152 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-23 22:49:06,300 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-23 22:49:06,600 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 130 [2019-11-23 22:49:06,956 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-23 22:49:07,156 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-23 22:49:07,419 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 136 [2019-11-23 22:49:08,622 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-23 22:49:09,733 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-23 22:49:11,024 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-11-23 22:49:11,132 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-23 22:49:12,726 WARN L192 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2019-11-23 22:49:12,876 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-23 22:49:13,320 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-11-23 22:49:14,469 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-23 22:49:15,800 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 144 DAG size of output: 91 [2019-11-23 22:49:16,965 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-23 22:49:18,114 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-23 22:49:19,354 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2019-11-23 22:49:19,568 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-23 22:49:19,869 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-11-23 22:49:20,062 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-23 22:49:21,205 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-23 22:49:22,471 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-11-23 22:49:22,907 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-11-23 22:49:24,286 WARN L192 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-11-23 22:49:25,503 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-23 22:49:26,663 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-23 22:49:26,823 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-23 22:49:27,962 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-23 22:49:29,090 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-11-23 22:49:30,230 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-23 22:49:30,338 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-23 22:49:31,467 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 128 DAG size of output: 85 [2019-11-23 22:49:31,565 INFO L444 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2019-11-23 22:49:31,565 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-23 22:49:31,566 INFO L444 ceAbstractionStarter]: For program point L283-3(lines 282 295) no Hoare annotation was computed. [2019-11-23 22:49:31,566 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 126) no Hoare annotation was computed. [2019-11-23 22:49:31,566 INFO L440 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse15 (= 0 ~p_dw_st~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= 0 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= 1 ~q_free~0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= ~q_req_up~0 0) .cse0 .cse2 .cse3 (<= 2 ~q_read_ev~0) .cse15 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2019-11-23 22:49:31,567 INFO L440 ceAbstractionStarter]: At program point L85-1(lines 73 87) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse15 (= 0 ~p_num_write~0)) (.cse23 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= 0 ~p_dw_st~0)) (.cse7 (= 0 ~p_dw_pc~0)) (.cse24 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= 1 ~q_free~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse20 (<= .cse27 ~p_num_write~0)) (.cse19 (= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 .cse27)) (.cse0 (<= ~q_req_up~0 0)) (.cse1 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse26 (= ~q_write_ev~0 1)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse9 (= ~c_dr_st~0 0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse25 (= 1 ~p_num_write~0)) (.cse16 (= 0 ~q_free~0)) (.cse17 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse18 (<= 2 ~c_dr_st~0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse17 .cse11 .cse2 .cse3 .cse18 .cse19 .cse4 .cse6 .cse8) (and .cse1 .cse2 .cse3 .cse18 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse20 .cse17 .cse2 .cse3 .cse18 .cse19 .cse4 .cse6 .cse8 .cse21 .cse16 .cse11 .cse22) (and .cse23 .cse1 .cse17 .cse2 .cse3 .cse18 .cse19 .cse6 .cse7 .cse8 .cse24 .cse11 .cse12 .cse13) (and .cse23 .cse1 .cse17 .cse2 .cse3 .cse18 .cse19 .cse4 .cse6 .cse8 .cse21 .cse24 .cse11 .cse13) (and .cse16 .cse18 .cse5 .cse14 .cse6 .cse8) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse21 .cse10 .cse16 .cse11 .cse25 .cse14) (and .cse1 .cse17 .cse2 .cse3 .cse18 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse23 .cse0 .cse1 .cse17 .cse2 .cse3 .cse18 .cse19 .cse4 .cse6 .cse8 .cse24 .cse11 .cse13) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse18 .cse19 .cse4 .cse5 .cse6 .cse8 .cse21 .cse24 .cse11 .cse13) (and .cse1 .cse17 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse24 .cse23 .cse0 .cse2 .cse18 .cse19 .cse13 .cse5 .cse6 .cse8 (= ~q_read_ev~0 1) .cse21) (and .cse24 .cse23 .cse0 .cse17 .cse2 .cse3 .cse18 .cse19 .cse13 .cse6 .cse8 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse18 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse24 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse20 .cse17 .cse2 .cse3 .cse19 .cse4 .cse6 .cse8 .cse9 .cse21 .cse16 .cse11 .cse22) (and .cse0 .cse1 .cse20 .cse17 .cse26 .cse3 .cse18 .cse19 .cse4 .cse8 .cse21 .cse16 .cse11 .cse22) (and .cse0 .cse1 .cse17 .cse26 .cse3 .cse4 .cse6 .cse8 .cse9 .cse21 .cse10 .cse16 .cse11 .cse25 .cse14) (and .cse16 .cse17 .cse3 .cse18 .cse14 .cse6 .cse8)))) [2019-11-23 22:49:31,567 INFO L447 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2019-11-23 22:49:31,567 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:49:31,567 INFO L440 ceAbstractionStarter]: At program point L86(lines 70 88) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse15 (<= 2 ~c_dr_st~0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse16 (= 0 ~p_dw_st~0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 ~p_dw_pc~0)) (.cse6 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= 1 ~q_free~0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (<= ~q_req_up~0 0) .cse0 .cse2 .cse3 (<= 2 ~q_read_ev~0) .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2019-11-23 22:49:31,568 INFO L440 ceAbstractionStarter]: At program point L86-1(lines 70 88) the Hoare annotation is: (let ((.cse28 (+ ~c_num_read~0 1))) (let ((.cse24 (= ~q_write_ev~0 1)) (.cse14 (= 0 ~p_num_write~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse25 (= 1 ~p_num_write~0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse26 (<= .cse28 ~p_num_write~0)) (.cse19 (= 1 ~p_dw_pc~0)) (.cse21 (= 0 ~q_free~0)) (.cse27 (<= ~p_num_write~0 .cse28)) (.cse16 (<= ~q_req_up~0 0)) (.cse23 (<= 2 ~q_read_ev~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse17 (<= 2 ~c_dr_st~0)) (.cse18 (= ~c_dr_pc~0 1)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse5 (= 0 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= 1 ~q_free~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 .cse2 .cse3 .cse17 .cse18 .cse4 .cse6 .cse7 .cse19 .cse20 .cse12) (and .cse21 .cse17 .cse22 .cse13 .cse4 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse17 .cse18 .cse23 .cse4 .cse6 .cse7 .cse19 .cse20 .cse10 .cse12) (and .cse15 .cse16 .cse0 .cse1 .cse2 .cse3 .cse17 .cse18 .cse23 .cse4 .cse6 .cse7 .cse20 .cse10 .cse12) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse17 .cse18 .cse23 .cse4 .cse6 .cse7 .cse21 .cse10) (and .cse16 .cse0 .cse1 .cse24 .cse3 .cse23 .cse4 .cse6 .cse7 .cse8 .cse19 .cse9 .cse21 .cse10 .cse25 .cse13) (and .cse16 .cse0 .cse26 .cse1 .cse2 .cse3 .cse18 .cse23 .cse4 .cse6 .cse7 .cse8 .cse19 .cse21 .cse10 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse2 .cse17 .cse18 .cse22 .cse4 .cse6 .cse7 .cse19 .cse20 .cse12 (= ~q_read_ev~0 1)) (and .cse21 .cse1 .cse3 .cse17 .cse13 .cse4 .cse6 .cse7) (and .cse15 .cse16 .cse0 .cse2 .cse3 .cse17 .cse18 .cse23 .cse22 .cse4 .cse6 .cse7 .cse19 .cse20 .cse10 .cse12) (and .cse0 .cse2 .cse3 .cse17 .cse22 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse26 .cse1 .cse24 .cse3 .cse17 .cse18 .cse23 .cse7 .cse19 .cse21 .cse10 .cse27) (and .cse16 .cse0 .cse2 .cse3 .cse23 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse6 .cse7 .cse8 .cse19 .cse9 .cse21 .cse10 .cse25 .cse13) (and .cse0 .cse26 .cse1 .cse2 .cse3 .cse17 .cse18 .cse23 .cse4 .cse6 .cse7 .cse19 .cse21 .cse10 .cse27) (and .cse15 .cse16 .cse0 .cse2 .cse3 .cse17 .cse18 .cse23 .cse22 .cse4 .cse6 .cse5 .cse7 .cse20 .cse10 .cse11 .cse12) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse17 .cse18 .cse4 .cse6 .cse5 .cse7 .cse20 .cse10 .cse11 .cse12)))) [2019-11-23 22:49:31,568 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2019-11-23 22:49:31,568 INFO L444 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2019-11-23 22:49:31,568 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-11-23 22:49:31,568 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2019-11-23 22:49:31,568 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2019-11-23 22:49:31,568 INFO L444 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2019-11-23 22:49:31,568 INFO L444 ceAbstractionStarter]: For program point L55-3(lines 55 64) no Hoare annotation was computed. [2019-11-23 22:49:31,569 INFO L444 ceAbstractionStarter]: For program point L55-5(lines 55 64) no Hoare annotation was computed. [2019-11-23 22:49:31,569 INFO L440 ceAbstractionStarter]: At program point L270-1(lines 261 278) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_st~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= 0 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse0 (<= ~q_req_up~0 0) .cse2 .cse3 .cse4 (<= 2 ~q_read_ev~0) .cse11 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-23 22:49:31,569 INFO L444 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2019-11-23 22:49:31,569 INFO L440 ceAbstractionStarter]: At program point L270-3(lines 261 278) the Hoare annotation is: (let ((.cse29 (+ ~c_num_read~0 1))) (let ((.cse12 (= 1 ~p_num_write~0)) (.cse1 (= ~q_write_ev~0 1)) (.cse20 (<= .cse29 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse29)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse10 (= 0 ~q_free~0)) (.cse24 (= 0 ~p_dw_st~0)) (.cse22 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse23 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse25 (= 0 ~p_dw_pc~0)) (.cse5 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse7 (= ~c_dr_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse26 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse28 (= 0 ~p_num_write~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse17 (<= 2 ~c_dr_st~0)) (.cse18 (= ~c_dr_pc~0 1)) (.cse19 (= 1 ~q_free~0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse2 .cse14 .cse17 .cse18 .cse19 .cse3 .cse6 .cse8) (and .cse20 .cse10 .cse2 .cse14 .cse17 .cse18 .cse21 .cse3 .cse6 .cse8) (and .cse10 .cse11 .cse2 .cse17 .cse13 .cse4 .cse5 .cse6) (and .cse16 .cse0 .cse22 .cse14 .cse23 .cse17 .cse18 .cse3 .cse24 .cse4 .cse5 .cse25 .cse6 .cse15 .cse11 .cse26 .cse27 .cse19) (and .cse22 .cse2 .cse14 .cse23 .cse17 .cse4 .cse25 .cse5 .cse6 .cse9 .cse11 .cse26 .cse27 .cse19 .cse13 .cse28) (and .cse22 .cse14 .cse23 .cse17 .cse24 .cse4 .cse25 .cse5 .cse6 .cse9 .cse11 .cse26 .cse27 .cse19 .cse13 .cse28) (and .cse16 .cse22 .cse2 .cse14 .cse23 .cse17 .cse18 .cse4 .cse5 .cse25 .cse6 .cse15 .cse11 .cse26 .cse27 .cse19) (and .cse0 .cse20 .cse10 .cse2 .cse14 .cse17 .cse18 .cse21 .cse3 .cse6) (and .cse0 .cse20 .cse10 .cse2 .cse1 .cse17 .cse21 .cse18 .cse3 .cse6 .cse8) (and .cse15 .cse16 .cse0 .cse2 .cse14 .cse17 .cse18 .cse19 .cse6 .cse8) (and .cse10 .cse11 .cse17 .cse24 .cse13 .cse4 .cse5 .cse6) (and .cse15 .cse16 .cse0 .cse14 .cse17 .cse18 .cse19 .cse3 .cse24 .cse6 .cse8) (and .cse0 .cse20 .cse10 .cse2 .cse14 .cse18 .cse21 .cse3 .cse6 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse14 .cse17 .cse18 .cse3 .cse6) (and .cse0 .cse22 .cse14 .cse23 .cse3 .cse24 .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse19 .cse13 .cse28) (and .cse22 .cse2 .cse14 .cse23 .cse4 .cse25 .cse5 .cse6 .cse7 .cse9 .cse11 .cse26 .cse27 .cse19 .cse13 .cse28) (and .cse15 .cse16 .cse0 .cse2 .cse14 .cse17 .cse18 .cse19 .cse3 .cse6)))) [2019-11-23 22:49:31,570 INFO L440 ceAbstractionStarter]: At program point L452(lines 438 454) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_free~0 1) (<= 2 ~q_write_ev~0) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2019-11-23 22:49:31,570 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2019-11-23 22:49:31,570 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2019-11-23 22:49:31,570 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 56 61) no Hoare annotation was computed. [2019-11-23 22:49:31,570 INFO L440 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse17 (<= .cse27 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse27)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse20 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse21 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= 0 ~p_dw_pc~0)) (.cse4 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse6 (= ~c_dr_st~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse24 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse26 (= 0 ~p_num_write~0)) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (= 1 ~q_free~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 1 ~p_num_write~0) .cse11) (and .cse12 .cse13 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5 .cse7) (and .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse14 .cse11 .cse3 .cse4 .cse5) (and .cse13 .cse19 .cse20 .cse1 .cse21 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse20 .cse0 .cse1 .cse21 .cse14 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse1 .cse21 .cse14 .cse22 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse13 .cse20 .cse0 .cse1 .cse21 .cse14 .cse15 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse5 .cse7) (and .cse9 .cse10 .cse14 .cse22 .cse11 .cse3 .cse4 .cse5) (and .cse12 .cse13 .cse19 .cse1 .cse14 .cse15 .cse16 .cse2 .cse22 .cse5 .cse7) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse15 .cse18 .cse2 .cse5 .cse6 .cse7) (and .cse19 .cse9 .cse10 .cse0 .cse1 .cse14 .cse15 .cse2 .cse5) (and .cse19 .cse20 .cse1 .cse21 .cse2 .cse22 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse0 .cse1 .cse21 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5)))) [2019-11-23 22:49:31,571 INFO L444 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2019-11-23 22:49:31,571 INFO L440 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse17 (<= .cse27 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse27)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse20 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse21 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= 0 ~p_dw_pc~0)) (.cse4 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse6 (= ~c_dr_st~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse24 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse26 (= 0 ~p_num_write~0)) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (= 1 ~q_free~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 1 ~p_num_write~0) .cse11) (and .cse12 .cse13 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5 .cse7) (and .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse14 .cse11 .cse3 .cse4 .cse5) (and .cse13 .cse19 .cse20 .cse1 .cse21 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse20 .cse0 .cse1 .cse21 .cse14 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse1 .cse21 .cse14 .cse22 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse13 .cse20 .cse0 .cse1 .cse21 .cse14 .cse15 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse5 .cse7) (and .cse9 .cse10 .cse14 .cse22 .cse11 .cse3 .cse4 .cse5) (and .cse12 .cse13 .cse19 .cse1 .cse14 .cse15 .cse16 .cse2 .cse22 .cse5 .cse7) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse15 .cse18 .cse2 .cse5 .cse6 .cse7) (and .cse19 .cse9 .cse10 .cse0 .cse1 .cse14 .cse15 .cse2 .cse5) (and .cse19 .cse20 .cse1 .cse21 .cse2 .cse22 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse0 .cse1 .cse21 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5)))) [2019-11-23 22:49:31,571 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2019-11-23 22:49:31,572 INFO L440 ceAbstractionStarter]: At program point L288-3(lines 279 296) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse25 (<= .cse27 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse26 (<= ~p_num_write~0 .cse27)) (.cse12 (= 1 ~p_dw_pc~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse14 (<= ~q_req_up~0 0)) (.cse10 (<= 2 ~q_read_ev~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse17 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 1 ~q_free~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse3 .cse10 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse14 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse10 .cse8) (and .cse16 .cse14 .cse17 .cse9 .cse3 .cse4 .cse15 .cse10 .cse18 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse17 .cse2 .cse9 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse9 .cse3 .cse4 .cse18 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse16 .cse17 .cse2 .cse9 .cse3 .cse4 .cse15 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse8 .cse12) (and .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse16 .cse14 .cse1 .cse9 .cse4 .cse15 .cse23 .cse10 .cse18 .cse8 .cse12) (and .cse20 .cse16 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8 .cse12) (and .cse14 .cse25 .cse0 .cse2 .cse9 .cse3 .cse15 .cse26 .cse10 .cse8 .cse11 .cse12) (and .cse25 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse26 .cse10 .cse8 .cse12) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8) (and .cse14 .cse17 .cse9 .cse3 .cse10 .cse18 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse2 .cse9 .cse3 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24)))) [2019-11-23 22:49:31,572 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-11-23 22:49:31,572 INFO L444 ceAbstractionStarter]: For program point L305-2(lines 305 309) no Hoare annotation was computed. [2019-11-23 22:49:31,572 INFO L444 ceAbstractionStarter]: For program point L305-3(lines 305 309) no Hoare annotation was computed. [2019-11-23 22:49:31,572 INFO L444 ceAbstractionStarter]: For program point L305-5(lines 305 309) no Hoare annotation was computed. [2019-11-23 22:49:31,572 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2019-11-23 22:49:31,572 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2019-11-23 22:49:31,572 INFO L444 ceAbstractionStarter]: For program point L74-3(lines 74 83) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point L74-5(lines 74 83) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point L25-2(lines 24 39) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point L25-3(lines 25 29) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point L25-5(lines 24 39) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L440 ceAbstractionStarter]: At program point L339(lines 329 369) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse17 (<= .cse27 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse27)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse20 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse21 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= 0 ~p_dw_pc~0)) (.cse4 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse6 (= ~c_dr_st~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse24 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse26 (= 0 ~p_num_write~0)) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (= 1 ~q_free~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 1 ~p_num_write~0) .cse11) (and .cse12 .cse13 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5 .cse7) (and .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse14 .cse11 .cse3 .cse4 .cse5) (and .cse13 .cse19 .cse20 .cse1 .cse21 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse20 .cse0 .cse1 .cse21 .cse14 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse1 .cse21 .cse14 .cse22 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse13 .cse20 .cse0 .cse1 .cse21 .cse14 .cse15 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse5 .cse7) (and .cse9 .cse10 .cse14 .cse22 .cse11 .cse3 .cse4 .cse5) (and .cse12 .cse13 .cse19 .cse1 .cse14 .cse15 .cse16 .cse2 .cse22 .cse5 .cse7) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse15 .cse18 .cse2 .cse5 .cse6 .cse7) (and .cse19 .cse9 .cse10 .cse0 .cse1 .cse14 .cse15 .cse2 .cse5) (and .cse19 .cse20 .cse1 .cse21 .cse2 .cse22 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse0 .cse1 .cse21 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5)))) [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-23 22:49:31,573 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 75 80) no Hoare annotation was computed. [2019-11-23 22:49:31,574 INFO L440 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse17 (<= .cse27 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse27)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse20 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse21 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= 0 ~p_dw_pc~0)) (.cse4 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse6 (= ~c_dr_st~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse24 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse26 (= 0 ~p_num_write~0)) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (= 1 ~q_free~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 1 ~p_num_write~0) .cse11) (and .cse12 .cse13 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5 .cse7) (and .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse14 .cse11 .cse3 .cse4 .cse5) (and .cse13 .cse19 .cse20 .cse1 .cse21 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse20 .cse0 .cse1 .cse21 .cse14 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse1 .cse21 .cse14 .cse22 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse13 .cse20 .cse0 .cse1 .cse21 .cse14 .cse15 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse5 .cse7) (and .cse9 .cse10 .cse14 .cse22 .cse11 .cse3 .cse4 .cse5) (and .cse12 .cse13 .cse19 .cse1 .cse14 .cse15 .cse16 .cse2 .cse22 .cse5 .cse7) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse15 .cse18 .cse2 .cse5 .cse6 .cse7) (and .cse19 .cse9 .cse10 .cse0 .cse1 .cse14 .cse15 .cse2 .cse5) (and .cse19 .cse20 .cse1 .cse21 .cse2 .cse22 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse0 .cse1 .cse21 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5)))) [2019-11-23 22:49:31,574 INFO L440 ceAbstractionStarter]: At program point L257-1(lines 244 259) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse25 (<= .cse27 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse26 (<= ~p_num_write~0 .cse27)) (.cse12 (= 1 ~p_dw_pc~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse14 (<= ~q_req_up~0 0)) (.cse10 (<= 2 ~q_read_ev~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse17 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 1 ~q_free~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse3 .cse10 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse14 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse10 .cse8) (and .cse16 .cse14 .cse17 .cse9 .cse3 .cse4 .cse15 .cse10 .cse18 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse17 .cse2 .cse9 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse9 .cse3 .cse4 .cse18 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse16 .cse17 .cse2 .cse9 .cse3 .cse4 .cse15 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse8 .cse12) (and .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse16 .cse14 .cse1 .cse9 .cse4 .cse15 .cse23 .cse10 .cse18 .cse8 .cse12) (and .cse20 .cse16 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8 .cse12) (and .cse14 .cse25 .cse0 .cse2 .cse9 .cse3 .cse15 .cse26 .cse10 .cse8 .cse11 .cse12) (and .cse25 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse26 .cse10 .cse8 .cse12) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8) (and .cse14 .cse17 .cse9 .cse3 .cse10 .cse18 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse2 .cse9 .cse3 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24)))) [2019-11-23 22:49:31,575 INFO L444 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-23 22:49:31,575 INFO L444 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-23 22:49:31,575 INFO L440 ceAbstractionStarter]: At program point L258(lines 241 260) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse17 (<= .cse27 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse27)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse22 (= 0 ~p_dw_st~0)) (.cse20 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse21 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= 0 ~p_dw_pc~0)) (.cse4 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse6 (= ~c_dr_st~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse24 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse26 (= 0 ~p_num_write~0)) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse14 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (= 1 ~q_free~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 1 ~p_num_write~0) .cse11) (and .cse12 .cse13 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5 .cse7) (and .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse14 .cse11 .cse3 .cse4 .cse5) (and .cse13 .cse19 .cse20 .cse1 .cse21 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse20 .cse0 .cse1 .cse21 .cse14 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse1 .cse21 .cse14 .cse22 .cse3 .cse23 .cse4 .cse5 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse13 .cse20 .cse0 .cse1 .cse21 .cse14 .cse15 .cse3 .cse4 .cse23 .cse5 .cse12 .cse10 .cse24 .cse25 .cse16) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse14 .cse15 .cse18 .cse2 .cse5) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse5 .cse7) (and .cse9 .cse10 .cse14 .cse22 .cse11 .cse3 .cse4 .cse5) (and .cse12 .cse13 .cse19 .cse1 .cse14 .cse15 .cse16 .cse2 .cse22 .cse5 .cse7) (and .cse19 .cse17 .cse9 .cse0 .cse1 .cse15 .cse18 .cse2 .cse5 .cse6 .cse7) (and .cse19 .cse9 .cse10 .cse0 .cse1 .cse14 .cse15 .cse2 .cse5) (and .cse19 .cse20 .cse1 .cse21 .cse2 .cse22 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse20 .cse0 .cse1 .cse21 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse24 .cse25 .cse16 .cse11 .cse26) (and .cse12 .cse13 .cse19 .cse0 .cse1 .cse14 .cse15 .cse16 .cse2 .cse5)))) [2019-11-23 22:49:31,576 INFO L440 ceAbstractionStarter]: At program point L258-1(lines 241 260) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse25 (<= .cse27 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse26 (<= ~p_num_write~0 .cse27)) (.cse12 (= 1 ~p_dw_pc~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse14 (<= ~q_req_up~0 0)) (.cse10 (<= 2 ~q_read_ev~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse17 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 1 ~q_free~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse3 .cse10 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse14 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse10 .cse8) (and .cse16 .cse14 .cse17 .cse9 .cse3 .cse4 .cse15 .cse10 .cse18 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse17 .cse2 .cse9 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse9 .cse3 .cse4 .cse18 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse16 .cse17 .cse2 .cse9 .cse3 .cse4 .cse15 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse8 .cse12) (and .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse16 .cse14 .cse1 .cse9 .cse4 .cse15 .cse23 .cse10 .cse18 .cse8 .cse12) (and .cse20 .cse16 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8 .cse12) (and .cse14 .cse25 .cse0 .cse2 .cse9 .cse3 .cse15 .cse26 .cse10 .cse8 .cse11 .cse12) (and .cse25 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse26 .cse10 .cse8 .cse12) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8) (and .cse14 .cse17 .cse9 .cse3 .cse10 .cse18 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse2 .cse9 .cse3 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24)))) [2019-11-23 22:49:31,576 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2019-11-23 22:49:31,576 INFO L440 ceAbstractionStarter]: At program point L11-1(lines 158 206) the Hoare annotation is: (let ((.cse4 (<= 2 ~q_read_ev~0)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse9 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse10 (= 0 ~p_dw_pc~0)) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= 1 ~q_free~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (<= ~q_req_up~0 0) .cse8 .cse3 .cse9 .cse4 (= 0 ~p_dw_st~0) .cse10 .cse11 .cse12 .cse6 .cse0 .cse13 .cse14 .cse15 .cse5) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) (= 0 ~q_free~0) .cse13 .cse2 .cse3 (<= ~p_num_write~0 .cse16) .cse4 .cse11 .cse12 .cse6 .cse7)) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse12 .cse6 .cse0 .cse13 .cse14 .cse15 .cse5))) [2019-11-23 22:49:31,576 INFO L440 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse25 (<= .cse27 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse26 (<= ~p_num_write~0 .cse27)) (.cse12 (= 1 ~p_dw_pc~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse14 (<= ~q_req_up~0 0)) (.cse10 (<= 2 ~q_read_ev~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse17 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 1 ~q_free~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse3 .cse10 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse14 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse10 .cse8) (and .cse16 .cse14 .cse17 .cse9 .cse3 .cse4 .cse15 .cse10 .cse18 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse17 .cse2 .cse9 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse9 .cse3 .cse4 .cse18 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse16 .cse17 .cse2 .cse9 .cse3 .cse4 .cse15 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse8 .cse12) (and .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse16 .cse14 .cse1 .cse9 .cse4 .cse15 .cse23 .cse10 .cse18 .cse8 .cse12) (and .cse20 .cse16 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8 .cse12) (and .cse14 .cse25 .cse0 .cse2 .cse9 .cse3 .cse15 .cse26 .cse10 .cse8 .cse11 .cse12) (and .cse25 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse26 .cse10 .cse8 .cse12) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8) (and .cse14 .cse17 .cse9 .cse3 .cse10 .cse18 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse2 .cse9 .cse3 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24)))) [2019-11-23 22:49:31,577 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2019-11-23 22:49:31,577 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:49:31,577 INFO L440 ceAbstractionStarter]: At program point L392(lines 376 394) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse25 (<= .cse27 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse26 (<= ~p_num_write~0 .cse27)) (.cse12 (= 1 ~p_dw_pc~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse14 (<= ~q_req_up~0 0)) (.cse10 (<= 2 ~q_read_ev~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse17 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 1 ~q_free~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse3 .cse10 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse14 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse10 .cse8) (and .cse16 .cse14 .cse17 .cse9 .cse3 .cse4 .cse15 .cse10 .cse18 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse17 .cse2 .cse9 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse9 .cse3 .cse4 .cse18 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse16 .cse17 .cse2 .cse9 .cse3 .cse4 .cse15 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse8 .cse12) (and .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse16 .cse14 .cse1 .cse9 .cse4 .cse15 .cse23 .cse10 .cse18 .cse8 .cse12) (and .cse20 .cse16 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8 .cse12) (and .cse14 .cse25 .cse0 .cse2 .cse9 .cse3 .cse15 .cse26 .cse10 .cse8 .cse11 .cse12) (and .cse25 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse26 .cse10 .cse8 .cse12) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8) (and .cse14 .cse17 .cse9 .cse3 .cse10 .cse18 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse2 .cse9 .cse3 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24)))) [2019-11-23 22:49:31,577 INFO L444 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2019-11-23 22:49:31,578 INFO L440 ceAbstractionStarter]: At program point L409-1(lines 279 431) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse25 (<= .cse27 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse26 (<= ~p_num_write~0 .cse27)) (.cse12 (= 1 ~p_dw_pc~0)) (.cse20 (<= ~c_num_read~0 ~p_num_write~0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse14 (<= ~q_req_up~0 0)) (.cse10 (<= 2 ~q_read_ev~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse17 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~c_dr_st~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= 1 ~q_free~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse24 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse9 .cse3 .cse10 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse0 .cse1 (= 1 ~p_num_write~0) .cse5) (and .cse14 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse10 .cse8) (and .cse16 .cse14 .cse17 .cse9 .cse3 .cse4 .cse15 .cse10 .cse18 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse17 .cse2 .cse9 .cse3 .cse4 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse9 .cse3 .cse4 .cse18 .cse6 .cse19 .cse7 .cse8 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse16 .cse17 .cse2 .cse9 .cse3 .cse4 .cse15 .cse6 .cse7 .cse19 .cse8 .cse20 .cse1 .cse21 .cse22 .cse23) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse8 .cse12) (and .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8) (and .cse20 .cse16 .cse14 .cse1 .cse9 .cse4 .cse15 .cse23 .cse10 .cse18 .cse8 .cse12) (and .cse20 .cse16 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8 .cse12) (and .cse14 .cse25 .cse0 .cse2 .cse9 .cse3 .cse15 .cse26 .cse10 .cse8 .cse11 .cse12) (and .cse25 .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse26 .cse10 .cse8 .cse12) (and .cse20 .cse16 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse15 .cse23 .cse10 .cse8) (and .cse14 .cse17 .cse9 .cse3 .cse10 .cse18 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24) (and .cse17 .cse2 .cse9 .cse3 .cse6 .cse19 .cse7 .cse8 .cse11 .cse13 .cse1 .cse21 .cse22 .cse23 .cse5 .cse24)))) [2019-11-23 22:49:31,578 INFO L444 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2019-11-23 22:49:31,578 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-23 22:49:31,578 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2019-11-23 22:49:31,578 INFO L440 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse1 (= 0 ~q_free~0)) (.cse11 (<= ~q_req_up~0 0)) (.cse13 (= ~c_dr_st~0 0)) (.cse14 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse15 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse12 (= ~c_num_read~0 0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse16 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse8 (= ~c_dr_pc~0 0)) (.cse18 (= 0 ~p_num_write~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse4 (= ~c_dr_pc~0 1)) (.cse17 (= 1 ~q_free~0)) (.cse5 (<= 2 ~q_read_ev~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (or (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) .cse1 .cse2 .cse3 .cse4 (<= ~p_num_write~0 .cse0) .cse5 .cse6)) (and .cse1 .cse7 .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse1 .cse7 .cse2 (= 1 ~p_num_write~0) .cse5 .cse8 .cse9 .cse10 .cse6 .cse13) (and .cse11 .cse14 .cse2 .cse15 .cse5 .cse9 .cse10 .cse6 .cse13 .cse12 .cse7 .cse16 .cse17 .cse8 .cse18) (and .cse14 .cse2 .cse15 .cse3 .cse9 .cse10 .cse6 .cse12 .cse7 .cse16 .cse17 .cse8 .cse18) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 .cse4 .cse17 .cse5 .cse6))) [2019-11-23 22:49:31,578 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2019-11-23 22:49:31,579 INFO L444 ceAbstractionStarter]: For program point L30-3(lines 30 34) no Hoare annotation was computed. [2019-11-23 22:49:31,579 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 22:49:31,579 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2019-11-23 22:49:31,579 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 218) no Hoare annotation was computed. [2019-11-23 22:49:31,579 INFO L444 ceAbstractionStarter]: For program point L245-1(lines 245 255) no Hoare annotation was computed. [2019-11-23 22:49:31,579 INFO L440 ceAbstractionStarter]: At program point L212-1(lines 227 231) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_free~0 1) (<= 2 ~q_write_ev~0) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2019-11-23 22:49:31,579 INFO L444 ceAbstractionStarter]: For program point L212-2(lines 212 218) no Hoare annotation was computed. [2019-11-23 22:49:31,580 INFO L440 ceAbstractionStarter]: At program point L212-3(lines 208 222) the Hoare annotation is: (let ((.cse29 (+ ~c_num_read~0 1))) (let ((.cse21 (= ~q_write_ev~0 0)) (.cse11 (= 1 ~p_num_write~0)) (.cse18 (<= .cse29 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 .cse29)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse24 (= 0 ~p_dw_st~0)) (.cse22 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse23 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse25 (= 0 ~p_dw_pc~0)) (.cse4 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse6 (= ~c_dr_st~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse26 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse28 (= 0 ~p_num_write~0)) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse15 (<= 2 ~c_dr_st~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse17 (= 1 ~q_free~0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse1 .cse15 .cse16 .cse17 .cse2 .cse5 .cse7) (and .cse18 .cse9 .cse0 .cse1 .cse15 .cse16 .cse19 .cse2 .cse5 .cse7) (and .cse9 .cse10 .cse0 .cse15 .cse12 .cse3 .cse4 .cse5) (and .cse20 .cse18 .cse9 .cse21 .cse0 .cse15 .cse19 .cse16 .cse2 .cse5 .cse7) (and .cse14 .cse20 .cse22 .cse1 .cse23 .cse15 .cse16 .cse2 .cse24 .cse3 .cse4 .cse25 .cse5 .cse13 .cse10 .cse26 .cse27 .cse17) (and .cse22 .cse0 .cse1 .cse23 .cse15 .cse3 .cse25 .cse4 .cse5 .cse8 .cse10 .cse26 .cse27 .cse17 .cse12 .cse28) (and .cse20 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12) (and .cse22 .cse1 .cse23 .cse15 .cse24 .cse3 .cse25 .cse4 .cse5 .cse8 .cse10 .cse26 .cse27 .cse17 .cse12 .cse28) (and .cse14 .cse22 .cse0 .cse1 .cse23 .cse15 .cse16 .cse3 .cse4 .cse25 .cse5 .cse13 .cse10 .cse26 .cse27 .cse17) (and .cse20 .cse18 .cse9 .cse0 .cse1 .cse15 .cse16 .cse19 .cse2 .cse5) (and .cse13 .cse14 .cse20 .cse0 .cse1 .cse15 .cse16 .cse17 .cse5 .cse7) (and .cse9 .cse10 .cse15 .cse24 .cse12 .cse3 .cse4 .cse5) (and .cse13 .cse14 .cse20 .cse1 .cse15 .cse16 .cse17 .cse2 .cse24 .cse5 .cse7) (and .cse20 .cse18 .cse9 .cse0 .cse1 .cse16 .cse19 .cse2 .cse5 .cse6 .cse7) (and .cse20 .cse9 .cse10 .cse0 .cse1 .cse15 .cse16 .cse2 .cse5) (and .cse20 .cse22 .cse1 .cse23 .cse2 .cse24 .cse3 .cse25 .cse4 .cse5 .cse6 .cse8 .cse10 .cse26 .cse27 .cse17 .cse12 .cse28) (and .cse22 .cse0 .cse1 .cse23 .cse3 .cse25 .cse4 .cse5 .cse6 .cse8 .cse10 .cse26 .cse27 .cse17 .cse12 .cse28) (and .cse13 .cse14 .cse20 .cse0 .cse1 .cse15 .cse16 .cse17 .cse2 .cse5)))) [2019-11-23 22:49:31,580 INFO L440 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (= 0 ~q_free~0) (<= 2 ~p_dw_st~0) (<= 2 ~q_write_ev~0) (<= ~p_num_write~0 .cse0) (= ~c_dr_pc~0 1) (<= 2 ~q_read_ev~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0))) [2019-11-23 22:49:31,580 INFO L444 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2019-11-23 22:49:31,580 INFO L440 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse2 (<= 2 ~q_read_ev~0)) (.cse10 (= ~c_num_read~0 0)) (.cse8 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse4 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse9 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= 0 ~p_num_write~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2 .cse3) (and (= 0 ~q_free~0) .cse4 .cse1 .cse5 .cse6 .cse7 .cse3) (and (<= ~q_req_up~0 0) .cse8 .cse0 .cse9 .cse2 .cse6 .cse7 .cse3 (= ~c_dr_st~0 0) .cse10 .cse4 .cse11 .cse5 .cse12) (and .cse10 .cse8 .cse4 .cse11 .cse0 .cse9 .cse1 .cse5 .cse6 .cse7 .cse3 .cse12))) [2019-11-23 22:49:31,580 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:49:31,581 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-11-23 22:49:31,581 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-23 22:49:31,581 INFO L440 ceAbstractionStarter]: At program point L313-2(lines 283 287) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse17 (= ~c_dr_st~0 0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse16 (= 0 ~p_dw_st~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= 0 ~p_dw_pc~0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~c_num_read~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse11 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= 1 ~q_free~0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (<= ~q_req_up~0 0) .cse0 .cse2 .cse3 (<= 2 ~q_read_ev~0) .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-23 22:49:31,581 INFO L444 ceAbstractionStarter]: For program point L313-3(lines 313 317) no Hoare annotation was computed. [2019-11-23 22:49:31,582 INFO L440 ceAbstractionStarter]: At program point L313-5(lines 283 287) the Hoare annotation is: (let ((.cse29 (+ ~c_num_read~0 1))) (let ((.cse21 (= 1 ~p_num_write~0)) (.cse23 (= ~q_write_ev~0 1)) (.cse26 (= 0 ~p_dw_pc~0)) (.cse20 (= ~c_num_read~0 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse28 (= 0 ~p_num_write~0)) (.cse11 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse24 (<= .cse29 ~p_num_write~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse3 (= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse14 (<= 2 ~q_read_ev~0)) (.cse18 (= ~c_dr_st~0 0)) (.cse0 (= 0 ~q_free~0)) (.cse16 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse25 (<= ~p_num_write~0 .cse29)) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (<= ~q_req_up~0 0)) (.cse12 (<= 2 ~q_write_ev~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse13 (= ~c_dr_pc~0 1)) (.cse22 (= 0 ~p_dw_st~0)) (.cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 1 ~p_dw_pc~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse17 (= 1 ~q_free~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse14 .cse6 .cse7 .cse8 .cse15 .cse1 .cse16 .cse17) (and .cse11 .cse2 .cse12 .cse3 .cse14 .cse6 .cse7 .cse8 .cse18 .cse19 .cse20 .cse0 .cse1 .cse16 .cse21 .cse5) (and .cse9 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14 .cse22 .cse6 .cse7 .cse8 .cse19 .cse15 .cse1 .cse16 .cse17) (and .cse10 .cse11 .cse2 .cse23 .cse3 .cse14 .cse6 .cse7 .cse8 .cse18 .cse19 .cse20 .cse0 .cse1 .cse16 .cse21 .cse5) (and .cse11 .cse24 .cse2 .cse12 .cse3 .cse4 .cse13 .cse14 .cse6 .cse7 .cse8 .cse19 .cse0 .cse1 .cse16 .cse25) (and .cse9 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14 .cse22 .cse6 .cse7 .cse26 .cse8 .cse15 .cse1 .cse16 .cse27 .cse17) (and .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse26 .cse7 .cse8 .cse20 .cse1 .cse16 .cse27 .cse17 .cse5 .cse28) (and .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse14 .cse6 .cse7 .cse8 .cse0 .cse1 .cse16) (and .cse11 .cse12 .cse3 .cse4 .cse22 .cse6 .cse26 .cse7 .cse8 .cse20 .cse1 .cse16 .cse27 .cse17 .cse5 .cse28) (and .cse9 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse6 .cse7 .cse26 .cse8 .cse15 .cse1 .cse16 .cse27 .cse17) (and (or (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse13 .cse14 .cse8) (and .cse9 .cse10 .cse11 .cse2 .cse3 .cse4 .cse13 .cse14 .cse8 .cse15 .cse1 .cse16 .cse17)) .cse23 .cse19) (and .cse10 .cse11 .cse24 .cse23 .cse2 .cse3 .cse13 .cse14 .cse8 .cse18 .cse19 .cse0 .cse16 .cse25) (and .cse0 .cse1 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse2 .cse12 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse19 .cse15 .cse1 .cse17) (and .cse9 .cse11 .cse2 .cse12 .cse3 .cse4 .cse13 .cse14 .cse6 .cse7 .cse8 .cse19 .cse15 .cse1 .cse16 .cse17) (and .cse10 .cse11 .cse12 .cse3 .cse14 .cse22 .cse6 .cse26 .cse7 .cse8 .cse18 .cse20 .cse1 .cse16 .cse27 .cse17 .cse5 .cse28) (and .cse11 .cse2 .cse12 .cse3 .cse6 .cse26 .cse7 .cse8 .cse18 .cse20 .cse1 .cse16 .cse27 .cse17 .cse5 .cse28) (and .cse10 .cse11 .cse24 .cse2 .cse12 .cse3 .cse13 .cse14 .cse6 .cse7 .cse8 .cse18 .cse19 .cse0 .cse1 .cse16 .cse25) (and .cse9 .cse10 .cse12 .cse4 .cse13 .cse22 .cse6 .cse7 .cse8 .cse19 .cse15 .cse1 .cse17 (= ~q_read_ev~0 1))))) [2019-11-23 22:49:31,582 INFO L444 ceAbstractionStarter]: For program point L330(line 330) no Hoare annotation was computed. [2019-11-23 22:49:31,582 INFO L440 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse2 (= 0 ~p_dw_st~0)) (.cse5 (= ~c_dr_st~0 0)) (.cse6 (= ~c_num_read~0 0)) (.cse0 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_write_ev~0)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= 1 ~q_free~0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 0 ~p_num_write~0))) (or (and (<= ~q_req_up~0 0) .cse0 .cse1 (<= 2 ~q_read_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse0 .cse1 .cse11 .cse7 .cse8 .cse2 .cse9 .cse3 .cse4 .cse10) (and .cse6 .cse0 .cse12 .cse1 .cse7 .cse8 .cse9 .cse3 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse12 .cse1 .cse11 .cse7 .cse8 .cse9 .cse3 .cse4 .cse10))) [2019-11-23 22:49:31,582 INFO L440 ceAbstractionStarter]: At program point L66-1(lines 54 68) the Hoare annotation is: (let ((.cse26 (+ ~c_num_read~0 1))) (let ((.cse18 (<= .cse26 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse26)) (.cse7 (= 0 ~p_dw_st~0)) (.cse10 (= 0 ~p_dw_pc~0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= 0 ~p_num_write~0)) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse14 (= 1 ~q_free~0)) (.cse1 (<= ~q_req_up~0 0)) (.cse2 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse21 (<= 2 ~p_dw_st~0)) (.cse20 (= ~q_write_ev~0 1)) (.cse6 (<= 2 ~q_read_ev~0)) (.cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse9 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~c_dr_st~0 0)) (.cse23 (= 1 ~p_dw_pc~0)) (.cse15 (= ~c_num_read~0 0)) (.cse19 (= 0 ~q_free~0)) (.cse25 (= 1 ~p_num_write~0)) (.cse16 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse9 .cse11 .cse15 .cse13 .cse14 .cse16 .cse17) (and .cse1 .cse2 .cse18 .cse19 .cse20 .cse21 .cse4 .cse22 .cse5 .cse6 .cse11 .cse23) (and .cse19 .cse4 .cse7 .cse16 .cse8 .cse9 .cse11) (and .cse0 .cse2 .cse21 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse12 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse14 .cse11 .cse23) (and .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse24 .cse15 .cse13 .cse14 .cse16 .cse17) (and .cse19 .cse21 .cse4 .cse16 .cse8 .cse9 .cse11) (and .cse2 .cse18 .cse19 .cse21 .cse3 .cse4 .cse22 .cse5 .cse6 .cse11 .cse23) (and .cse1 .cse2 .cse18 .cse19 .cse21 .cse3 .cse22 .cse5 .cse6 .cse11 .cse24 .cse23) (and .cse2 .cse21 .cse3 .cse6 .cse8 .cse9 .cse11 .cse24 .cse23 .cse15 .cse19 .cse25 .cse16) (and .cse1 .cse2 .cse19 .cse21 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse11 .cse23) (and .cse2 .cse21 .cse3 .cse8 .cse10 .cse9 .cse11 .cse24 .cse15 .cse13 .cse14 .cse16 .cse17) (and .cse12 .cse0 .cse1 .cse21 .cse3 .cse4 .cse5 .cse14 .cse11 (= ~q_read_ev~0 1) .cse23) (and .cse12 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse14 .cse6 .cse11) (and .cse2 .cse21 .cse3 .cse4 .cse8 .cse10 .cse9 .cse11 .cse15 .cse13 .cse14 .cse16 .cse17) (and .cse12 .cse0 .cse2 .cse21 .cse3 .cse4 .cse5 .cse14 .cse6 .cse11 .cse23) (and .cse1 .cse2 .cse21 .cse20 .cse6 .cse8 .cse9 .cse11 .cse24 .cse23 .cse15 .cse19 .cse25 .cse16)))) [2019-11-23 22:49:31,583 INFO L444 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2019-11-23 22:49:31,583 INFO L440 ceAbstractionStarter]: At program point L232-1(lines 265 269) the Hoare annotation is: (let ((.cse1 (<= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_st~0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= 0 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse0 (<= ~q_req_up~0 0) .cse2 .cse3 .cse4 (<= 2 ~q_read_ev~0) .cse11 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-23 22:49:31,583 INFO L444 ceAbstractionStarter]: For program point L265-2(lines 265 269) no Hoare annotation was computed. [2019-11-23 22:49:31,583 INFO L444 ceAbstractionStarter]: For program point L265-4(lines 264 277) no Hoare annotation was computed. [2019-11-23 22:49:31,583 INFO L440 ceAbstractionStarter]: At program point L67(lines 51 69) the Hoare annotation is: (let ((.cse2 (<= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse3 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= 2 ~c_dr_st~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 1 ~q_free~0)) (.cse13 (= 0 ~p_dw_st~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (and (<= ~q_req_up~0 0) .cse1 .cse4 (<= 2 ~q_read_ev~0) .cse13 .cse9 .cse10 .cse12 .cse0 .cse3 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11))) [2019-11-23 22:49:31,584 INFO L440 ceAbstractionStarter]: At program point L67-1(lines 51 69) the Hoare annotation is: (let ((.cse27 (+ ~c_num_read~0 1))) (let ((.cse3 (= ~q_write_ev~0 1)) (.cse21 (= 0 ~p_num_write~0)) (.cse0 (<= ~q_req_up~0 0)) (.cse16 (= 0 ~p_dw_st~0)) (.cse26 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= 0 ~p_dw_pc~0)) (.cse25 (<= ~c_num_read~0 ~p_num_write~0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= 1 ~q_free~0)) (.cse22 (<= .cse27 ~p_num_write~0)) (.cse15 (<= 2 ~c_dr_st~0)) (.cse24 (<= ~p_num_write~0 .cse27)) (.cse23 (= ~c_dr_pc~0 1)) (.cse1 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse17 (<= 2 ~q_write_ev~0)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= 0 ~q_free~0)) (.cse12 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse13 (= 1 ~p_num_write~0)) (.cse14 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse11 .cse15 .cse16 .cse14 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse17 .cse15 .cse5 .cse18 .cse6 .cse7 .cse10 .cse12 .cse19 .cse20 .cse14 .cse21) (and .cse11 .cse2 .cse15 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse17 .cse4 .cse16 .cse5 .cse18 .cse6 .cse7 .cse8 .cse10 .cse12 .cse19 .cse20 .cse14 .cse21) (and .cse0 .cse1 .cse22 .cse3 .cse2 .cse15 .cse23 .cse4 .cse7 .cse9 .cse11 .cse12 .cse24) (and .cse1 .cse2 .cse17 .cse5 .cse18 .cse6 .cse7 .cse8 .cse10 .cse12 .cse19 .cse20 .cse14 .cse21) (and .cse25 .cse26 .cse0 .cse1 .cse2 .cse12 .cse17 .cse15 .cse23 .cse20 .cse4 .cse7) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse17 .cse15 .cse23 .cse4 .cse7) (and .cse1 .cse17 .cse15 .cse16 .cse5 .cse18 .cse6 .cse7 .cse10 .cse12 .cse19 .cse20 .cse14 .cse21) (and .cse25 .cse26 .cse0 .cse1 .cse2 .cse12 .cse17 .cse15 .cse23 .cse20 .cse7 .cse9) (and .cse26 .cse0 .cse1 .cse17 .cse15 .cse23 .cse4 .cse16 .cse7 .cse9 .cse25 .cse12 .cse20) (and .cse25 .cse26 .cse1 .cse2 .cse12 .cse17 .cse15 .cse23 .cse20 .cse4 .cse7 .cse9) (and .cse25 .cse26 .cse0 .cse2 .cse17 .cse15 .cse23 .cse20 .cse7 (= ~q_read_ev~0 1) .cse9) (and .cse0 .cse1 .cse22 .cse2 .cse17 .cse23 .cse4 .cse7 .cse8 .cse9 .cse11 .cse12 .cse24) (and .cse26 .cse0 .cse1 .cse17 .cse15 .cse23 .cse4 .cse16 .cse5 .cse6 .cse18 .cse7 .cse25 .cse12 .cse19 .cse20) (and .cse26 .cse1 .cse2 .cse17 .cse15 .cse23 .cse5 .cse6 .cse18 .cse7 .cse25 .cse12 .cse19 .cse20) (and .cse1 .cse22 .cse11 .cse2 .cse12 .cse17 .cse15 .cse24 .cse23 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2019-11-23 22:49:31,584 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-11-23 22:49:31,584 INFO L444 ceAbstractionStarter]: For program point L249-1(lines 249 254) no Hoare annotation was computed. [2019-11-23 22:49:31,584 INFO L447 ceAbstractionStarter]: At program point L464(lines 455 466) the Hoare annotation is: true [2019-11-23 22:49:31,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:49:31 BoogieIcfgContainer [2019-11-23 22:49:31,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:49:31,719 INFO L168 Benchmark]: Toolchain (without parser) took 39560.40 ms. Allocated memory was 144.2 MB in the beginning and 1.1 GB in the end (delta: 964.7 MB). Free memory was 102.9 MB in the beginning and 855.4 MB in the end (delta: -752.5 MB). Peak memory consumption was 878.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:31,720 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:49:31,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.39 ms. Allocated memory was 144.2 MB in the beginning and 204.5 MB in the end (delta: 60.3 MB). Free memory was 102.7 MB in the beginning and 181.6 MB in the end (delta: -79.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:31,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.03 ms. Allocated memory is still 204.5 MB. Free memory was 181.6 MB in the beginning and 178.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:31,721 INFO L168 Benchmark]: Boogie Preprocessor took 31.00 ms. Allocated memory is still 204.5 MB. Free memory was 178.9 MB in the beginning and 177.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:31,721 INFO L168 Benchmark]: RCFGBuilder took 536.15 ms. Allocated memory is still 204.5 MB. Free memory was 176.9 MB in the beginning and 147.9 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:31,722 INFO L168 Benchmark]: TraceAbstraction took 38494.81 ms. Allocated memory was 204.5 MB in the beginning and 1.1 GB in the end (delta: 904.4 MB). Free memory was 147.9 MB in the beginning and 855.4 MB in the end (delta: -707.5 MB). Peak memory consumption was 863.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:31,724 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 144.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 431.39 ms. Allocated memory was 144.2 MB in the beginning and 204.5 MB in the end (delta: 60.3 MB). Free memory was 102.7 MB in the beginning and 181.6 MB in the end (delta: -79.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.03 ms. Allocated memory is still 204.5 MB. Free memory was 181.6 MB in the beginning and 178.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.00 ms. Allocated memory is still 204.5 MB. Free memory was 178.9 MB in the beginning and 177.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 536.15 ms. Allocated memory is still 204.5 MB. Free memory was 176.9 MB in the beginning and 147.9 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38494.81 ms. Allocated memory was 204.5 MB in the beginning and 1.1 GB in the end (delta: 904.4 MB). Free memory was 147.9 MB in the beginning and 855.4 MB in the end (delta: -707.5 MB). Peak memory consumption was 863.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && q_write_ev == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((q_req_up <= 0 && 2 <= p_dw_st) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_write_ev == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) || (((((((((c_num_read == 0 && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && q_req_up <= 0) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0 && q_req_up <= 0) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && 1 == q_free)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((0 == __retres1 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && p_num_write <= c_num_read + 1)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == q_free) && tmp___0 == 0) && 0 == \result)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 0 == \result) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) || ((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && 1 == q_free)) && q_write_ev == 1) && 1 == p_dw_pc)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && q_write_ev == 1) && 2 <= p_dw_st) && 0 == tmp) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && tmp___0 == 0) && 1 == q_free)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && 1 == q_free)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 0 == q_free) && tmp___0 == 0) && 0 == \result) && p_num_write <= c_num_read + 1)) || (((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && tmp___0 == 0) && 1 == q_free) && q_read_ev == 1) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) || ((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((((c_num_read == 0 && 0 == q_free) && tmp___0 == 0) && 2 <= q_write_ev) && 1 == p_num_write) && 2 <= q_read_ev) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((q_req_up <= 0 && q_write_ev == 1) && 2 <= p_dw_st) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0) || ((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && q_write_ev == 1) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0) || ((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && q_write_ev == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && 2 <= q_write_ev) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && 0 == \result) && 1 == q_free)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && q_read_ev == 1) && 1 == p_dw_pc)) || ((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || (((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((0 == __retres1 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) || (((((((((c_num_read == 0 && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && q_req_up <= 0) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((((((((((c_num_read == 0 && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || (((((((((((c_num_read == 0 && 0 == __retres1) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && 0 == \result) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) || ((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read == 0 && 0 == __retres1) && tmp___0 == 0) && 0 == \result) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == p_num_write) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0 && q_req_up <= 0) && q_free == 1) && 2 <= q_write_ev) && c_last_read == p_last_write) && 2 <= q_read_ev) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) || (((((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 0 == \result) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((0 == __retres1 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || (((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && 0 == \result) && 1 == q_free)) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && p_last_write == q_buf_0)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && 1 == q_free)) || ((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && 0 == \result) && 1 == q_free)) || (((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 0 == p_dw_st) && __retres1 == 0) && p_last_write == q_buf_0) && q_read_ev == 1) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((0 == q_free && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && p_last_write == q_buf_0) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= q_read_ev) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || ((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 0 == p_dw_pc) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) || ((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && 1 == q_free)) || ((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && 0 == \result) && 1 == q_free)) || ((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && 1 == q_free)) || ((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 0 == q_free) && 0 == \result)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || ((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && 1 == q_free) && q_read_ev == 1)) || (((((((0 == q_free && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read <= p_num_write) && 0 == \result) && 1 == q_free)) || ((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && q_write_ev == 1) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 0 == \result) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((((((((((0 == __retres1 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 0 == q_free) && 0 == \result) && p_num_write <= c_num_read + 1)) || ((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || ((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) || ((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && c_last_read == p_last_write) && 1 == q_free) || ((((((((((((0 == __retres1 && 2 <= q_write_ev) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 0 == q_free) && q_write_ev == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && c_last_read == p_last_write) && 1 == q_free)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((0 == __retres1 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((q_req_up <= 0 && 0 == __retres1) && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0)) || ((((((((q_req_up <= 0 && 0 == __retres1) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && q_read_ev == 1) && 1 == p_dw_pc)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || ((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= p_dw_st) && q_write_ev == 1) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) || (((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0)) || (((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write) || ((((((((((c_num_read == 0 && 0 == __retres1) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || ((((((((((c_num_read == 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 0 == p_num_write)) || ((((((((((c_num_read == 0 && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= q_read_ev) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && tmp___0 == 0) && 1 == p_num_write) && c_dr_pc == 0) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= c_dr_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || (((((((((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((p_num_write <= c_num_read && 0 == __retres1) && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && 2 <= c_dr_st) && c_dr_pc == 1) && __retres1 == 0) && 0 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((0 == q_free && tmp___0 == 0) && 2 <= c_dr_st) && 0 == p_dw_st) && c_dr_pc == 0) && __retres1 == 0) && 0 == \result) && p_last_write == q_buf_0)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((q_req_up <= 0 && 0 == q_free) && tmp___0 == 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0)) || (((((((((((((((((q_req_up <= 0 && 0 == __retres1) && 2 <= q_write_ev) && 0 == tmp) && 2 <= q_read_ev) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((((((((0 == __retres1 && 2 <= p_dw_st) && 2 <= q_write_ev) && 0 == tmp) && __retres1 == 0) && 0 == p_dw_pc) && 0 == \result) && p_last_write == q_buf_0) && c_dr_st == 0) && c_num_read == 0) && tmp___0 == 0) && 0 == \result) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_req_up <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && c_dr_pc == 1) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 2 error locations. Result: SAFE, OverallTime: 38.2s, OverallIterations: 20, TraceHistogramMax: 5, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 27.0s, HoareTripleCheckerStatistics: 2973 SDtfs, 2477 SDslu, 3468 SDs, 0 SdLazy, 279 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4703occurred 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: 3.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 10890 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 806 NumberOfFragments, 14568 HoareAnnotationTreeSize, 33 FomulaSimplifications, 61803 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 33 FomulaSimplificationsInter, 46488 FormulaSimplificationTreeSizeReductionInter, 24.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1601 NumberOfCodeBlocks, 1601 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1580 ConstructedInterpolants, 0 QuantifiedInterpolants, 222608 SizeOfPredicates, 2 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 644/648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...