java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.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-112bae1 [2019-09-08 06:33:12,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:33:12,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:33:12,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:33:12,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:33:12,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:33:12,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:33:12,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:33:12,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:33:12,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:33:12,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:33:12,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:33:12,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:33:12,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:33:12,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:33:12,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:33:12,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:33:12,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:33:12,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:33:12,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:33:12,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:33:12,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:33:12,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:33:12,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:33:12,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:33:12,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:33:12,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:33:12,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:33:12,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:33:12,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:33:12,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:33:12,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:33:12,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:33:12,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:33:12,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:33:12,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:33:12,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:33:12,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:33:12,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:33:12,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:33:12,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:33:12,540 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-09-08 06:33:12,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:33:12,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:33:12,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:33:12,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:33:12,570 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:33:12,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:33:12,571 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:33:12,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:33:12,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:33:12,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:33:12,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:33:12,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:33:12,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:33:12,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:33:12,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:33:12,574 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:33:12,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:33:12,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:33:12,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:33:12,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:33:12,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:33:12,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:33:12,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:33:12,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:33:12,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:33:12,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:33:12,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:33:12,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:33:12,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:33:12,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:33:12,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:33:12,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:33:12,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:33:12,651 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:33:12,652 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-09-08 06:33:12,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1084c12c/3a2a914572b94f118f1c5c9067851923/FLAGee7c5085a [2019-09-08 06:33:13,216 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:33:13,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2019-09-08 06:33:13,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1084c12c/3a2a914572b94f118f1c5c9067851923/FLAGee7c5085a [2019-09-08 06:33:13,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1084c12c/3a2a914572b94f118f1c5c9067851923 [2019-09-08 06:33:13,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:33:13,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:33:13,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:33:13,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:33:13,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:33:13,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:33:13" (1/1) ... [2019-09-08 06:33:13,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a83a43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:13, skipping insertion in model container [2019-09-08 06:33:13,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:33:13" (1/1) ... [2019-09-08 06:33:13,645 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:33:13,677 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:33:13,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:33:13,975 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:33:14,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:33:14,173 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:33:14,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14 WrapperNode [2019-09-08 06:33:14,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:33:14,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:33:14,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:33:14,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:33:14,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (1/1) ... [2019-09-08 06:33:14,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (1/1) ... [2019-09-08 06:33:14,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (1/1) ... [2019-09-08 06:33:14,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (1/1) ... [2019-09-08 06:33:14,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (1/1) ... [2019-09-08 06:33:14,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (1/1) ... [2019-09-08 06:33:14,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (1/1) ... [2019-09-08 06:33:14,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:33:14,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:33:14,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:33:14,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:33:14,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (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-09-08 06:33:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:33:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:33:14,305 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:33:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-09-08 06:33:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-09-08 06:33:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-09-08 06:33:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-09-08 06:33:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-09-08 06:33:14,306 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-09-08 06:33:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:33:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:33:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:33:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:33:14,307 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:33:14,308 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:33:14,308 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:33:14,308 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:33:14,309 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:33:14,309 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:33:14,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:33:14,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:33:14,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:33:14,309 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:33:14,309 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-09-08 06:33:14,310 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-09-08 06:33:14,310 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-09-08 06:33:14,310 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-09-08 06:33:14,311 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-09-08 06:33:14,311 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-09-08 06:33:14,311 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:33:14,311 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:33:14,311 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:33:14,311 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:33:14,312 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:33:14,312 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:33:14,312 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:33:14,314 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:33:14,314 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:33:14,314 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:33:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:33:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:33:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:33:14,840 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:33:14,840 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 06:33:14,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:33:14 BoogieIcfgContainer [2019-09-08 06:33:14,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:33:14,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:33:14,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:33:14,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:33:14,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:33:13" (1/3) ... [2019-09-08 06:33:14,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a70e558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:33:14, skipping insertion in model container [2019-09-08 06:33:14,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:33:14" (2/3) ... [2019-09-08 06:33:14,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a70e558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:33:14, skipping insertion in model container [2019-09-08 06:33:14,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:33:14" (3/3) ... [2019-09-08 06:33:14,856 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-09-08 06:33:14,867 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:33:14,889 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:33:14,920 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:33:14,960 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:33:14,961 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:33:14,961 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:33:14,961 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:33:14,962 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:33:14,962 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:33:14,962 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:33:14,962 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:33:14,962 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:33:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-09-08 06:33:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:33:14,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:14,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:14,997 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 4101629, now seen corresponding path program 1 times [2019-09-08 06:33:15,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:15,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:15,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:15,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:33:15,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:33:15,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:33:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:33:15,364 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 5 states. [2019-09-08 06:33:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:16,135 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2019-09-08 06:33:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:33:16,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 06:33:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:16,165 INFO L225 Difference]: With dead ends: 379 [2019-09-08 06:33:16,165 INFO L226 Difference]: Without dead ends: 252 [2019-09-08 06:33:16,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:33:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-08 06:33:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2019-09-08 06:33:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-08 06:33:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2019-09-08 06:33:16,335 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 78 [2019-09-08 06:33:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:16,336 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2019-09-08 06:33:16,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:33:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2019-09-08 06:33:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:33:16,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:16,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:16,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1430979773, now seen corresponding path program 1 times [2019-09-08 06:33:16,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:16,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:16,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:33:16,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:33:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:33:16,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:33:16,477 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand 6 states. [2019-09-08 06:33:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:17,304 INFO L93 Difference]: Finished difference Result 628 states and 843 transitions. [2019-09-08 06:33:17,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:33:17,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-08 06:33:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:17,312 INFO L225 Difference]: With dead ends: 628 [2019-09-08 06:33:17,312 INFO L226 Difference]: Without dead ends: 422 [2019-09-08 06:33:17,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:33:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-08 06:33:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2019-09-08 06:33:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-08 06:33:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 475 transitions. [2019-09-08 06:33:17,409 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 475 transitions. Word has length 78 [2019-09-08 06:33:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:17,410 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 475 transitions. [2019-09-08 06:33:17,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:33:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 475 transitions. [2019-09-08 06:33:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:33:17,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:17,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:17,425 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:17,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1477202113, now seen corresponding path program 1 times [2019-09-08 06:33:17,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:17,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:17,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:17,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:17,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:33:17,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:33:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:33:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:33:17,562 INFO L87 Difference]: Start difference. First operand 359 states and 475 transitions. Second operand 6 states. [2019-09-08 06:33:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:17,617 INFO L93 Difference]: Finished difference Result 685 states and 908 transitions. [2019-09-08 06:33:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:33:17,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-08 06:33:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:17,621 INFO L225 Difference]: With dead ends: 685 [2019-09-08 06:33:17,621 INFO L226 Difference]: Without dead ends: 369 [2019-09-08 06:33:17,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:33:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-08 06:33:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 364. [2019-09-08 06:33:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-08 06:33:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 478 transitions. [2019-09-08 06:33:17,652 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 478 transitions. Word has length 78 [2019-09-08 06:33:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:17,653 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 478 transitions. [2019-09-08 06:33:17,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:33:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 478 transitions. [2019-09-08 06:33:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:33:17,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:17,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:17,655 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1229055619, now seen corresponding path program 1 times [2019-09-08 06:33:17,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:17,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:17,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:17,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:17,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:33:17,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:33:17,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:33:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:33:17,727 INFO L87 Difference]: Start difference. First operand 364 states and 478 transitions. Second operand 4 states. [2019-09-08 06:33:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:17,948 INFO L93 Difference]: Finished difference Result 991 states and 1319 transitions. [2019-09-08 06:33:17,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:33:17,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-08 06:33:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:17,956 INFO L225 Difference]: With dead ends: 991 [2019-09-08 06:33:17,956 INFO L226 Difference]: Without dead ends: 670 [2019-09-08 06:33:17,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:33:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-08 06:33:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-09-08 06:33:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 06:33:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 834 transitions. [2019-09-08 06:33:18,016 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 834 transitions. Word has length 78 [2019-09-08 06:33:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:18,017 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 834 transitions. [2019-09-08 06:33:18,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:33:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 834 transitions. [2019-09-08 06:33:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:33:18,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:18,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:18,020 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 650743635, now seen corresponding path program 1 times [2019-09-08 06:33:18,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:18,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:18,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:18,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:18,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:33:18,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:33:18,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:33:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:33:18,140 INFO L87 Difference]: Start difference. First operand 651 states and 834 transitions. Second operand 6 states. [2019-09-08 06:33:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:18,203 INFO L93 Difference]: Finished difference Result 1280 states and 1639 transitions. [2019-09-08 06:33:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:33:18,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-08 06:33:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:18,209 INFO L225 Difference]: With dead ends: 1280 [2019-09-08 06:33:18,209 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 06:33:18,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:33:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 06:33:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 666. [2019-09-08 06:33:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 06:33:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 846 transitions. [2019-09-08 06:33:18,253 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 846 transitions. Word has length 78 [2019-09-08 06:33:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:18,253 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 846 transitions. [2019-09-08 06:33:18,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:33:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 846 transitions. [2019-09-08 06:33:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:33:18,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:18,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:18,256 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash 578357077, now seen corresponding path program 1 times [2019-09-08 06:33:18,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:18,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:18,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:18,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:18,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:33:18,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:33:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:33:18,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:33:18,322 INFO L87 Difference]: Start difference. First operand 666 states and 846 transitions. Second operand 6 states. [2019-09-08 06:33:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:19,143 INFO L93 Difference]: Finished difference Result 1359 states and 1714 transitions. [2019-09-08 06:33:19,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:33:19,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-08 06:33:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:19,149 INFO L225 Difference]: With dead ends: 1359 [2019-09-08 06:33:19,149 INFO L226 Difference]: Without dead ends: 831 [2019-09-08 06:33:19,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:33:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-08 06:33:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 682. [2019-09-08 06:33:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-08 06:33:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 855 transitions. [2019-09-08 06:33:19,197 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 855 transitions. Word has length 78 [2019-09-08 06:33:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:19,198 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 855 transitions. [2019-09-08 06:33:19,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:33:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 855 transitions. [2019-09-08 06:33:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 06:33:19,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:19,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:19,200 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash 68883987, now seen corresponding path program 1 times [2019-09-08 06:33:19,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:19,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:19,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:19,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:19,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:33:19,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:33:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:33:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:33:19,242 INFO L87 Difference]: Start difference. First operand 682 states and 855 transitions. Second operand 3 states. [2019-09-08 06:33:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:19,314 INFO L93 Difference]: Finished difference Result 1887 states and 2417 transitions. [2019-09-08 06:33:19,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:33:19,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 06:33:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:19,323 INFO L225 Difference]: With dead ends: 1887 [2019-09-08 06:33:19,323 INFO L226 Difference]: Without dead ends: 1276 [2019-09-08 06:33:19,326 INFO L628 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-09-08 06:33:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-09-08 06:33:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1272. [2019-09-08 06:33:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-08 06:33:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1606 transitions. [2019-09-08 06:33:19,405 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1606 transitions. Word has length 78 [2019-09-08 06:33:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:19,406 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1606 transitions. [2019-09-08 06:33:19,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:33:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1606 transitions. [2019-09-08 06:33:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 06:33:19,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:19,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:19,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash 173246819, now seen corresponding path program 1 times [2019-09-08 06:33:19,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:19,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:19,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:19,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:33:19,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:33:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:33:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:33:19,507 INFO L87 Difference]: Start difference. First operand 1272 states and 1606 transitions. Second operand 5 states. [2019-09-08 06:33:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:19,700 INFO L93 Difference]: Finished difference Result 3564 states and 4733 transitions. [2019-09-08 06:33:19,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:33:19,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-08 06:33:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:19,715 INFO L225 Difference]: With dead ends: 3564 [2019-09-08 06:33:19,715 INFO L226 Difference]: Without dead ends: 2309 [2019-09-08 06:33:19,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:33:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-09-08 06:33:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2216. [2019-09-08 06:33:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2019-09-08 06:33:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2839 transitions. [2019-09-08 06:33:19,888 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2839 transitions. Word has length 79 [2019-09-08 06:33:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:19,889 INFO L475 AbstractCegarLoop]: Abstraction has 2216 states and 2839 transitions. [2019-09-08 06:33:19,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:33:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2839 transitions. [2019-09-08 06:33:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 06:33:19,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:19,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:19,894 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -62333690, now seen corresponding path program 1 times [2019-09-08 06:33:19,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:19,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:19,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:19,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:19,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:33:19,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:33:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:33:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:33:19,953 INFO L87 Difference]: Start difference. First operand 2216 states and 2839 transitions. Second operand 4 states. [2019-09-08 06:33:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:20,164 INFO L93 Difference]: Finished difference Result 4264 states and 5463 transitions. [2019-09-08 06:33:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:33:20,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-08 06:33:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:20,182 INFO L225 Difference]: With dead ends: 4264 [2019-09-08 06:33:20,182 INFO L226 Difference]: Without dead ends: 2104 [2019-09-08 06:33:20,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:33:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2019-09-08 06:33:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2104. [2019-09-08 06:33:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2104 states. [2019-09-08 06:33:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 2690 transitions. [2019-09-08 06:33:20,366 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 2690 transitions. Word has length 87 [2019-09-08 06:33:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:20,366 INFO L475 AbstractCegarLoop]: Abstraction has 2104 states and 2690 transitions. [2019-09-08 06:33:20,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:33:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2690 transitions. [2019-09-08 06:33:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 06:33:20,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:20,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:20,369 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:20,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1970791480, now seen corresponding path program 1 times [2019-09-08 06:33:20,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:20,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:20,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:20,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:20,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:20,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:33:20,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:33:20,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:33:20,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:33:20,432 INFO L87 Difference]: Start difference. First operand 2104 states and 2690 transitions. Second operand 5 states. [2019-09-08 06:33:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:21,316 INFO L93 Difference]: Finished difference Result 6708 states and 9312 transitions. [2019-09-08 06:33:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:33:21,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 06:33:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:21,348 INFO L225 Difference]: With dead ends: 6708 [2019-09-08 06:33:21,349 INFO L226 Difference]: Without dead ends: 4659 [2019-09-08 06:33:21,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:33:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2019-09-08 06:33:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 4574. [2019-09-08 06:33:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2019-09-08 06:33:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6130 transitions. [2019-09-08 06:33:21,748 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6130 transitions. Word has length 87 [2019-09-08 06:33:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:21,749 INFO L475 AbstractCegarLoop]: Abstraction has 4574 states and 6130 transitions. [2019-09-08 06:33:21,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:33:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6130 transitions. [2019-09-08 06:33:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 06:33:21,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:21,751 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:21,751 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1829324777, now seen corresponding path program 1 times [2019-09-08 06:33:21,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:21,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:21,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:21,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:21,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:21,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:33:21,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:33:21,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:33:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:33:21,806 INFO L87 Difference]: Start difference. First operand 4574 states and 6130 transitions. Second operand 4 states. [2019-09-08 06:33:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:22,324 INFO L93 Difference]: Finished difference Result 6044 states and 8116 transitions. [2019-09-08 06:33:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:33:22,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 06:33:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:22,455 INFO L225 Difference]: With dead ends: 6044 [2019-09-08 06:33:22,456 INFO L226 Difference]: Without dead ends: 6041 [2019-09-08 06:33:22,462 INFO L628 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-09-08 06:33:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2019-09-08 06:33:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 5872. [2019-09-08 06:33:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2019-09-08 06:33:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 7872 transitions. [2019-09-08 06:33:22,872 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 7872 transitions. Word has length 88 [2019-09-08 06:33:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:22,873 INFO L475 AbstractCegarLoop]: Abstraction has 5872 states and 7872 transitions. [2019-09-08 06:33:22,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:33:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 7872 transitions. [2019-09-08 06:33:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 06:33:22,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:22,875 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:22,876 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash -874813360, now seen corresponding path program 1 times [2019-09-08 06:33:22,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:22,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:22,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:22,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:23,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:23,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:33:23,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:23,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 06:33:23,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:23,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:33:23,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-08 06:33:23,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 06:33:23,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 06:33:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:33:23,338 INFO L87 Difference]: Start difference. First operand 5872 states and 7872 transitions. Second operand 11 states. [2019-09-08 06:33:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:27,617 INFO L93 Difference]: Finished difference Result 15758 states and 23867 transitions. [2019-09-08 06:33:27,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:33:27,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-08 06:33:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:27,746 INFO L225 Difference]: With dead ends: 15758 [2019-09-08 06:33:27,746 INFO L226 Difference]: Without dead ends: 15755 [2019-09-08 06:33:27,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:33:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15755 states. [2019-09-08 06:33:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15755 to 15192. [2019-09-08 06:33:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15192 states. [2019-09-08 06:33:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15192 states to 15192 states and 22734 transitions. [2019-09-08 06:33:29,364 INFO L78 Accepts]: Start accepts. Automaton has 15192 states and 22734 transitions. Word has length 89 [2019-09-08 06:33:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:29,365 INFO L475 AbstractCegarLoop]: Abstraction has 15192 states and 22734 transitions. [2019-09-08 06:33:29,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 06:33:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15192 states and 22734 transitions. [2019-09-08 06:33:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 06:33:29,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:29,368 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:29,369 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1062268553, now seen corresponding path program 2 times [2019-09-08 06:33:29,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:29,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:29,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:29,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:33:29,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:29,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:33:29,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:33:29,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:33:29,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:33:29,426 INFO L87 Difference]: Start difference. First operand 15192 states and 22734 transitions. Second operand 3 states. [2019-09-08 06:33:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:30,127 INFO L93 Difference]: Finished difference Result 24841 states and 38821 transitions. [2019-09-08 06:33:30,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:33:30,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-08 06:33:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:30,188 INFO L225 Difference]: With dead ends: 24841 [2019-09-08 06:33:30,189 INFO L226 Difference]: Without dead ends: 10372 [2019-09-08 06:33:31,039 INFO L628 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-09-08 06:33:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10372 states. [2019-09-08 06:33:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10372 to 10116. [2019-09-08 06:33:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10116 states. [2019-09-08 06:33:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 14383 transitions. [2019-09-08 06:33:31,818 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 14383 transitions. Word has length 92 [2019-09-08 06:33:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:31,819 INFO L475 AbstractCegarLoop]: Abstraction has 10116 states and 14383 transitions. [2019-09-08 06:33:31,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:33:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 14383 transitions. [2019-09-08 06:33:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 06:33:31,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:31,822 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:31,822 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash -851936585, now seen corresponding path program 1 times [2019-09-08 06:33:31,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:31,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:31,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:31,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:33:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:33:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:33:31,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 06:33:31,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:33:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:33:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:33:31,920 INFO L87 Difference]: Start difference. First operand 10116 states and 14383 transitions. Second operand 7 states. [2019-09-08 06:33:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:34,737 INFO L93 Difference]: Finished difference Result 35655 states and 58048 transitions. [2019-09-08 06:33:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 06:33:34,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-09-08 06:33:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:34,865 INFO L225 Difference]: With dead ends: 35655 [2019-09-08 06:33:34,865 INFO L226 Difference]: Without dead ends: 19845 [2019-09-08 06:33:34,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:33:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19845 states. [2019-09-08 06:33:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19845 to 18429. [2019-09-08 06:33:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18429 states. [2019-09-08 06:33:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18429 states to 18429 states and 25148 transitions. [2019-09-08 06:33:36,690 INFO L78 Accepts]: Start accepts. Automaton has 18429 states and 25148 transitions. Word has length 100 [2019-09-08 06:33:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:36,691 INFO L475 AbstractCegarLoop]: Abstraction has 18429 states and 25148 transitions. [2019-09-08 06:33:36,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:33:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18429 states and 25148 transitions. [2019-09-08 06:33:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 06:33:36,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:36,696 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:36,696 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1692518472, now seen corresponding path program 1 times [2019-09-08 06:33:36,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:36,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:36,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 06:33:36,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:36,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:33:36,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:36,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:33:36,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 06:33:36,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:33:36,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 06:33:36,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:33:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:33:36,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:33:36,967 INFO L87 Difference]: Start difference. First operand 18429 states and 25148 transitions. Second operand 9 states. [2019-09-08 06:33:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:39,437 INFO L93 Difference]: Finished difference Result 32556 states and 45174 transitions. [2019-09-08 06:33:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 06:33:39,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-08 06:33:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:39,513 INFO L225 Difference]: With dead ends: 32556 [2019-09-08 06:33:39,513 INFO L226 Difference]: Without dead ends: 15096 [2019-09-08 06:33:39,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-09-08 06:33:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15096 states. [2019-09-08 06:33:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15096 to 14338. [2019-09-08 06:33:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14338 states. [2019-09-08 06:33:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14338 states to 14338 states and 17118 transitions. [2019-09-08 06:33:40,449 INFO L78 Accepts]: Start accepts. Automaton has 14338 states and 17118 transitions. Word has length 110 [2019-09-08 06:33:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:40,450 INFO L475 AbstractCegarLoop]: Abstraction has 14338 states and 17118 transitions. [2019-09-08 06:33:40,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:33:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 14338 states and 17118 transitions. [2019-09-08 06:33:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 06:33:40,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:40,466 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:40,466 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash -390595365, now seen corresponding path program 1 times [2019-09-08 06:33:40,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:40,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:40,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-08 06:33:40,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:40,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:33:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:33:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:40,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:33:40,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 06:33:40,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:33:40,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 06:33:40,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:33:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:33:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:33:40,971 INFO L87 Difference]: Start difference. First operand 14338 states and 17118 transitions. Second operand 8 states. [2019-09-08 06:33:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:42,500 INFO L93 Difference]: Finished difference Result 31805 states and 38553 transitions. [2019-09-08 06:33:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:33:42,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-09-08 06:33:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:42,605 INFO L225 Difference]: With dead ends: 31805 [2019-09-08 06:33:42,606 INFO L226 Difference]: Without dead ends: 17865 [2019-09-08 06:33:42,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:33:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17865 states. [2019-09-08 06:33:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17865 to 17655. [2019-09-08 06:33:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17655 states. [2019-09-08 06:33:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17655 states to 17655 states and 21178 transitions. [2019-09-08 06:33:43,965 INFO L78 Accepts]: Start accepts. Automaton has 17655 states and 21178 transitions. Word has length 174 [2019-09-08 06:33:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:43,965 INFO L475 AbstractCegarLoop]: Abstraction has 17655 states and 21178 transitions. [2019-09-08 06:33:43,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:33:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17655 states and 21178 transitions. [2019-09-08 06:33:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:33:43,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:43,974 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:43,974 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:43,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1329668345, now seen corresponding path program 1 times [2019-09-08 06:33:43,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:43,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:43,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:43,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:43,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:33:44,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:44,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:33:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:44,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 06:33:44,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 06:33:44,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:33:44,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-08 06:33:44,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 06:33:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 06:33:44,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:33:44,343 INFO L87 Difference]: Start difference. First operand 17655 states and 21178 transitions. Second operand 11 states. [2019-09-08 06:33:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:46,695 INFO L93 Difference]: Finished difference Result 53069 states and 65336 transitions. [2019-09-08 06:33:46,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 06:33:46,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 189 [2019-09-08 06:33:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:46,823 INFO L225 Difference]: With dead ends: 53069 [2019-09-08 06:33:46,823 INFO L226 Difference]: Without dead ends: 30556 [2019-09-08 06:33:46,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:33:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30556 states. [2019-09-08 06:33:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30556 to 25958. [2019-09-08 06:33:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25958 states. [2019-09-08 06:33:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25958 states to 25958 states and 30391 transitions. [2019-09-08 06:33:49,192 INFO L78 Accepts]: Start accepts. Automaton has 25958 states and 30391 transitions. Word has length 189 [2019-09-08 06:33:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:49,193 INFO L475 AbstractCegarLoop]: Abstraction has 25958 states and 30391 transitions. [2019-09-08 06:33:49,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 06:33:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 25958 states and 30391 transitions. [2019-09-08 06:33:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 06:33:49,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:49,210 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:33:49,210 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1633973973, now seen corresponding path program 1 times [2019-09-08 06:33:49,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:49,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:49,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:49,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-08 06:33:49,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:49,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:33:49,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:33:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:49,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:33:49,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:33:49,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:33:49,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 06:33:49,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:33:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:33:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:33:49,571 INFO L87 Difference]: Start difference. First operand 25958 states and 30391 transitions. Second operand 9 states. [2019-09-08 06:33:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:50,256 INFO L93 Difference]: Finished difference Result 35458 states and 42245 transitions. [2019-09-08 06:33:50,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:33:50,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 273 [2019-09-08 06:33:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:50,309 INFO L225 Difference]: With dead ends: 35458 [2019-09-08 06:33:50,309 INFO L226 Difference]: Without dead ends: 9549 [2019-09-08 06:33:50,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:33:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2019-09-08 06:33:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 7057. [2019-09-08 06:33:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2019-09-08 06:33:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 8031 transitions. [2019-09-08 06:33:50,794 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 8031 transitions. Word has length 273 [2019-09-08 06:33:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:50,795 INFO L475 AbstractCegarLoop]: Abstraction has 7057 states and 8031 transitions. [2019-09-08 06:33:50,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:33:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 8031 transitions. [2019-09-08 06:33:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 06:33:50,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:50,807 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:50,807 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1850788876, now seen corresponding path program 1 times [2019-09-08 06:33:50,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:50,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:50,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-09-08 06:33:50,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:50,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:33:50,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:33:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:51,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:33:51,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 277 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 06:33:51,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:33:51,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-08 06:33:51,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:33:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:33:51,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:33:51,209 INFO L87 Difference]: Start difference. First operand 7057 states and 8031 transitions. Second operand 8 states. [2019-09-08 06:33:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:52,148 INFO L93 Difference]: Finished difference Result 10866 states and 12477 transitions. [2019-09-08 06:33:52,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 06:33:52,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 293 [2019-09-08 06:33:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:52,161 INFO L225 Difference]: With dead ends: 10866 [2019-09-08 06:33:52,162 INFO L226 Difference]: Without dead ends: 4167 [2019-09-08 06:33:52,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:33:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2019-09-08 06:33:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4001. [2019-09-08 06:33:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4001 states. [2019-09-08 06:33:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 4553 transitions. [2019-09-08 06:33:52,446 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 4553 transitions. Word has length 293 [2019-09-08 06:33:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:52,447 INFO L475 AbstractCegarLoop]: Abstraction has 4001 states and 4553 transitions. [2019-09-08 06:33:52,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:33:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 4553 transitions. [2019-09-08 06:33:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 06:33:52,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:33:52,452 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:33:52,452 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:33:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:33:52,453 INFO L82 PathProgramCache]: Analyzing trace with hash -173980200, now seen corresponding path program 1 times [2019-09-08 06:33:52,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:33:52,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:33:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:33:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:33:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-09-08 06:33:52,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:33:52,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:33:52,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:33:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:33:52,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 06:33:52,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:33:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:33:52,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:33:52,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-08 06:33:52,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:33:52,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:33:52,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:33:52,840 INFO L87 Difference]: Start difference. First operand 4001 states and 4553 transitions. Second operand 6 states. [2019-09-08 06:33:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:33:53,459 INFO L93 Difference]: Finished difference Result 4633 states and 5251 transitions. [2019-09-08 06:33:53,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:33:53,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 294 [2019-09-08 06:33:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:33:53,461 INFO L225 Difference]: With dead ends: 4633 [2019-09-08 06:33:53,461 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 06:33:53,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:33:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 06:33:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 06:33:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 06:33:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 06:33:53,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2019-09-08 06:33:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:33:53,473 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 06:33:53,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:33:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 06:33:53,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 06:33:53,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 06:33:54,665 WARN L188 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 388 DAG size of output: 209 [2019-09-08 06:33:57,854 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-09-08 06:33:58,595 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 219 [2019-09-08 06:34:00,891 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 361 DAG size of output: 189 [2019-09-08 06:34:01,187 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 186 [2019-09-08 06:34:02,581 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 196 [2019-09-08 06:34:05,190 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 214 [2019-09-08 06:34:06,732 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 391 DAG size of output: 214 [2019-09-08 06:34:08,467 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 86 [2019-09-08 06:34:10,276 WARN L188 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 213 DAG size of output: 101 [2019-09-08 06:34:10,381 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 06:34:12,521 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 234 DAG size of output: 98 [2019-09-08 06:34:19,856 WARN L188 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 427 DAG size of output: 158 [2019-09-08 06:34:26,538 WARN L188 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 386 DAG size of output: 111 [2019-09-08 06:34:27,197 WARN L188 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 397 DAG size of output: 1 [2019-09-08 06:34:27,437 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 06:34:30,518 WARN L188 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 291 DAG size of output: 124 [2019-09-08 06:34:34,424 WARN L188 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 468 DAG size of output: 94 [2019-09-08 06:34:34,891 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-08 06:34:36,812 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 225 DAG size of output: 106 [2019-09-08 06:34:37,224 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 397 DAG size of output: 1 [2019-09-08 06:34:37,641 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 397 DAG size of output: 1 [2019-09-08 06:34:40,757 WARN L188 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 380 DAG size of output: 98 [2019-09-08 06:34:43,294 WARN L188 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 380 DAG size of output: 85 [2019-09-08 06:34:43,557 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 1 [2019-09-08 06:34:46,022 WARN L188 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 248 DAG size of output: 101 [2019-09-08 06:34:47,426 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 256 DAG size of output: 82 [2019-09-08 06:34:47,649 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-08 06:34:49,196 WARN L188 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 258 DAG size of output: 92 [2019-09-08 06:34:50,739 WARN L188 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 198 DAG size of output: 98 [2019-09-08 06:34:52,198 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 195 DAG size of output: 96 [2019-09-08 06:34:52,313 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-08 06:34:55,491 WARN L188 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 380 DAG size of output: 98 [2019-09-08 06:35:02,221 WARN L188 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 384 DAG size of output: 149 [2019-09-08 06:35:03,965 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 204 DAG size of output: 101 [2019-09-08 06:35:06,817 WARN L188 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 500 DAG size of output: 81 [2019-09-08 06:35:09,673 WARN L188 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 436 DAG size of output: 98 [2019-09-08 06:35:16,960 WARN L188 SmtUtils]: Spent 7.27 s on a formula simplification. DAG size of input: 427 DAG size of output: 158 [2019-09-08 06:35:17,411 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 497 DAG size of output: 1 [2019-09-08 06:35:19,288 WARN L188 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 216 DAG size of output: 104 [2019-09-08 06:35:19,403 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-08 06:35:20,138 WARN L188 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 471 DAG size of output: 1 [2019-09-08 06:35:23,767 WARN L188 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 312 DAG size of output: 94 [2019-09-08 06:35:28,305 WARN L188 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 421 DAG size of output: 143 [2019-09-08 06:35:28,417 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-08 06:35:32,823 WARN L188 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 391 DAG size of output: 87 [2019-09-08 06:35:33,819 WARN L188 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 90 [2019-09-08 06:35:35,697 WARN L188 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 216 DAG size of output: 104 [2019-09-08 06:35:39,672 WARN L188 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 303 DAG size of output: 138 [2019-09-08 06:35:41,150 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 219 DAG size of output: 87 [2019-09-08 06:35:42,146 WARN L188 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 94 [2019-09-08 06:35:45,064 WARN L188 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 407 DAG size of output: 94 [2019-09-08 06:35:45,497 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-08 06:35:46,565 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 145 DAG size of output: 91 [2019-09-08 06:35:46,759 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 06:35:46,762 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-09-08 06:35:46,763 INFO L443 ceAbstractionStarter]: For program point L311(line 311) no Hoare annotation was computed. [2019-09-08 06:35:46,763 INFO L443 ceAbstractionStarter]: For program point L313-2(lines 297 321) no Hoare annotation was computed. [2019-09-08 06:35:46,763 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-09-08 06:35:46,764 INFO L439 ceAbstractionStarter]: At program point L303(line 303) the Hoare annotation is: (let ((.cse28 (= 0 ~p_dw_st~0)) (.cse19 (= ~c_dr_st~0 2)) (.cse26 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse0 (= 2 ~p_dw_st~0)) (.cse31 (not (= ~c_dr_st~0 0)))) (let ((.cse20 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse24 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse15 (and .cse0 .cse31)) (.cse1 (not (<= .cse32 ~p_num_write~0))) (.cse5 (not .cse26)) (.cse8 (not (<= ~p_num_write~0 .cse32))) (.cse27 (and .cse0 .cse19)) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse18 (not (<= ~q_req_up~0 0))) (.cse21 (not (<= 1 ~q_free~0))) (.cse14 (and .cse28 .cse31)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse13 (not (= |old(~p_dw_st~0)| 0))) (.cse23 (not (<= ~q_free~0 1))) (.cse29 (not (= 0 ~p_num_write~0))) (.cse25 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~q_read_ev~0 2))) (.cse10 (not (= |old(~p_dw_st~0)| 2))) (.cse30 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (= 1 ~q_req_up~0)) (.cse16 (not (= 1 ~p_num_write~0))) (.cse9 (= ~p_dw_pc~0 1)) (.cse17 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse12 .cse13 .cse9 .cse14) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse15 .cse10) (or .cse2 .cse3 .cse4 .cse6 .cse0 .cse12 .cse16 .cse9 .cse10 .cse17 .cse18) (or .cse4 .cse3 .cse5 .cse10 .cse19 .cse20 .cse2 .cse21 .cse22 .cse7 .cse9 .cse23 .cse24 .cse25) (or .cse26 .cse3 .cse4 .cse6 .cse22 .cse19) (or .cse4 .cse3 .cse15 .cse5 .cse10 .cse20 .cse2 .cse21 .cse7 .cse11 .cse9 .cse23 .cse24 .cse25) (or .cse4 .cse3 .cse5 .cse12 .cse10 .cse15 .cse20 .cse2 .cse21 .cse7 .cse11 .cse23 .cse24 .cse25) (or (or .cse2 .cse20 .cse3 .cse4 .cse21 .cse5 .cse22 .cse10 .cse23 .cse24 .cse25 .cse18) .cse27) (or .cse4 .cse3 .cse5 .cse12 .cse19 .cse10 .cse20 .cse2 .cse21 .cse22 .cse7 .cse23 .cse24 .cse25) (or .cse2 .cse3 .cse4 .cse6 .cse22 .cse7 .cse9 .cse10 .cse19) (or .cse19 .cse2 .cse3 .cse4 .cse6 .cse22 .cse7 .cse12 .cse13 .cse9) (or .cse2 .cse3 .cse4 .cse6 .cse22 .cse7 .cse12 .cse19 .cse10) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse9 .cse10 .cse15) (or .cse28 .cse26 .cse3 .cse4 .cse6 .cse11 .cse13) (or .cse1 .cse4 .cse3 .cse5 .cse8 .cse12 (not .cse9) .cse10 (= 0 ~q_write_ev~0) .cse18 .cse27 .cse6 .cse22) (or .cse26 .cse3 .cse4 .cse21 .cse22 .cse13 .cse19 .cse9 .cse17 .cse23 .cse29 .cse25) (or .cse4 .cse3 .cse12 .cse29 .cse30 .cse18 .cse26 .cse21 .cse28 .cse13 .cse9 .cse17 .cse23 .cse25) (or .cse26 .cse3 .cse4 .cse6 .cse11 .cse31) (or .cse26 .cse3 .cse4 .cse21 .cse14 .cse11 .cse13 .cse9 .cse17 .cse23 .cse29 .cse25) (or .cse4 .cse3 .cse12 .cse10 .cse30 .cse6 .cse7 .cse0 .cse16 .cse9 .cse17)))) [2019-09-08 06:35:46,765 INFO L439 ceAbstractionStarter]: At program point L305-2(lines 305 309) the Hoare annotation is: (let ((.cse29 (= 1 ~c_dr_pc~0))) (let ((.cse35 (+ ~c_num_read~0 1)) (.cse31 (= 0 activate_threads_~tmp~1)) (.cse32 (not (= ~c_dr_st~0 0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse22 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse23 (not (<= 1 ~q_free~0))) (.cse5 (not .cse29)) (.cse20 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= |old(~p_dw_st~0)| 2))) (.cse24 (not (<= ~q_free~0 1))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse26 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (<= ~q_req_up~0 0))) (.cse0 (= 2 ~p_dw_st~0)) (.cse14 (= ~c_dr_st~0 2))) (let ((.cse12 (and .cse0 .cse14)) (.cse11 (or .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse20 .cse10 .cse24 .cse25 .cse26 .cse19)) (.cse27 (and .cse0 .cse32)) (.cse33 (and .cse31 .cse0 .cse32)) (.cse17 (and .cse31 .cse0)) (.cse16 (not (= 1 ~p_num_write~0))) (.cse34 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse13 (= 0 ~p_dw_st~0)) (.cse28 (= 0 |old(~c_dr_st~0)|)) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse18 (not (= 0 ~c_num_read~0))) (.cse30 (not (= 0 ~p_num_write~0))) (.cse1 (not (<= .cse35 ~p_num_write~0))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (= 1 ~q_req_up~0)) (.cse8 (not (<= ~p_num_write~0 .cse35))) (.cse15 (not (= ~q_read_ev~0 2))) (.cse9 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 (and .cse13 .cse14)) (or .cse2 .cse3 .cse4 .cse6 .cse15 .cse16 .cse17 .cse9 .cse10 .cse18 .cse19) (or .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse15 .cse21 .cse14 .cse9) (or .cse4 .cse3 .cse5 .cse10 .cse14 .cse22 .cse2 .cse23 .cse20 .cse7 .cse9 .cse24 .cse25 .cse26) (or .cse4 .cse3 .cse5 .cse15 .cse10 .cse22 .cse2 .cse23 .cse20 .cse7 .cse14 .cse24 .cse25 .cse26) (or .cse4 .cse3 .cse27 .cse5 .cse10 .cse22 .cse2 .cse23 .cse7 .cse28 .cse9 .cse24 .cse25 .cse26) (or .cse29 .cse3 .cse4 .cse6 .cse20 .cse14) (or .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse10 .cse14) (or .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse15 .cse14 .cse10) (or .cse12 (= ~q_read_ev~0 1) .cse11) (or .cse29 .cse3 .cse4 .cse23 .cse20 .cse21 .cse14 .cse9 .cse18 .cse24 .cse30 .cse26) (or .cse1 (and .cse31 .cse0 .cse14) .cse4 .cse3 .cse5 .cse8 .cse15 (not .cse9) .cse10 (= 0 ~q_write_ev~0) .cse19 .cse6 .cse20) (or .cse2 .cse3 .cse4 .cse6 .cse7 .cse28 .cse15 .cse21 .cse9 (and .cse31 .cse13 .cse32)) (or .cse31 .cse29 .cse3 .cse4 .cse6 .cse28 .cse15) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse15 .cse33 .cse10) (or .cse3 .cse4 .cse15 .cse31 .cse30 .cse29 .cse23 .cse28 .cse21 .cse9 .cse18 .cse24 .cse26) (or .cse29 .cse3 .cse4 .cse6 .cse13 .cse28 .cse21) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse10 .cse27) (or .cse4 .cse3 .cse5 .cse33 .cse15 .cse10 .cse22 .cse2 .cse23 .cse7 .cse28 .cse24 .cse25 .cse26) (or .cse4 .cse3 .cse15 .cse10 .cse17 .cse34 .cse6 .cse7 .cse16 .cse9 .cse18) (or .cse4 .cse3 .cse15 .cse30 .cse34 .cse19 .cse29 .cse23 (and .cse31 .cse13) .cse21 .cse9 .cse18 .cse24 .cse26) (or .cse29 .cse3 .cse4 .cse6 .cse28 .cse32) (or .cse29 .cse3 .cse4 .cse23 (and .cse13 .cse32) .cse28 .cse21 .cse9 .cse18 .cse24 .cse30 .cse26) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse31 .cse15 .cse9 .cse10))))) [2019-09-08 06:35:46,766 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 297 321) the Hoare annotation is: (let ((.cse28 (= 0 ~p_dw_st~0)) (.cse19 (= ~c_dr_st~0 2)) (.cse26 (= 1 ~c_dr_pc~0)) (.cse32 (+ ~c_num_read~0 1)) (.cse0 (= 2 ~p_dw_st~0)) (.cse31 (not (= ~c_dr_st~0 0)))) (let ((.cse20 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse24 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse15 (and .cse0 .cse31)) (.cse1 (not (<= .cse32 ~p_num_write~0))) (.cse5 (not .cse26)) (.cse8 (not (<= ~p_num_write~0 .cse32))) (.cse27 (and .cse0 .cse19)) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse18 (not (<= ~q_req_up~0 0))) (.cse21 (not (<= 1 ~q_free~0))) (.cse14 (and .cse28 .cse31)) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse13 (not (= |old(~p_dw_st~0)| 0))) (.cse23 (not (<= ~q_free~0 1))) (.cse29 (not (= 0 ~p_num_write~0))) (.cse25 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse12 (not (= ~q_read_ev~0 2))) (.cse10 (not (= |old(~p_dw_st~0)| 2))) (.cse30 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (= 1 ~q_req_up~0)) (.cse16 (not (= 1 ~p_num_write~0))) (.cse9 (= ~p_dw_pc~0 1)) (.cse17 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse12 .cse13 .cse9 .cse14) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse15 .cse10) (or .cse2 .cse3 .cse4 .cse6 .cse0 .cse12 .cse16 .cse9 .cse10 .cse17 .cse18) (or .cse4 .cse3 .cse5 .cse10 .cse19 .cse20 .cse2 .cse21 .cse22 .cse7 .cse9 .cse23 .cse24 .cse25) (or .cse26 .cse3 .cse4 .cse6 .cse22 .cse19) (or .cse4 .cse3 .cse15 .cse5 .cse10 .cse20 .cse2 .cse21 .cse7 .cse11 .cse9 .cse23 .cse24 .cse25) (or .cse4 .cse3 .cse5 .cse12 .cse10 .cse15 .cse20 .cse2 .cse21 .cse7 .cse11 .cse23 .cse24 .cse25) (or (or .cse2 .cse20 .cse3 .cse4 .cse21 .cse5 .cse22 .cse10 .cse23 .cse24 .cse25 .cse18) .cse27) (or .cse4 .cse3 .cse5 .cse12 .cse19 .cse10 .cse20 .cse2 .cse21 .cse22 .cse7 .cse23 .cse24 .cse25) (or .cse2 .cse3 .cse4 .cse6 .cse22 .cse7 .cse9 .cse10 .cse19) (or .cse19 .cse2 .cse3 .cse4 .cse6 .cse22 .cse7 .cse12 .cse13 .cse9) (or .cse2 .cse3 .cse4 .cse6 .cse22 .cse7 .cse12 .cse19 .cse10) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse9 .cse10 .cse15) (or .cse28 .cse26 .cse3 .cse4 .cse6 .cse11 .cse13) (or .cse1 .cse4 .cse3 .cse5 .cse8 .cse12 (not .cse9) .cse10 (= 0 ~q_write_ev~0) .cse18 .cse27 .cse6 .cse22) (or .cse26 .cse3 .cse4 .cse21 .cse22 .cse13 .cse19 .cse9 .cse17 .cse23 .cse29 .cse25) (or .cse4 .cse3 .cse12 .cse29 .cse30 .cse18 .cse26 .cse21 .cse28 .cse13 .cse9 .cse17 .cse23 .cse25) (or .cse26 .cse3 .cse4 .cse6 .cse11 .cse31) (or .cse26 .cse3 .cse4 .cse21 .cse14 .cse11 .cse13 .cse9 .cse17 .cse23 .cse29 .cse25) (or .cse4 .cse3 .cse12 .cse10 .cse30 .cse6 .cse7 .cse0 .cse16 .cse9 .cse17)))) [2019-09-08 06:35:46,766 INFO L443 ceAbstractionStarter]: For program point L303-1(line 303) no Hoare annotation was computed. [2019-09-08 06:35:46,766 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 297 321) no Hoare annotation was computed. [2019-09-08 06:35:46,766 INFO L439 ceAbstractionStarter]: At program point L257(lines 244 259) the Hoare annotation is: (let ((.cse1 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_dw_pc~0 1)) (.cse20 (<= ~q_req_up~0 0))) (let ((.cse14 (not (= ~c_dr_st~0 0))) (.cse15 (not (= ~p_dw_st~0 2))) (.cse10 (not (= 0 ~p_num_write~0))) (.cse16 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse18 (not .cse20)) (.cse8 (not (= 0 ~c_num_read~0))) (.cse13 (not .cse7)) (.cse23 (not .cse1)) (.cse4 (not (<= 1 ~q_free~0))) (.cse19 (not (= 2 ~c_dr_st~0))) (.cse9 (not (<= ~q_free~0 1))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (<= 2 ~q_write_ev~0))) (.cse24 (= 1 ~q_req_up~0)) (.cse12 (not (= ~q_read_ev~0 2))) (.cse0 (= exists_runnable_thread_~__retres1~2 1)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~q_free~0 0))) (.cse5 (= 0 ~c_dr_st~0)) (.cse6 (not (= ~p_dw_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse3 .cse2 .cse12 .cse13 .cse14 .cse15 .cse16 .cse1 .cse17 .cse0 (not (= 1 ~p_num_write~0)) .cse8) (or .cse3 .cse2 .cse12 .cse10 .cse16 .cse18 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11 .cse0) (or (and .cse20 .cse14) (let ((.cse21 (+ ~c_num_read~0 1))) (or (not (<= .cse21 ~p_num_write~0)) .cse22 .cse2 .cse3 .cse23 .cse17 .cse24 (not (<= ~p_num_write~0 .cse21)) .cse12 .cse13 .cse15)) .cse0) (or .cse3 .cse2 .cse12 .cse10 .cse16 .cse18 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse0) (or .cse0 (or .cse13 (or .cse3 .cse2 .cse23 .cse12 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse22 .cse4 .cse19 .cse24 .cse6 .cse9 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse11))) (or .cse22 .cse2 .cse3 .cse0 .cse17 .cse24 .cse5 .cse12 .cse6 .cse7) (or .cse1 .cse0 .cse2 .cse3 .cse17 .cse5 .cse6)))) [2019-09-08 06:35:46,767 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 241 260) no Hoare annotation was computed. [2019-09-08 06:35:46,767 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 254) no Hoare annotation was computed. [2019-09-08 06:35:46,767 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 241 260) the Hoare annotation is: true [2019-09-08 06:35:46,767 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 255) no Hoare annotation was computed. [2019-09-08 06:35:46,767 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 241 260) no Hoare annotation was computed. [2019-09-08 06:35:46,768 INFO L439 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 21 40) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse11 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse23 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse19 (not (<= 1 ~q_free~0))) (.cse22 (not .cse15)) (.cse20 (not (<= ~q_free~0 1)))) (let ((.cse0 (not (<= 2 |old(~q_write_ev~0)|))) (.cse1 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse5 (or .cse19 .cse22 .cse20)) (.cse9 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse18 (and .cse23 .cse12)) (.cse17 (= 0 ~c_dr_st~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (= ~p_dw_pc~0 1)) (.cse14 (and .cse11 .cse23 .cse12)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 0))) (.cse4 (not (= 2 ~c_dr_st~0))) (.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse7 (not (= ~p_dw_st~0 2))) (.cse8 (not (= 1 |old(~q_req_up~0)|)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (and (= ~q_read_ev~0 2) .cse11) .cse12)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7 .cse8 .cse9 .cse10 .cse14) (or .cse15 .cse2 .cse3 .cse16 .cse17 .cse18) (or .cse2 .cse3 .cse18 .cse17 .cse13 (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (or .cse15 .cse19 (not (= ~p_dw_st~0 0)) .cse20) .cse10) (or (not .cse13) .cse14 (or (let ((.cse21 (+ ~c_num_read~0 1))) (or (not (<= .cse21 ~p_num_write~0)) .cse2 .cse3 .cse22 .cse16 (not (<= ~p_num_write~0 .cse21)))) .cse4 .cse6 .cse7 .cse8 (= 0 |old(~q_write_ev~0)|))))))) [2019-09-08 06:35:46,768 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2019-09-08 06:35:46,768 INFO L443 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 21 40) no Hoare annotation was computed. [2019-09-08 06:35:46,768 INFO L443 ceAbstractionStarter]: For program point L25-1(lines 24 39) no Hoare annotation was computed. [2019-09-08 06:35:46,768 INFO L443 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 21 40) no Hoare annotation was computed. [2019-09-08 06:35:46,768 INFO L443 ceAbstractionStarter]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2019-09-08 06:35:46,768 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 279 296) no Hoare annotation was computed. [2019-09-08 06:35:46,768 INFO L443 ceAbstractionStarter]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2019-09-08 06:35:46,769 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 279 296) the Hoare annotation is: (let ((.cse28 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse29 (+ ~c_num_read~0 1)) (.cse26 (= 1 ~c_dr_pc~0)) (.cse17 (not (= |old(~q_read_ev~0)| 2))) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse13 (not (= |old(~q_read_ev~0)| 1))) (.cse0 (not .cse18)) (.cse7 (not (= 2 ~c_dr_st~0))) (.cse24 (not (= 1 ~p_num_write~0))) (.cse27 (not (= 0 ~p_num_write~0))) (.cse23 (or .cse26 .cse17 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (.cse22 (not (<= ~q_req_up~0 0))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse25 (not (= 0 ~c_num_read~0))) (.cse2 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse5 (not (<= 1 ~q_free~0))) (.cse10 (not (<= ~q_free~0 1))) (.cse11 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (<= .cse29 ~p_num_write~0))) (.cse6 (not .cse26)) (.cse20 (not (<= ~p_num_write~0 .cse29))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~q_free~0 0))) (.cse8 (= 1 ~q_req_up~0)) (.cse16 (= 0 ~c_dr_st~0)) (.cse21 (not (= ~p_dw_st~0 2))) (.cse14 (and (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse28))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) .cse13 .cse14) (or .cse1 .cse3 .cse4 .cse15 .cse8 .cse16 .cse17 .cse9 .cse18 .cse14) (or .cse19 .cse4 .cse3 .cse6 .cse20 .cse17 .cse0 .cse21 .cse22 .cse15 (not (= 1 |old(~q_write_ev~0)|)) .cse14) (or .cse3 .cse4 .cse21 .cse23 .cse15 .cse8 .cse24 .cse14 .cse18 .cse25) (or .cse26 .cse3 .cse4 .cse5 .cse14 .cse16 .cse9 .cse18 .cse25 .cse10 .cse27 .cse12) (or .cse1 .cse3 .cse4 .cse15 .cse8 .cse16 .cse17 .cse14 .cse21) (or (and .cse28 (= ~q_read_ev~0 1)) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse16 .cse21 .cse10 .cse11 .cse12) .cse13) (or (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse10 .cse11 .cse12 .cse22) .cse14) (or .cse19 .cse4 .cse3 .cse20 .cse17 .cse0 .cse21 (= 0 |old(~q_write_ev~0)|) .cse22 .cse14 .cse15 .cse7) (or .cse1 .cse3 .cse4 .cse15 .cse14 .cse17 .cse24 .cse18 .cse21 .cse25 .cse22) (or .cse4 .cse3 .cse6 .cse17 .cse21 .cse14 .cse2 .cse1 .cse5 .cse8 .cse16 .cse10 .cse11 .cse12) (or .cse4 .cse3 .cse27 .cse23 .cse22 .cse5 .cse9 .cse18 .cse25 .cse10 .cse14 .cse12) (or .cse4 .cse3 .cse14 .cse6 .cse21 .cse2 .cse1 .cse5 .cse8 .cse16 .cse18 .cse10 .cse11 .cse12) (or .cse26 .cse3 .cse4 .cse15 .cse16 .cse14) (or .cse14 .cse19 .cse1 .cse3 .cse4 .cse6 .cse15 .cse8 .cse20 .cse18 .cse21) (or .cse1 .cse3 .cse4 .cse15 .cse8 .cse16 .cse18 .cse21 .cse14)))) [2019-09-08 06:35:46,769 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 223 240) no Hoare annotation was computed. [2019-09-08 06:35:46,769 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 223 240) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~q_read_ev~0 2)) (not (= 0 ~p_num_write~0)) (not (= ~q_read_ev~0 ~q_write_ev~0)) (not (<= ~q_req_up~0 0)) (= 1 ~c_dr_pc~0) (not (<= 1 ~q_free~0)) (= 0 ~p_dw_st~0) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (not (<= ~q_free~0 1)) (not (= ~c_last_read~0 ~p_last_write~0))) [2019-09-08 06:35:46,769 INFO L443 ceAbstractionStarter]: For program point L232-1(lines 223 240) no Hoare annotation was computed. [2019-09-08 06:35:46,770 INFO L443 ceAbstractionStarter]: For program point L227-1(lines 226 239) no Hoare annotation was computed. [2019-09-08 06:35:46,770 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 455 466) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (and (not (= ~c_dr_pc~0 1)) (= 0 ~p_dw_st~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_num_read~0 0) (= 0 ~q_free~0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (not (= 1 ~p_dw_i~0)) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (<= |old(~q_req_up~0)| 0))) [2019-09-08 06:35:46,770 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-09-08 06:35:46,770 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 455 466) no Hoare annotation was computed. [2019-09-08 06:35:46,770 INFO L439 ceAbstractionStarter]: At program point L460(line 460) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (and (not (= ~c_dr_pc~0 1)) (= 0 ~p_dw_st~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_num_read~0 0) (= 0 ~q_free~0) (= ~c_last_read~0 ~p_last_write~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (not (= 1 ~p_dw_i~0)) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (<= |old(~q_req_up~0)| 0))) [2019-09-08 06:35:46,771 INFO L439 ceAbstractionStarter]: At program point L460-1(line 460) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (and (= 1 ~p_dw_i~0) (not (= ~c_dr_pc~0 1)) (= ~q_read_ev~0 2) (= 0 ~p_dw_st~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (not (= 1 ~p_dw_pc~0)) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (<= |old(~q_req_up~0)| 0))) [2019-09-08 06:35:46,771 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 455 466) no Hoare annotation was computed. [2019-09-08 06:35:46,771 INFO L439 ceAbstractionStarter]: At program point do_write_pENTRY(lines 114 153) the Hoare annotation is: (let ((.cse15 (= 1 ~c_dr_pc~0))) (let ((.cse5 (not (= |old(~q_free~0)| 0))) (.cse11 (= 0 ~q_free~0)) (.cse6 (= 0 ~c_dr_st~0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse22 (not (= 0 |old(~p_num_write~0)|))) (.cse23 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse26 (not (<= |old(~q_req_up~0)| 0))) (.cse21 (= 0 ~p_num_write~0)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse1 (not (<= 2 ~q_write_ev~0))) (.cse14 (= |old(~p_dw_pc~0)| 1)) (.cse8 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse20 (<= ~q_free~0 1)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= 1 ~q_free~0)) (.cse12 (not (= 0 ~p_dw_st~0))) (.cse10 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse27 (not (= 2 ~c_dr_st~0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (not (<= 1 |old(~q_free~0)|))) (.cse4 (not .cse15)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse17 (not (<= |old(~q_free~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 1 |old(~q_req_up~0)|) .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 .cse2 .cse3 .cse5 (and .cse11 .cse8 .cse13 .cse9) .cse6) (or .cse6 (or .cse15 .cse2 .cse3 .cse16 .cse14 .cse17) .cse18 (and .cse9 .cse19 .cse20 .cse13 .cse21) .cse22) (or .cse3 .cse2 .cse7 .cse22 .cse23 .cse15 .cse16 .cse6 .cse14 .cse18 .cse17 .cse24 .cse25) (or .cse3 .cse2 .cse7 .cse22 .cse23 .cse26 .cse0 .cse15 .cse16 (and .cse9 .cse19 .cse10 .cse12 .cse20 .cse24 .cse13 .cse21) .cse14 .cse18 .cse17 .cse25) (or (or .cse2 .cse3 .cse16 .cse4 .cse17) .cse7 .cse22 .cse23 .cse26 .cse0 (and .cse9 .cse19 .cse10 .cse12 .cse20 .cse13 .cse21) .cse27 .cse18) (or .cse1 (not .cse14) (and (and .cse8 .cse20 .cse13 .cse9 .cse19) .cse12 .cse10) (or .cse0 .cse27 (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse2 .cse3 .cse16 .cse4 .cse7 .cse17) (not (<= |old(~p_num_write~0)| ~c_num_read~0)))))))) [2019-09-08 06:35:46,771 INFO L439 ceAbstractionStarter]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse8 (= 1 ~c_dr_pc~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse22 (not (= 0 ~p_dw_st~0))) (.cse12 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse14 (= 0 ~p_num_write~0))) (let ((.cse4 (not (= |old(~q_free~0)| 0))) (.cse5 (= 0 ~c_dr_st~0)) (.cse18 (and .cse13 .cse23 .cse22 .cse12 .cse14)) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse20 (not (<= |old(~q_req_up~0)| 0))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse1 (not (<= 2 ~q_write_ev~0))) (.cse7 (= |old(~p_dw_pc~0)| 1)) (.cse16 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse21 (not (= 2 ~c_dr_st~0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse9 (not (<= 1 |old(~q_free~0)|))) (.cse17 (not .cse8)) (.cse6 (not (= ~q_read_ev~0 2))) (.cse10 (not (<= |old(~q_free~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 1 |old(~q_req_up~0)|) .cse5 .cse6 .cse7) (or .cse5 (or .cse8 .cse2 .cse3 .cse9 .cse7 .cse10) .cse11 (and .cse12 .cse13 .cse14) .cse15) (or .cse8 .cse2 .cse3 .cse4 (and (= 0 ~q_free~0) .cse16 .cse7 .cse12 .cse13) .cse5) (or (or .cse2 .cse3 .cse9 .cse17 .cse10) .cse6 .cse18 .cse15 .cse19 .cse20 .cse0 .cse21 .cse11) (or .cse3 .cse2 .cse18 .cse6 .cse15 .cse19 .cse20 .cse0 .cse8 .cse9 .cse7 .cse11 .cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse1 (not .cse7) (and (and .cse16 (and .cse12 .cse13)) .cse22 .cse23) (or .cse0 .cse21 (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse2 .cse3 .cse9 .cse17 .cse6 .cse10) (not (<= |old(~p_num_write~0)| ~c_num_read~0)))))))) [2019-09-08 06:35:46,772 INFO L439 ceAbstractionStarter]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse9 (= |old(~p_dw_pc~0)| 1)) (.cse31 (+ |old(~p_num_write~0)| 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 0 ~q_free~0)) (.cse18 (not (= 0 ~p_dw_st~0))) (.cse28 (= 1 ~p_num_write~0)) (.cse6 (= |old(~p_dw_pc~0)| ~p_dw_pc~0))) (let ((.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse13 (not (<= |old(~q_req_up~0)| 0))) (.cse16 (<= 1 ~q_free~0)) (.cse17 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse19 (<= ~q_free~0 1)) (.cse21 (= 0 ~p_num_write~0)) (.cse24 (and .cse7 .cse4 .cse18 .cse28 .cse6)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse8 (= 0 ~c_dr_st~0)) (.cse22 (not (= 0 ~c_num_read~0))) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse26 (not (<= 2 ~q_write_ev~0))) (.cse30 (<= .cse31 ~p_num_write~0)) (.cse29 (not .cse9)) (.cse14 (= |old(~p_dw_st~0)| 0)) (.cse32 (not (= 2 ~c_dr_st~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse15 (not (<= 1 |old(~q_free~0)|))) (.cse27 (not .cse0)) (.cse10 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= |old(~q_free~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse2 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse0 .cse15 (and .cse7 .cse16 .cse17 .cse18 .cse19 .cse20 .cse6 .cse21) .cse9 .cse22 .cse23 .cse24 .cse25) (or .cse14 .cse26 .cse1 .cse2 .cse27 .cse3 (= 1 |old(~q_req_up~0)|) .cse8 .cse10 (and .cse5 .cse7 .cse17 .cse4 .cse18 .cse6) .cse9) (or .cse8 (or .cse0 .cse1 .cse2 .cse15 .cse9 .cse23) .cse22 (and .cse7 .cse16 .cse19 .cse6 .cse21) .cse11 (and .cse4 .cse28 .cse6 .cse7)) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse29 (and .cse4 .cse6 .cse7 .cse30 (<= ~p_num_write~0 .cse31))) (or (or .cse1 .cse2 .cse15 .cse27 .cse23) .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse7 .cse16 .cse17 .cse18 .cse19 .cse6 .cse21) .cse32 .cse24 .cse22) (or .cse28 .cse2 .cse1 .cse10 .cse11 .cse12 .cse0 .cse15 .cse8 .cse9 .cse22 .cse23 .cse20 .cse25) (or .cse26 (and .cse7 .cse30 .cse4 .cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse6) .cse29 (or .cse14 .cse32 (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse1 .cse2 .cse15 .cse27 .cse10 .cse23) (not (<= |old(~p_num_write~0)| ~c_num_read~0)))))))) [2019-09-08 06:35:46,772 INFO L443 ceAbstractionStarter]: For program point do_write_pEXIT(lines 114 153) no Hoare annotation was computed. [2019-09-08 06:35:46,772 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 125) no Hoare annotation was computed. [2019-09-08 06:35:46,772 INFO L439 ceAbstractionStarter]: At program point L148(lines 114 153) the Hoare annotation is: (let ((.cse27 (+ |old(~p_num_write~0)| 1))) (let ((.cse21 (= 2 ~p_dw_st~0)) (.cse18 (= 1 ~p_num_write~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse17 (= 0 ~q_free~0)) (.cse14 (= |old(~p_dw_pc~0)| 1)) (.cse25 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= .cse27 ~p_num_write~0))) (let ((.cse3 (not (= |old(~q_free~0)| 0))) (.cse4 (= 0 ~c_dr_st~0)) (.cse20 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse6 (and (= 1 ~p_dw_i~0) (not (= ~c_dr_pc~0 1)) .cse17 (not (= ~c_dr_st~0 0)) .cse14 .cse25 .cse19 .cse24 (<= ~p_num_write~0 .cse27))) (.cse22 (not (<= 2 ~q_write_ev~0))) (.cse5 (not .cse14)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse13 (not (<= 1 |old(~q_free~0)|))) (.cse23 (not .cse0)) (.cse16 (not (<= |old(~q_free~0)| 1))) (.cse7 (not (= ~q_read_ev~0 2))) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse10 (not (<= |old(~q_req_up~0)| 0))) (.cse11 (= |old(~p_dw_st~0)| 0)) (.cse26 (not (= 2 ~c_dr_st~0))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse12 (and .cse19 (= 1 ~p_dw_pc~0) .cse17 .cse21 .cse18))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse2 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (or .cse4 (and .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse16) .cse15 .cse8) (or .cse11 (and .cse20 .cse19 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse17 .cse21) .cse22 .cse1 .cse2 .cse23 .cse3 (= 1 |old(~q_req_up~0)|) .cse4 .cse7 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse17 .cse20 .cse19) .cse6) (or .cse22 (and .cse19 .cse24 .cse17 .cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse25) .cse5 (or .cse11 .cse26 (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse1 .cse2 .cse13 .cse23 .cse7 .cse16) (not (<= |old(~p_num_write~0)| ~c_num_read~0))))) (or (or .cse1 .cse2 .cse13 .cse23 .cse16) .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse15 .cse12))))) [2019-09-08 06:35:46,772 INFO L443 ceAbstractionStarter]: For program point L130(lines 129 147) no Hoare annotation was computed. [2019-09-08 06:35:46,772 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2019-09-08 06:35:46,773 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-09-08 06:35:46,773 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2019-09-08 06:35:46,773 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2019-09-08 06:35:46,773 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 101) no Hoare annotation was computed. [2019-09-08 06:35:46,773 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-09-08 06:35:46,773 INFO L443 ceAbstractionStarter]: For program point L97-2(lines 97 101) no Hoare annotation was computed. [2019-09-08 06:35:46,773 INFO L443 ceAbstractionStarter]: For program point L95-1(line 95) no Hoare annotation was computed. [2019-09-08 06:35:46,773 INFO L443 ceAbstractionStarter]: For program point immediate_notify_threadsENTRY(lines 89 113) no Hoare annotation was computed. [2019-09-08 06:35:46,774 INFO L443 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 89 113) no Hoare annotation was computed. [2019-09-08 06:35:46,774 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 109) no Hoare annotation was computed. [2019-09-08 06:35:46,774 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-08 06:35:46,774 INFO L443 ceAbstractionStarter]: For program point L105-2(lines 89 113) no Hoare annotation was computed. [2019-09-08 06:35:46,774 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 06:35:46,774 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_req_up~0 |old(~q_req_up~0)|)) [2019-09-08 06:35:46,774 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:35:46,775 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 322 375) the Hoare annotation is: (let ((.cse51 (+ ~c_num_read~0 1)) (.cse35 (= ~c_dr_pc~0 1))) (let ((.cse9 (= |old(~p_dw_pc~0)| 1)) (.cse12 (= 1 |old(~c_dr_pc~0)|)) (.cse50 (+ |old(~c_num_read~0)| 1)) (.cse24 (not .cse35)) (.cse32 (= ~c_num_read~0 0)) (.cse34 (<= ~p_num_write~0 ~c_num_read~0)) (.cse36 (<= 1 ~q_free~0)) (.cse38 (<= ~c_num_read~0 ~p_num_write~0)) (.cse40 (<= ~q_free~0 1)) (.cse41 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (not (= ~c_dr_st~0 0))) (.cse48 (<= .cse51 ~p_num_write~0)) (.cse26 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse29 (= ~p_last_write~0 ~q_buf_0~0)) (.cse37 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse25 (= 0 ~q_free~0)) (.cse39 (= 2 ~p_dw_st~0)) (.cse49 (<= ~p_num_write~0 .cse51)) (.cse28 (= |old(~p_dw_pc~0)| ~p_dw_pc~0))) (let ((.cse0 (and .cse48 .cse26 .cse35 .cse29 .cse37 .cse25 .cse39 .cse49 .cse28)) (.cse42 (and .cse34 .cse26 .cse35 .cse29 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse27 .cse28)) (.cse45 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse43 (= 0 ~p_num_write~0)) (.cse44 (not (= 0 |old(~p_num_write~0)|))) (.cse23 (and .cse26 .cse35 .cse29 .cse37 .cse25 .cse39 .cse27 .cse28)) (.cse11 (= 0 ~p_dw_st~0)) (.cse16 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse17 (not (<= 1 |old(~q_free~0)|))) (.cse19 (not (<= |old(~q_free~0)| 1))) (.cse20 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse46 (and .cse24 .cse29 .cse37 .cse32 .cse25 .cse39 (= 1 ~p_num_write~0) .cse28)) (.cse30 (not (= 1 |old(~p_num_write~0)|))) (.cse31 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (not (<= 2 ~q_write_ev~0))) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse13 (= 0 |old(~c_dr_st~0)|)) (.cse14 (not (= |old(~p_dw_st~0)| 0))) (.cse1 (not (<= .cse50 |old(~p_num_write~0)|))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse5 (not .cse12)) (.cse8 (not (<= |old(~p_num_write~0)| .cse50))) (.cse22 (not (= ~q_read_ev~0 2))) (.cse47 (not .cse9)) (.cse10 (not (= |old(~p_dw_st~0)| 2))) (.cse33 (not (<= |old(~q_req_up~0)| 0))) (.cse15 (= ~c_dr_st~0 2)) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse18 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse14) (or .cse4 .cse3 .cse5 .cse10 .cse15 .cse16 .cse2 .cse17 .cse18 .cse7 .cse9 .cse19 .cse20 .cse21) (or .cse15 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse22 .cse14 .cse9) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9 .cse10 .cse23) (or .cse12 .cse3 .cse4 .cse6 .cse13 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29)) (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse10)) (or .cse12 .cse3 .cse4 .cse6 .cse13 .cse30 .cse31 .cse32) (or .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse22 .cse15 .cse10) (or (or .cse2 .cse16 .cse3 .cse4 .cse17 .cse5 .cse18 .cse10 .cse19 .cse20 .cse21 .cse33) (and .cse34 .cse26 .cse35 .cse29 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse15 .cse28)) (or .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse9 .cse10 .cse15) (or .cse4 .cse3 .cse42 .cse5 .cse10 .cse16 .cse2 .cse17 .cse7 .cse13 .cse9 .cse19 .cse20 .cse21) (or .cse4 .cse3 .cse5 .cse22 .cse10 .cse42 .cse16 .cse2 .cse17 .cse7 .cse13 .cse19 .cse20 .cse21) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse22 .cse14 .cse9 (and .cse26 .cse35 .cse11 .cse29 .cse37 .cse25 .cse27 .cse28)) (or .cse12 .cse3 .cse4 .cse17 (and .cse24 .cse11 .cse29 .cse36 .cse32 .cse40 .cse41 .cse27 .cse28 .cse43) .cse13 .cse14 .cse9 .cse31 .cse19 .cse44 .cse21) (or .cse4 .cse3 .cse22 .cse10 .cse45 .cse12 .cse6 .cse7 .cse46 .cse30 .cse9 .cse31) (or .cse4 .cse3 .cse5 .cse22 .cse15 .cse10 .cse16 .cse2 .cse17 .cse18 .cse7 .cse19 .cse20 .cse21) (or .cse12 .cse3 .cse4 .cse6 .cse18 .cse15) (or .cse4 .cse3 .cse22 .cse44 .cse45 .cse33 .cse12 .cse17 (and .cse24 .cse11 .cse29 .cse36 .cse37 .cse32 .cse40 .cse41 .cse28 .cse43) .cse14 .cse9 .cse31 .cse19 .cse21) (or .cse12 .cse3 .cse4 .cse17 .cse18 .cse14 .cse15 .cse9 .cse31 .cse19 .cse44 .cse21) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse22 .cse23 .cse10) (or (and (and .cse34 .cse26 .cse35 .cse11 .cse29 .cse36 .cse37 .cse38 .cse40 .cse41 .cse15) (= 1 ~p_dw_pc~0)) (or .cse47 (or .cse4 .cse3 .cse5 .cse22 .cse16 .cse2 .cse17 .cse18 .cse7 .cse14 .cse19 .cse20 .cse21))) (or .cse12 .cse2 .cse3 .cse4 .cse6 .cse46 .cse22 .cse30 .cse9 .cse10 .cse31 .cse33) (or .cse1 .cse3 .cse4 .cse5 .cse8 .cse22 (and .cse48 .cse49) .cse2 .cse6 .cse7 .cse13 .cse14 .cse9) (or .cse1 .cse4 .cse3 .cse5 .cse8 .cse22 .cse47 .cse10 (= 0 ~q_write_ev~0) .cse33 (and .cse48 .cse26 .cse35 .cse29 .cse37 .cse25 .cse39 .cse49 .cse15 .cse28) .cse6 .cse18))))) [2019-09-08 06:35:46,775 INFO L443 ceAbstractionStarter]: For program point L343(lines 343 350) no Hoare annotation was computed. [2019-09-08 06:35:46,775 INFO L443 ceAbstractionStarter]: For program point L339(lines 329 369) no Hoare annotation was computed. [2019-09-08 06:35:46,776 INFO L439 ceAbstractionStarter]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse10 (= ~c_dr_pc~0 1))) (let ((.cse35 (= 1 |old(~c_dr_pc~0)|)) (.cse55 (+ ~c_num_read~0 1)) (.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse57 (+ |old(~c_num_read~0)| 1)) (.cse20 (= 0 ~p_dw_st~0)) (.cse52 (= ~c_num_read~0 0)) (.cse59 (= 1 ~p_dw_i~0)) (.cse58 (not .cse10)) (.cse56 (= ~q_read_ev~0 2)) (.cse46 (= ~c_num_read~0 1)) (.cse50 (= 1 ~p_num_write~0)) (.cse8 (= ~c_dr_st~0 2)) (.cse13 (= 0 ~q_free~0)) (.cse53 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse48 (<= 1 ~q_free~0)) (.cse12 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse54 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse49 (<= ~q_free~0 1)) (.cse51 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse21 (= |old(~p_dw_pc~0)| ~p_dw_pc~0))) (let ((.cse22 (and .cse53 .cse9 .cse10 .cse11 .cse48 .cse12 .cse54 .cse14 .cse49 .cse51 .cse15 .cse21)) (.cse43 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21)) (.cse31 (and .cse10 .cse11 .cse46 .cse48 .cse14 .cse49 .cse50 .cse51 .cse8 .cse21)) (.cse34 (and .cse59 .cse58 .cse56 .cse13 .cse15 .cse11)) (.cse45 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse32 (and .cse58 .cse11 .cse12 .cse52 .cse13 .cse14 .cse50 .cse21)) (.cse36 (not (= 1 |old(~p_num_write~0)|))) (.cse42 (not (= 0 |old(~p_num_write~0)|))) (.cse41 (and .cse59 .cse58 .cse13 .cse15 .cse11)) (.cse44 (and .cse58 .cse20 .cse11 .cse48 .cse52 .cse49 .cse51 .cse15 .cse21 (= 0 ~p_num_write~0))) (.cse37 (not (= 0 |old(~c_num_read~0)|))) (.cse17 (= 0 |old(~c_dr_st~0)|)) (.cse19 (not (= |old(~p_dw_st~0)| 0))) (.cse40 (and .cse53 .cse9 .cse10 .cse11 .cse48 .cse54 .cse14 .cse49 .cse51 .cse8 .cse21)) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse38 (not (<= .cse57 |old(~p_num_write~0)|))) (.cse39 (not (<= |old(~p_num_write~0)| .cse57))) (.cse18 (not .cse56)) (.cse28 (not .cse6)) (.cse29 (<= .cse55 ~p_num_write~0)) (.cse30 (<= ~p_num_write~0 .cse55)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse0 (not (<= 2 ~q_write_ev~0))) (.cse23 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse24 (not (<= 1 |old(~q_free~0)|))) (.cse16 (not .cse35)) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse25 (not (<= |old(~q_free~0)| 1))) (.cse26 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse27 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse33 (not (<= |old(~q_req_up~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse18 .cse19 .cse6 (and .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse15 .cse21)) (or .cse2 .cse1 .cse22 .cse16 .cse7 .cse23 .cse0 .cse24 .cse5 .cse17 .cse6 .cse25 .cse26 .cse27) (or .cse2 .cse1 .cse16 .cse18 .cse7 .cse22 .cse23 .cse0 .cse24 .cse5 .cse17 .cse25 .cse26 .cse27) (or (or .cse28 (or .cse2 .cse1 .cse16 .cse18 .cse23 .cse0 .cse24 .cse4 .cse5 .cse19 .cse25 .cse26 .cse27)) (and .cse29 .cse10 .cse11 .cse13 .cse14 .cse30 .cse8 .cse21)) (or .cse31 .cse1 .cse2 .cse32 .cse18 .cse7 .cse33 .cse34 .cse35 .cse0 .cse3 .cse36 .cse6 .cse37) (or .cse2 .cse1 .cse16 .cse18 .cse8 .cse7 .cse23 .cse0 .cse24 .cse4 .cse5 .cse25 .cse26 .cse27) (or (and .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse21) .cse38 .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse39 .cse6 .cse7 .cse40) (or .cse35 .cse1 .cse2 .cse3 .cse4 .cse8) (or .cse35 .cse1 .cse2 .cse3 .cse17 .cse41) (or .cse1 .cse2 .cse42 .cse35 .cse24 .cse4 .cse19 .cse8 .cse6 .cse37 .cse25 .cse27) (or .cse2 .cse1 .cse16 .cse7 .cse8 .cse23 .cse0 .cse24 .cse4 .cse5 .cse6 .cse25 .cse26 .cse27) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse19 .cse6) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse6 .cse7 .cse43) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse18 .cse43 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse8 .cse7) (let ((.cse47 (= 1 ~p_dw_pc~0))) (or .cse2 .cse1 .cse44 .cse18 .cse34 .cse42 .cse45 .cse33 .cse35 .cse24 (and .cse10 .cse11 .cse46 .cse47 .cse48 .cse14 .cse49 .cse50 .cse51 .cse8) .cse19 .cse6 .cse37 .cse25 (and .cse11 .cse47 .cse52 .cse13 .cse14 .cse50 .cse8) .cse27)) (or .cse2 .cse1 .cse31 .cse18 .cse34 .cse7 .cse45 .cse35 .cse3 .cse5 .cse32 .cse36 .cse6 .cse37) (or .cse1 .cse2 .cse42 .cse41 .cse35 .cse24 .cse44 .cse17 .cse19 .cse6 .cse37 .cse25 .cse27) (or .cse38 .cse1 .cse2 .cse16 .cse39 .cse18 (and .cse29 .cse30) .cse0 .cse3 .cse5 .cse17 .cse19 .cse6) (or .cse40 (and (<= ~q_req_up~0 0) .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse21) (or .cse38 .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse39 .cse18 .cse28 .cse7)) (or .cse38 .cse2 .cse1 .cse16 .cse39 .cse18 .cse28 .cse7 (= 0 ~q_write_ev~0) .cse33 (and .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse8 .cse21) .cse3 .cse4) (or (or .cse0 .cse23 .cse1 .cse2 .cse24 .cse16 .cse4 .cse7 .cse25 .cse26 .cse27 .cse33) (and .cse53 .cse9 .cse10 .cse11 .cse48 .cse12 .cse54 .cse14 .cse49 .cse51 .cse8 .cse21)))))) [2019-09-08 06:35:46,776 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 365) no Hoare annotation was computed. [2019-09-08 06:35:46,777 INFO L439 ceAbstractionStarter]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse62 (+ ~c_num_read~0 1)) (.cse10 (= ~c_dr_pc~0 1))) (let ((.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse39 (= 1 |old(~c_dr_pc~0)|)) (.cse60 (+ |old(~c_num_read~0)| 1)) (.cse20 (= 0 ~p_dw_st~0)) (.cse34 (= 0 ~p_num_write~0)) (.cse31 (= ~c_num_read~0 0)) (.cse61 (= 1 ~p_dw_i~0)) (.cse29 (not .cse10)) (.cse59 (= ~q_read_ev~0 2)) (.cse40 (= ~c_num_read~0 1)) (.cse37 (= 1 ~p_num_write~0)) (.cse8 (= ~c_dr_st~0 2)) (.cse57 (<= .cse62 ~p_num_write~0)) (.cse13 (= 0 ~q_free~0)) (.cse58 (<= ~p_num_write~0 .cse62)) (.cse49 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (<= 1 ~q_free~0)) (.cse12 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse50 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse32 (<= ~q_free~0 1)) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse21 (= |old(~p_dw_pc~0)| ~p_dw_pc~0))) (let ((.cse22 (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse12 .cse50 .cse14 .cse32 .cse33 .cse15 .cse21)) (.cse51 (and .cse57 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse58 .cse21)) (.cse56 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21)) (.cse46 (and .cse10 .cse11 .cse40 .cse30 .cse14 .cse32 .cse37 .cse33 .cse8 .cse21)) (.cse43 (and .cse61 .cse29 .cse59 .cse13 .cse15 .cse11)) (.cse45 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse47 (and .cse29 .cse11 .cse12 .cse31 .cse13 .cse14 .cse37 .cse21)) (.cse48 (not (= 1 |old(~p_num_write~0)|))) (.cse44 (not (= 0 |old(~p_num_write~0)|))) (.cse55 (and .cse61 .cse29 .cse13 .cse15 .cse11)) (.cse28 (and .cse29 .cse20 .cse11 .cse30 .cse31 .cse32 .cse33 .cse15 .cse21 .cse34)) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse17 (= 0 |old(~c_dr_st~0)|)) (.cse23 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse0 (not (<= 2 ~q_write_ev~0))) (.cse24 (not (<= 1 |old(~q_free~0)|))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse19 (not (= |old(~p_dw_st~0)| 0))) (.cse25 (not (<= |old(~q_free~0)| 1))) (.cse26 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse27 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse38 (not (= eval_~tmp___1~0 0))) (.cse36 (= 1 ~p_dw_pc~0)) (.cse52 (not (<= .cse60 |old(~p_num_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not .cse39)) (.cse53 (not (<= |old(~p_num_write~0)| .cse60))) (.cse18 (not .cse59)) (.cse54 (not .cse6)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse35 (not (<= |old(~q_req_up~0)| 0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse18 .cse19 .cse6 (and .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse15 .cse21)) (or .cse2 .cse1 .cse22 .cse16 .cse7 .cse23 .cse0 .cse24 .cse5 .cse17 .cse6 .cse25 .cse26 .cse27) (or .cse2 .cse1 .cse16 .cse18 .cse7 .cse22 .cse23 .cse0 .cse24 .cse5 .cse17 .cse25 .cse26 .cse27) (let ((.cse42 (= eval_~tmp___1~0 1))) (or .cse2 .cse28 (and .cse29 .cse20 .cse11 .cse30 .cse12 .cse31 .cse32 .cse33 .cse21 .cse34) .cse35 (and .cse11 .cse36 .cse31 .cse13 .cse14 .cse37 .cse38 .cse8) .cse39 .cse24 (and .cse10 .cse11 .cse40 .cse36 .cse30 .cse14 .cse32 .cse37 .cse33 .cse38 .cse8) .cse6 .cse41 .cse25 .cse27 .cse1 .cse18 (and .cse29 .cse42 .cse11 .cse36 .cse31 .cse13 .cse14 .cse37) .cse43 .cse44 .cse45 (and .cse42 .cse20 .cse11 .cse30 .cse12 .cse31 .cse32 .cse33 .cse8 .cse21 .cse34) .cse19)) (or .cse46 .cse1 .cse2 .cse47 .cse18 .cse7 .cse35 .cse43 .cse39 .cse0 .cse3 .cse48 .cse6 .cse41) (or (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse50 .cse14 .cse32 .cse33 .cse38 .cse8 .cse21) .cse51 (or .cse52 .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse53 .cse18 .cse54 .cse7)) (or .cse2 .cse1 .cse16 .cse18 .cse8 .cse7 .cse23 .cse0 .cse24 .cse4 .cse5 .cse25 .cse26 .cse27) (or .cse51 .cse52 .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse53 .cse6 .cse7 (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse50 .cse14 .cse32 .cse33 .cse8 .cse21)) (or .cse39 .cse1 .cse2 .cse3 .cse4 .cse8) (or .cse39 .cse1 .cse2 .cse3 .cse17 .cse55) (or .cse1 .cse2 .cse44 .cse39 .cse24 .cse4 .cse19 .cse8 .cse6 .cse41 .cse25 .cse27) (or .cse2 .cse1 .cse16 .cse7 .cse8 .cse23 .cse0 .cse24 .cse4 .cse5 .cse6 .cse25 .cse26 .cse27) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse19 .cse6) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse6 .cse7 .cse56) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse18 .cse56 .cse7) (or (or .cse0 .cse23 .cse1 .cse2 .cse24 .cse16 .cse4 .cse7 .cse25 .cse26 .cse27 .cse35) .cse54 (and (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse12 .cse50 .cse14 .cse32 .cse33 .cse8) .cse36)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse8 .cse7) (or .cse2 .cse1 .cse46 .cse18 .cse43 .cse7 .cse45 .cse39 .cse3 .cse5 .cse47 .cse48 .cse6 .cse41) (or .cse1 .cse2 .cse44 .cse55 .cse39 .cse24 .cse28 .cse17 .cse19 .cse6 .cse41 .cse25 .cse27) (or .cse52 .cse1 .cse2 .cse16 .cse53 .cse18 (and .cse57 .cse58) .cse0 .cse3 .cse5 .cse17 .cse19 .cse6) (or (or .cse54 (or .cse2 .cse1 .cse16 .cse18 .cse23 .cse0 .cse24 .cse4 .cse5 .cse19 .cse25 .cse26 .cse27)) (and .cse57 .cse10 .cse11 .cse13 .cse14 .cse58 .cse38 .cse8 .cse21) (and (and .cse49 .cse9 .cse10 .cse20 .cse11 .cse30 .cse12 .cse50 .cse32 .cse33 .cse8) .cse36)) (or .cse52 .cse2 .cse1 .cse16 .cse53 .cse18 .cse54 .cse7 (= 0 ~q_write_ev~0) .cse35 (and .cse57 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse58 .cse8 .cse21) .cse3 .cse4))))) [2019-09-08 06:35:46,777 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 322 375) no Hoare annotation was computed. [2019-09-08 06:35:46,778 INFO L439 ceAbstractionStarter]: At program point L346(line 346) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 1))) (let ((.cse17 (= |old(~p_dw_pc~0)| 1)) (.cse22 (= 1 |old(~c_dr_pc~0)|)) (.cse47 (+ |old(~c_num_read~0)| 1)) (.cse12 (= 0 ~q_free~0)) (.cse48 (= 1 ~p_dw_i~0)) (.cse34 (not .cse9)) (.cse46 (= ~q_read_ev~0 2)) (.cse8 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (<= 1 ~q_free~0)) (.cse37 (= ~c_num_read~0 0)) (.cse38 (<= ~q_free~0 1)) (.cse39 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= ~c_dr_st~0 0))) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse40 (= 0 ~p_num_write~0))) (let ((.cse11 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse26 (and .cse48 .cse34 .cse46 .cse8 .cse10 .cse36 (not (= 1 ~p_dw_pc~0)) .cse37 (= ~q_write_ev~0 ~q_read_ev~0) .cse38 .cse39 .cse14 .cse15 .cse40)) (.cse35 (= eval_~tmp___1~0 1)) (.cse13 (not (= 0 ~p_dw_st~0))) (.cse28 (= ~c_dr_st~0 2)) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse43 (and .cse48 .cse34 .cse12 .cse14 .cse10)) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse16 (not (= |old(~p_dw_st~0)| 0))) (.cse19 (and .cse48 .cse34 .cse46 .cse12 .cse14 .cse10)) (.cse21 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse44 (not (= 1 |old(~p_num_write~0)|))) (.cse24 (not (= 0 |old(~c_num_read~0)|))) (.cse0 (not (<= 2 ~q_write_ev~0))) (.cse30 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse23 (not (<= 1 |old(~q_free~0)|))) (.cse25 (not (<= |old(~q_free~0)| 1))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse27 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse32 (not (<= .cse47 |old(~p_num_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not .cse22)) (.cse33 (not (<= |old(~p_num_write~0)| .cse47))) (.cse7 (not .cse46)) (.cse42 (not .cse17)) (.cse18 (not (= |old(~p_dw_st~0)| 2))) (.cse41 (not (<= |old(~q_req_up~0)| 0))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse29 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse18) (or .cse2 .cse1 .cse7 .cse19 .cse20 .cse21 .cse22 .cse23 .cse6 .cse16 .cse17 .cse24 .cse25 .cse26 .cse27) (or .cse1 .cse2 .cse28 .cse20 .cse22 .cse23 .cse29 .cse16 .cse17 .cse24 .cse25 .cse27) (or .cse2 .cse1 .cse3 .cse7 .cse18 .cse30 .cse0 .cse23 .cse5 .cse6 .cse25 .cse31 .cse27) (or .cse32 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse7 .cse18) (or .cse0 .cse1 .cse2 .cse4 .cse29 .cse5 .cse7 .cse16 .cse28 .cse17) (or .cse32 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse17 .cse18) (or .cse2 .cse1 (and .cse34 .cse35 .cse10 .cse36 .cse11 .cse37 .cse13 .cse38 .cse39 .cse15 .cse40) .cse7 .cse19 (and .cse35 .cse9 .cse10 .cse36 .cse11 .cse37 .cse13 .cse38 .cse28 .cse15 .cse40) .cse20 .cse21 .cse41 .cse22 .cse23 .cse16 .cse17 .cse24 .cse26 .cse25 .cse27) (or .cse22 .cse1 .cse2 .cse4 .cse29 .cse28) (or (or .cse42 (or .cse2 .cse1 .cse3 .cse7 .cse30 .cse0 .cse23 .cse29 .cse5 .cse16 .cse25 .cse31 .cse27)) (and .cse35 (and (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse38 .cse9 .cse15 .cse10 .cse36) .cse13 .cse28))) (or .cse22 .cse1 .cse2 .cse4 .cse6 .cse43) (or .cse2 .cse1 .cse3 .cse18 .cse30 .cse0 .cse23 .cse5 .cse6 .cse17 .cse25 .cse31 .cse27) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse7 .cse44 .cse17 .cse18 .cse24 .cse41) (or .cse1 .cse2 (and .cse34 .cse10 .cse36 .cse37 .cse38 .cse14 .cse15 .cse40) .cse20 .cse43 .cse22 .cse23 .cse6 .cse16 .cse17 .cse24 .cse25 .cse27) (or .cse32 .cse1 .cse2 .cse3 .cse33 .cse7 .cse0 .cse4 .cse5 .cse6 .cse16 .cse17 (let ((.cse45 (+ ~c_num_read~0 1))) (and (<= .cse45 ~p_num_write~0) (<= ~p_num_write~0 .cse45)))) (or .cse2 .cse1 .cse7 .cse19 .cse18 .cse21 .cse4 .cse5 .cse44 .cse17 .cse24) (or .cse0 .cse30 .cse1 .cse2 .cse23 .cse3 .cse29 .cse18 .cse25 .cse31 .cse27 .cse41) (or .cse32 .cse2 .cse1 .cse3 .cse33 .cse7 .cse42 .cse18 (= 0 ~q_write_ev~0) .cse41 .cse4 .cse29))))) [2019-09-08 06:35:46,778 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2019-09-08 06:35:46,778 INFO L443 ceAbstractionStarter]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2019-09-08 06:35:46,778 INFO L443 ceAbstractionStarter]: For program point L332(line 332) no Hoare annotation was computed. [2019-09-08 06:35:46,779 INFO L439 ceAbstractionStarter]: At program point L330(line 330) the Hoare annotation is: (let ((.cse62 (+ ~c_num_read~0 1)) (.cse10 (= ~c_dr_pc~0 1))) (let ((.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse39 (= 1 |old(~c_dr_pc~0)|)) (.cse60 (+ |old(~c_num_read~0)| 1)) (.cse20 (= 0 ~p_dw_st~0)) (.cse34 (= 0 ~p_num_write~0)) (.cse31 (= ~c_num_read~0 0)) (.cse61 (= 1 ~p_dw_i~0)) (.cse29 (not .cse10)) (.cse59 (= ~q_read_ev~0 2)) (.cse40 (= ~c_num_read~0 1)) (.cse37 (= 1 ~p_num_write~0)) (.cse8 (= ~c_dr_st~0 2)) (.cse57 (<= .cse62 ~p_num_write~0)) (.cse13 (= 0 ~q_free~0)) (.cse58 (<= ~p_num_write~0 .cse62)) (.cse49 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (<= 1 ~q_free~0)) (.cse12 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse50 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse32 (<= ~q_free~0 1)) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse21 (= |old(~p_dw_pc~0)| ~p_dw_pc~0))) (let ((.cse22 (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse12 .cse50 .cse14 .cse32 .cse33 .cse15 .cse21)) (.cse51 (and .cse57 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse58 .cse21)) (.cse56 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21)) (.cse46 (and .cse10 .cse11 .cse40 .cse30 .cse14 .cse32 .cse37 .cse33 .cse8 .cse21)) (.cse43 (and .cse61 .cse29 .cse59 .cse13 .cse15 .cse11)) (.cse45 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse47 (and .cse29 .cse11 .cse12 .cse31 .cse13 .cse14 .cse37 .cse21)) (.cse48 (not (= 1 |old(~p_num_write~0)|))) (.cse44 (not (= 0 |old(~p_num_write~0)|))) (.cse55 (and .cse61 .cse29 .cse13 .cse15 .cse11)) (.cse28 (and .cse29 .cse20 .cse11 .cse30 .cse31 .cse32 .cse33 .cse15 .cse21 .cse34)) (.cse41 (not (= 0 |old(~c_num_read~0)|))) (.cse17 (= 0 |old(~c_dr_st~0)|)) (.cse23 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse0 (not (<= 2 ~q_write_ev~0))) (.cse24 (not (<= 1 |old(~q_free~0)|))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse19 (not (= |old(~p_dw_st~0)| 0))) (.cse25 (not (<= |old(~q_free~0)| 1))) (.cse26 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse27 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse38 (not (= eval_~tmp___1~0 0))) (.cse36 (= 1 ~p_dw_pc~0)) (.cse52 (not (<= .cse60 |old(~p_num_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not .cse39)) (.cse53 (not (<= |old(~p_num_write~0)| .cse60))) (.cse18 (not .cse59)) (.cse54 (not .cse6)) (.cse7 (not (= |old(~p_dw_st~0)| 2))) (.cse35 (not (<= |old(~q_req_up~0)| 0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse18 .cse19 .cse6 (and .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse15 .cse21)) (or .cse2 .cse1 .cse22 .cse16 .cse7 .cse23 .cse0 .cse24 .cse5 .cse17 .cse6 .cse25 .cse26 .cse27) (or .cse2 .cse1 .cse16 .cse18 .cse7 .cse22 .cse23 .cse0 .cse24 .cse5 .cse17 .cse25 .cse26 .cse27) (let ((.cse42 (= eval_~tmp___1~0 1))) (or .cse2 .cse28 (and .cse29 .cse20 .cse11 .cse30 .cse12 .cse31 .cse32 .cse33 .cse21 .cse34) .cse35 (and .cse11 .cse36 .cse31 .cse13 .cse14 .cse37 .cse38 .cse8) .cse39 .cse24 (and .cse10 .cse11 .cse40 .cse36 .cse30 .cse14 .cse32 .cse37 .cse33 .cse38 .cse8) .cse6 .cse41 .cse25 .cse27 .cse1 .cse18 (and .cse29 .cse42 .cse11 .cse36 .cse31 .cse13 .cse14 .cse37) .cse43 .cse44 .cse45 (and .cse42 .cse20 .cse11 .cse30 .cse12 .cse31 .cse32 .cse33 .cse8 .cse21 .cse34) .cse19)) (or .cse46 .cse1 .cse2 .cse47 .cse18 .cse7 .cse35 .cse43 .cse39 .cse0 .cse3 .cse48 .cse6 .cse41) (or (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse50 .cse14 .cse32 .cse33 .cse38 .cse8 .cse21) .cse51 (or .cse52 .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse53 .cse18 .cse54 .cse7)) (or .cse2 .cse1 .cse16 .cse18 .cse8 .cse7 .cse23 .cse0 .cse24 .cse4 .cse5 .cse25 .cse26 .cse27) (or .cse51 .cse52 .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse53 .cse6 .cse7 (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse50 .cse14 .cse32 .cse33 .cse8 .cse21)) (or .cse39 .cse1 .cse2 .cse3 .cse4 .cse8) (or .cse39 .cse1 .cse2 .cse3 .cse17 .cse55) (or .cse1 .cse2 .cse44 .cse39 .cse24 .cse4 .cse19 .cse8 .cse6 .cse41 .cse25 .cse27) (or .cse2 .cse1 .cse16 .cse7 .cse8 .cse23 .cse0 .cse24 .cse4 .cse5 .cse6 .cse25 .cse26 .cse27) (or .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse19 .cse6) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse6 .cse7 .cse56) (or .cse0 .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse18 .cse56 .cse7) (or (or .cse0 .cse23 .cse1 .cse2 .cse24 .cse16 .cse4 .cse7 .cse25 .cse26 .cse27 .cse35) .cse54 (and (and .cse49 .cse9 .cse10 .cse11 .cse30 .cse12 .cse50 .cse14 .cse32 .cse33 .cse8) .cse36)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse8 .cse7) (or .cse2 .cse1 .cse46 .cse18 .cse43 .cse7 .cse45 .cse39 .cse3 .cse5 .cse47 .cse48 .cse6 .cse41) (or .cse1 .cse2 .cse44 .cse55 .cse39 .cse24 .cse28 .cse17 .cse19 .cse6 .cse41 .cse25 .cse27) (or .cse52 .cse1 .cse2 .cse16 .cse53 .cse18 (and .cse57 .cse58) .cse0 .cse3 .cse5 .cse17 .cse19 .cse6) (or (or .cse54 (or .cse2 .cse1 .cse16 .cse18 .cse23 .cse0 .cse24 .cse4 .cse5 .cse19 .cse25 .cse26 .cse27)) (and .cse57 .cse10 .cse11 .cse13 .cse14 .cse58 .cse38 .cse8 .cse21) (and (and .cse49 .cse9 .cse10 .cse20 .cse11 .cse30 .cse12 .cse50 .cse32 .cse33 .cse8) .cse36)) (or .cse52 .cse2 .cse1 .cse16 .cse53 .cse18 .cse54 .cse7 (= 0 ~q_write_ev~0) .cse35 (and .cse57 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse58 .cse8 .cse21) .cse3 .cse4))))) [2019-09-08 06:35:46,779 INFO L439 ceAbstractionStarter]: At program point L361(line 361) the Hoare annotation is: (let ((.cse34 (= ~c_dr_pc~0 1))) (let ((.cse41 (+ ~c_num_read~0 1)) (.cse14 (= 1 |old(~c_dr_pc~0)|)) (.cse42 (+ |old(~c_num_read~0)| 1)) (.cse2 (not .cse34)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= 0 ~q_free~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse8 (= 1 ~p_num_write~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse17 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse19 (= |old(~p_dw_pc~0)| 1))) (let ((.cse3 (= eval_~tmp___1~0 1)) (.cse25 (not .cse19)) (.cse16 (not (= |old(~p_dw_st~0)| 0))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse24 (= 0 |old(~c_dr_st~0)|)) (.cse10 (not (= ~q_read_ev~0 2))) (.cse12 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse39 (not (= 1 |old(~p_num_write~0)|))) (.cse20 (not (= 0 |old(~c_num_read~0)|))) (.cse40 (and .cse2 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17)) (.cse27 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse15 (not (<= 1 |old(~q_free~0)|))) (.cse29 (not (= 2 |old(~c_dr_st~0)|))) (.cse21 (not (<= |old(~q_free~0)| 1))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse13 (not (<= |old(~q_req_up~0)| 0))) (.cse37 (not (<= .cse42 |old(~p_num_write~0)|))) (.cse28 (not (<= 2 ~q_write_ev~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse26 (not .cse14)) (.cse23 (not (= |old(~q_free~0)| 0))) (.cse30 (= 1 |old(~q_req_up~0)|)) (.cse38 (not (<= |old(~p_num_write~0)| .cse42))) (.cse33 (<= .cse41 ~p_num_write~0)) (.cse35 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse36 (<= ~p_num_write~0 .cse41)) (.cse32 (not (= |old(~p_dw_st~0)| 2)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (= 1 ~p_dw_pc~0) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse3 (<= 1 ~q_free~0) .cse17 .cse2 (= 0 ~p_dw_st~0) .cse4 .cse18 .cse5 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) .cse9 (= 0 ~p_num_write~0)) .cse19 .cse20 .cse21 .cse22) (or .cse14 .cse1 .cse0 .cse23 .cse24) (or .cse25 (or .cse0 .cse1 .cse26 .cse10 .cse27 .cse28 .cse15 .cse29 .cse30 .cse16 .cse21 .cse31 .cse22)) (or .cse0 .cse1 .cse26 .cse10 .cse32 .cse27 .cse28 .cse15 .cse30 .cse24 .cse21 .cse31 .cse22) (or (and (and .cse33 (and .cse34 .cse17 .cse4) .cse6 .cse7 .cse35 .cse36 .cse9 .cse18) .cse3) (or .cse37 .cse28 .cse1 .cse0 .cse26 .cse23 .cse30 .cse38 .cse10 .cse25 .cse32)) (or .cse28 .cse1 .cse0 .cse23 .cse30 .cse24 .cse19 .cse32) (or .cse28 .cse1 .cse0 .cse23 .cse30 .cse24 .cse10 .cse16 .cse19) (or .cse0 .cse1 .cse26 .cse32 .cse27 .cse28 .cse15 .cse30 .cse24 .cse19 .cse21 .cse31 .cse22) (or .cse37 .cse0 .cse1 .cse38 .cse10 .cse25 .cse32 (= 0 ~q_write_ev~0) .cse13 .cse23 .cse29) (or .cse14 .cse28 .cse1 .cse0 .cse23 .cse10 .cse39 .cse19 .cse32 .cse20 .cse13 .cse40) (or .cse14 .cse1 .cse0 .cse15 .cse24 .cse16 .cse19 .cse20 .cse21 .cse11 .cse22) (or .cse28 .cse1 .cse0 .cse23 .cse30 .cse24 .cse10 .cse32) (or .cse0 .cse1 .cse10 .cse32 .cse12 .cse14 .cse23 .cse30 .cse39 .cse19 .cse20 .cse40) (or .cse28 .cse27 .cse1 .cse0 .cse15 .cse26 .cse29 .cse32 .cse21 .cse31 .cse22 .cse13) (or .cse37 .cse28 .cse1 .cse0 .cse26 .cse23 .cse30 .cse38 (and .cse33 .cse35 .cse34 .cse4 .cse18 .cse6 .cse7 .cse36 .cse9 .cse17) .cse19 .cse32))))) [2019-09-08 06:35:46,780 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-09-08 06:35:46,780 INFO L446 ceAbstractionStarter]: At program point L382(line 382) the Hoare annotation is: true [2019-09-08 06:35:46,780 INFO L443 ceAbstractionStarter]: For program point L382-1(line 382) no Hoare annotation was computed. [2019-09-08 06:35:46,780 INFO L446 ceAbstractionStarter]: At program point L391(lines 380 393) the Hoare annotation is: true [2019-09-08 06:35:46,780 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 376 394) no Hoare annotation was computed. [2019-09-08 06:35:46,780 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 376 394) the Hoare annotation is: true [2019-09-08 06:35:46,780 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 376 394) no Hoare annotation was computed. [2019-09-08 06:35:46,780 INFO L446 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 70 88) the Hoare annotation is: true [2019-09-08 06:35:46,781 INFO L439 ceAbstractionStarter]: At program point L85(lines 73 87) the Hoare annotation is: (let ((.cse26 (= 1 ~c_dr_pc~0))) (let ((.cse8 (not .cse26)) (.cse22 (not (= ~q_read_ev~0 2))) (.cse20 (= ~p_dw_pc~0 1)) (.cse29 (+ ~c_num_read~0 1))) (let ((.cse14 (not (= ~q_read_ev~0 1))) (.cse16 (not (<= .cse29 ~p_num_write~0))) (.cse19 (not (<= ~p_num_write~0 .cse29))) (.cse15 (not .cse20)) (.cse7 (not (= 2 ~c_dr_st~0))) (.cse23 (not (= 1 ~p_num_write~0))) (.cse17 (not (= ~q_free~0 0))) (.cse27 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse12 (not (<= ~q_req_up~0 0))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse24 (not (= 0 ~c_num_read~0))) (.cse28 (not (= 0 ~p_num_write~0))) (.cse0 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse5 (not (= ~p_dw_i~0 1))) (.cse4 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_st~0 2))) (.cse25 (or .cse8 .cse22)) (.cse3 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse1 (not (<= 2 ~q_write_ev~0))) (.cse6 (not (<= 1 ~q_free~0))) (.cse18 (= 1 ~q_req_up~0)) (.cse21 (= 0 ~c_dr_st~0)) (.cse9 (not (<= ~q_free~0 1))) (.cse10 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (or .cse1 (or .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) .cse12)) (or (or .cse5 .cse4 .cse8 .cse12 .cse3 .cse1 .cse6 .cse7 .cse13 .cse9 .cse10 .cse11) .cse14 .cse15 .cse0) (or .cse16 .cse1 .cse4 .cse5 .cse17 .cse18 .cse19 .cse8 .cse0 .cse20 .cse2) (or .cse0 .cse14 (or .cse1 .cse18 (or (or .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse9 .cse10 .cse11) .cse2))) (or .cse1 .cse4 .cse5 .cse17 .cse22 .cse23 .cse20 .cse2 .cse24 .cse0 .cse12) (or .cse1 .cse4 .cse5 .cse17 .cse18 .cse0 .cse21 .cse2 .cse25) (or .cse1 .cse4 .cse5 .cse17 .cse18 .cse0 .cse21 .cse13 .cse20 .cse25) (or .cse16 .cse5 .cse4 .cse19 .cse15 .cse2 (= 0 ~q_write_ev~0) .cse25 .cse12 .cse17 .cse7 (= ~q_write_ev~0 1) .cse0) (or .cse4 .cse5 .cse17 .cse0 .cse21 .cse26) (or .cse5 .cse4 .cse22 .cse0 .cse2 .cse27 .cse17 .cse18 .cse23 .cse20 .cse24) (or .cse1 .cse4 .cse5 .cse0 .cse17 .cse18 .cse21 .cse20 .cse2) (or .cse5 .cse4 .cse0 .cse22 .cse28 .cse27 .cse12 .cse26 .cse6 .cse13 .cse20 .cse24 .cse9 .cse11) (or .cse4 .cse5 .cse6 .cse21 .cse13 .cse20 .cse24 .cse26 .cse9 .cse28 .cse0 .cse11) (or .cse5 .cse4 .cse8 .cse2 .cse3 .cse1 .cse6 .cse18 .cse0 .cse21 .cse20 .cse9 .cse10 .cse11) (or .cse0 .cse5 .cse4 .cse2 .cse25 .cse3 .cse1 .cse6 .cse18 .cse21 .cse9 .cse10 .cse11))))) [2019-09-08 06:35:46,781 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 70 88) no Hoare annotation was computed. [2019-09-08 06:35:46,781 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-09-08 06:35:46,781 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 83) no Hoare annotation was computed. [2019-09-08 06:35:46,781 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2019-09-08 06:35:46,781 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 70 88) no Hoare annotation was computed. [2019-09-08 06:35:46,782 INFO L439 ceAbstractionStarter]: At program point update_channelsENTRY(lines 208 222) the Hoare annotation is: (let ((.cse28 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse6 (= 1 ~c_dr_pc~0)) (.cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse30 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse10 (= ~p_dw_pc~0 1)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse3 (not (= 0 ~p_num_write~0))) (.cse9 (not (= ~p_dw_st~0 0))) (.cse16 (not (<= .cse31 ~p_num_write~0))) (.cse21 (not (<= ~p_num_write~0 .cse31))) (.cse23 (not .cse10)) (.cse5 (not (<= |old(~q_req_up~0)| 0))) (.cse24 (not (= 2 ~c_dr_st~0))) (.cse25 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse7 (not (<= 1 ~q_free~0))) (.cse12 (not (<= ~q_free~0 1))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (and .cse29 .cse30)) (.cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse27 (not (= 1 ~p_num_write~0))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse17 (not (<= 2 |old(~q_write_ev~0)|))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse18 (not .cse6)) (.cse19 (not (= ~q_free~0 0))) (.cse20 (= 1 |old(~q_req_up~0)|)) (.cse15 (= 0 ~c_dr_st~0)) (.cse2 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (and .cse28 .cse29 .cse30)) (.cse22 (not (= ~p_dw_st~0 2)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 .cse1 .cse0 .cse7 .cse14 .cse15 .cse9 .cse10 .cse11 .cse12 .cse3 .cse13) (or .cse8 .cse16 .cse17 .cse1 .cse0 .cse18 .cse19 .cse20 .cse21 .cse10 .cse22) (or .cse16 .cse0 .cse1 .cse18 .cse8 .cse21 .cse2 .cse23 .cse22 .cse17 .cse19 .cse24) (or (or .cse17 .cse25 .cse1 .cse0 .cse7 .cse18 .cse24 .cse22 .cse12 .cse26 .cse13 .cse5) .cse8) (or .cse1 .cse0 .cse18 .cse22 .cse17 .cse25 .cse7 .cse24 .cse10 .cse8 .cse12 .cse26 .cse13) (or .cse17 .cse1 .cse0 .cse18 .cse19 .cse20 .cse15 .cse2 .cse9 .cse10 .cse8) (or .cse0 .cse1 .cse18 .cse2 .cse22 .cse8 .cse25 .cse17 .cse7 .cse20 .cse15 .cse12 .cse26 .cse13) (or .cse17 .cse1 .cse0 .cse18 .cse19 .cse20 .cse15 .cse10 .cse22 .cse8) (or .cse16 .cse0 .cse1 .cse18 .cse21 .cse2 .cse23 .cse22 (= 0 |old(~q_write_ev~0)|) .cse5 .cse8 .cse19 .cse24) (or .cse17 .cse1 .cse0 .cse19 .cse8 .cse2 .cse27 .cse10 .cse22 .cse11 .cse5) (or (and (and .cse28 .cse29) .cse30) (or .cse17 .cse25 .cse1 .cse0 .cse7 .cse18 .cse24 .cse2 .cse22 .cse12 .cse26 .cse13)) (or .cse0 .cse1 .cse8 .cse18 .cse22 .cse25 .cse17 .cse7 .cse20 .cse15 .cse10 .cse12 .cse26 .cse13) (or .cse6 .cse1 .cse0 .cse19 .cse15 .cse14) (or .cse0 .cse1 .cse2 .cse22 .cse4 .cse19 .cse20 .cse8 .cse27 .cse10 .cse11) (or .cse17 .cse1 .cse0 .cse18 .cse19 .cse20 .cse15 .cse2 .cse8 .cse22)))) [2019-09-08 06:35:46,782 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 208 222) no Hoare annotation was computed. [2019-09-08 06:35:46,782 INFO L439 ceAbstractionStarter]: At program point L214(line 214) the Hoare annotation is: (let ((.cse28 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse30 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse7 (= ~p_dw_pc~0 1)) (.cse9 (= 1 ~c_dr_pc~0)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse18 (not (= 1 ~p_num_write~0))) (.cse24 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse5 (= 1 |old(~q_req_up~0)|)) (.cse20 (not (<= .cse31 ~p_num_write~0))) (.cse3 (not .cse9)) (.cse21 (not (<= ~p_num_write~0 .cse31))) (.cse22 (not .cse7)) (.cse8 (not (= ~p_dw_st~0 2))) (.cse0 (not (<= 2 |old(~q_write_ev~0)|))) (.cse23 (not (= 2 ~c_dr_st~0))) (.cse26 (and .cse28 .cse30 .cse29)) (.cse4 (not (= ~q_free~0 0))) (.cse6 (= 0 ~c_dr_st~0)) (.cse11 (and .cse30 .cse29)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse17 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (= 0 ~p_num_write~0))) (.cse27 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse19 (not (<= |old(~q_req_up~0)| 0))) (.cse10 (not (<= 1 ~q_free~0))) (.cse12 (not (= ~p_dw_st~0 0))) (.cse13 (not (= 0 ~c_num_read~0))) (.cse14 (not (<= ~q_free~0 1))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse12 .cse7 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse17 .cse18 .cse7 .cse8 .cse13 .cse19) (or .cse20 .cse2 .cse1 .cse3 .cse21 .cse17 .cse22 .cse8 (= 0 |old(~q_write_ev~0)|) .cse19 .cse4 .cse23) (or .cse2 .cse1 .cse3 .cse17 .cse8 .cse24 .cse0 .cse10 .cse5 .cse6 .cse14 .cse25 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse12 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse8) (or .cse1 .cse2 .cse3 .cse8 .cse26 .cse0 .cse24 .cse10 .cse23 .cse7 .cse14 .cse25 .cse16) (or .cse2 .cse1 .cse17 .cse8 .cse27 .cse4 .cse5 .cse18 .cse7 .cse13) (or .cse2 .cse1 .cse3 .cse8 .cse24 .cse0 .cse10 .cse5 .cse6 .cse7 .cse14 .cse25 .cse16) (or .cse0 .cse24 .cse1 .cse2 .cse10 .cse3 .cse23 .cse8 .cse14 .cse25 .cse16 .cse19) (or (or .cse0 .cse24 .cse1 .cse2 .cse10 .cse3 .cse23 .cse17 .cse8 .cse14 .cse25 .cse16) (and (and (= ~q_read_ev~0 2) .cse28) .cse29)) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse8) (or .cse20 .cse1 .cse2 .cse3 .cse21 .cse17 .cse22 .cse8 .cse0 .cse4 .cse23 .cse26) (or .cse9 .cse1 .cse2 .cse4 .cse6 .cse11) (or .cse2 .cse1 .cse17 .cse15 .cse27 .cse19 .cse9 .cse10 .cse12 .cse7 .cse13 .cse14 .cse16)))) [2019-09-08 06:35:46,783 INFO L443 ceAbstractionStarter]: For program point L212(lines 208 222) no Hoare annotation was computed. [2019-09-08 06:35:46,783 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 261 278) the Hoare annotation is: (let ((.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse10 (= 1 ~c_dr_pc~0)) (.cse26 (+ ~c_num_read~0 1))) (let ((.cse17 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse19 (not (= 2 ~c_dr_st~0))) (.cse23 (not (<= .cse26 ~p_num_write~0))) (.cse18 (not .cse10)) (.cse24 (not (<= ~p_num_write~0 .cse26))) (.cse14 (not (= 0 ~p_num_write~0))) (.cse21 (not (<= ~q_req_up~0 0))) (.cse11 (not (<= 1 ~q_free~0))) (.cse7 (not (= ~p_dw_st~0 0))) (.cse13 (not (<= ~q_free~0 1))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (<= 2 |old(~q_write_ev~0)|))) (.cse5 (= 0 ~c_dr_st~0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse9 (and (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse16 (not (= ~p_dw_st~0 2))) (.cse3 (not (= ~q_free~0 0))) (.cse4 (= 1 ~q_req_up~0)) (.cse25 (or .cse6 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)))) (.cse22 (not (= 1 ~p_num_write~0))) (.cse8 (= ~p_dw_pc~0 1)) (.cse12 (not (= 0 ~c_num_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse1 .cse2 .cse11 .cse9 .cse5 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse16) (or (or .cse0 .cse17 .cse1 .cse2 .cse11 .cse18 .cse19 .cse16 .cse13 .cse20 .cse15 .cse21) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 .cse22 .cse8 .cse16 .cse12 .cse21) (or .cse2 .cse1 .cse18 .cse6 .cse16 .cse9 .cse17 .cse0 .cse11 .cse4 .cse5 .cse13 .cse20 .cse15) (or .cse2 .cse1 .cse9 .cse18 .cse16 .cse17 .cse0 .cse11 .cse4 .cse5 .cse8 .cse13 .cse20 .cse15) (or .cse23 .cse1 .cse2 .cse24 .cse6 (not .cse8) .cse16 .cse9 .cse21 .cse3 .cse19) (or .cse10 .cse1 .cse2 .cse3 .cse5 .cse9) (or .cse9 .cse23 .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse24 .cse8 .cse16) (or .cse2 .cse1 .cse14 .cse21 .cse10 .cse11 .cse9 .cse7 .cse25 .cse8 .cse12 .cse13 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse16 .cse9) (or .cse2 .cse1 .cse9 .cse16 .cse3 .cse4 .cse25 .cse22 .cse8 .cse12)))) [2019-09-08 06:35:46,783 INFO L443 ceAbstractionStarter]: For program point L270-1(lines 261 278) no Hoare annotation was computed. [2019-09-08 06:35:46,783 INFO L443 ceAbstractionStarter]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2019-09-08 06:35:46,783 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 261 278) no Hoare annotation was computed. [2019-09-08 06:35:46,784 INFO L439 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse21 (= 1 ~p_dw_pc~0)) (.cse23 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (let ((.cse0 (not .cse6)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~c_dr_st~0 2)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse16 (= 0 ~p_dw_st~0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse13 (not (= ~q_req_up~0 1))) (.cse18 (<= ~q_req_up~0 0)) (.cse10 (= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse17 (= ~c_num_read~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse1 (= 0 ~q_free~0)) (.cse19 (= 1 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not .cse21))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3) (not (<= |old(~q_req_up~0)| 0)) (and .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse4 .cse14 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse16 .cse3 .cse7 .cse8 .cse17 .cse11 .cse12 .cse2 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse4 .cse18 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse14 .cse1 .cse10 .cse5 .cse2 .cse13 .cse3) (and .cse4 .cse14 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse3 .cse8 .cse17 .cse1 .cse10 .cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (and .cse18 .cse20 .cse14 .cse3 .cse21 (not (= ~q_write_ev~0 0)) .cse1 .cse10 .cse22 .cse15) (not (<= 1 |old(~q_free~0)|)) (and .cse1 .cse10 .cse5 .cse13 .cse2 .cse3 .cse8) (and .cse20 .cse14 .cse5 .cse3 .cse21 .cse1 .cse10 .cse22 .cse15) (and .cse14 .cse1 .cse5 .cse2 .cse13 .cse16 .cse3 .cse8) (and .cse20 .cse1 .cse10 .cse5 .cse6 .cse22 .cse13 .cse3 .cse8) (and .cse18 .cse10 .cse5 (and .cse17 .cse14 .cse1 .cse19 .cse3 .cse8)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2019-09-08 06:35:46,784 INFO L443 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2019-09-08 06:35:46,784 INFO L439 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse23 (= 1 ~p_dw_pc~0)) (.cse26 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (let ((.cse0 (not .cse6)) (.cse18 (= 0 ~p_num_write~0)) (.cse16 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_dr_st~0 2)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse14 (= 0 ~p_dw_st~0)) (.cse24 (<= .cse26 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 .cse26)) (.cse13 (not (= ~q_req_up~0 1))) (.cse20 (<= ~q_req_up~0 0)) (.cse10 (= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse15 (= ~c_num_read~0 0)) (.cse19 (= ~q_read_ev~0 2)) (.cse1 (= 0 ~q_free~0)) (.cse22 (= 1 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not .cse23))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3) (not (<= |old(~q_req_up~0)| 0)) (and .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse14 .cse3 .cse7 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse15 .cse11 .cse12 .cse16 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse17 .cse18) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse4 .cse19 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse14 .cse3 .cse7 .cse8 .cse15 .cse11 .cse12 .cse2 .cse18) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse4 .cse20 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse19 .cse1 .cse10 .cse5 .cse2 .cse13 .cse3) (and .cse3 .cse8 .cse15 .cse1 .cse10 .cse22 .cse16 .cse13 .cse17) (and (and .cse4 .cse19 .cse5 .cse6 .cse14 .cse3 .cse7 .cse9 .cse11 .cse12 .cse13 .cse21) .cse23) (and .cse20 .cse24 .cse19 .cse3 .cse23 (not (= ~q_write_ev~0 0)) .cse1 .cse10 .cse25 .cse21) (not (<= 1 |old(~q_free~0)|)) (and .cse1 .cse10 .cse5 .cse13 .cse2 .cse3 .cse8) (and .cse19 .cse1 .cse5 .cse2 .cse13 .cse14 .cse3 .cse8) (and .cse24 .cse19 .cse1 .cse10 .cse5 .cse25 .cse6 .cse13 .cse3) (and .cse24 .cse1 .cse10 .cse5 .cse6 .cse25 .cse13 .cse3 .cse8) (and .cse20 .cse10 .cse5 (and .cse15 .cse19 .cse1 .cse22 .cse3 .cse8)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2019-09-08 06:35:46,784 INFO L443 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2019-09-08 06:35:46,784 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 395 437) no Hoare annotation was computed. [2019-09-08 06:35:46,785 INFO L439 ceAbstractionStarter]: At program point L409-1(lines 406 431) the Hoare annotation is: (let ((.cse23 (= 1 ~p_dw_pc~0)) (.cse26 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (let ((.cse0 (not .cse6)) (.cse18 (= 0 ~p_num_write~0)) (.cse16 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~c_dr_st~0 2)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse14 (= 0 ~p_dw_st~0)) (.cse24 (<= .cse26 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 .cse26)) (.cse13 (not (= ~q_req_up~0 1))) (.cse20 (<= ~q_req_up~0 0)) (.cse10 (= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse15 (= ~c_num_read~0 0)) (.cse19 (= ~q_read_ev~0 2)) (.cse1 (= 0 ~q_free~0)) (.cse22 (= 1 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not .cse23))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3) (not (<= |old(~q_req_up~0)| 0)) (and .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2) (= 1 |old(~c_dr_pc~0)|) (and .cse0 .cse14 .cse3 .cse7 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse15 .cse11 .cse12 .cse16 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse17 .cse18) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse4 .cse19 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse14 .cse3 .cse7 .cse8 .cse15 .cse11 .cse12 .cse2 .cse18) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse4 .cse20 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse21) (and .cse19 .cse1 .cse10 .cse5 .cse2 .cse13 .cse3) (and .cse3 .cse8 .cse15 .cse1 .cse10 .cse22 .cse16 .cse13 .cse17) (and (and .cse4 .cse19 .cse5 .cse6 .cse14 .cse3 .cse7 .cse9 .cse11 .cse12 .cse13 .cse21) .cse23) (and .cse20 .cse24 .cse19 .cse3 .cse23 (not (= ~q_write_ev~0 0)) .cse1 .cse10 .cse25 .cse21) (not (<= 1 |old(~q_free~0)|)) (and .cse1 .cse10 .cse5 .cse13 .cse2 .cse3 .cse8) (and .cse19 .cse1 .cse5 .cse2 .cse13 .cse14 .cse3 .cse8) (and .cse24 .cse19 .cse1 .cse10 .cse5 .cse25 .cse6 .cse13 .cse3) (and .cse24 .cse1 .cse10 .cse5 .cse6 .cse25 .cse13 .cse3 .cse8) (and .cse20 .cse10 .cse5 (and .cse15 .cse19 .cse1 .cse22 .cse3 .cse8)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2019-09-08 06:35:46,785 INFO L439 ceAbstractionStarter]: At program point L405(line 405) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= 0 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse8 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (<= |old(~q_req_up~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_st~0 2) .cse7 .cse8) (= 1 |old(~c_dr_pc~0)|) (not (<= 1 |old(~q_free~0)|)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse4 .cse5 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse8) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2019-09-08 06:35:46,785 INFO L439 ceAbstractionStarter]: At program point L403(line 403) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= 0 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse8 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (<= |old(~q_req_up~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_st~0 2) .cse7 .cse8) (= 1 |old(~c_dr_pc~0)|) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse4 .cse5 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse8) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2019-09-08 06:35:46,786 INFO L446 ceAbstractionStarter]: At program point L432(lines 395 437) the Hoare annotation is: true [2019-09-08 06:35:46,786 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-09-08 06:35:46,786 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-09-08 06:35:46,786 INFO L439 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse17 (= 1 ~p_dw_pc~0)) (.cse24 (+ ~c_num_read~0 1)) (.cse7 (= ~c_dr_pc~0 1))) (let ((.cse0 (not .cse7)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse15 (<= .cse24 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse24)) (.cse14 (<= ~q_req_up~0 0)) (.cse10 (= 2 ~p_dw_st~0)) (.cse21 (= ~c_num_read~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse1 (= 0 ~q_free~0)) (.cse23 (= 1 ~p_num_write~0)) (.cse19 (not .cse17)) (.cse4 (= ~q_read_ev~0 1)) (.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse20 (= 0 ~p_dw_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 1 ~q_free~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= ~q_req_up~0 1))) (.cse22 (= ~c_dr_st~0 2))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (and .cse5 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2)) (and .cse14 .cse15 .cse16 (= ~q_write_ev~0 1) .cse7 .cse3 .cse17 .cse1 .cse10 .cse18) (not (<= |old(~q_req_up~0)| 0)) (and .cse5 .cse6 .cse7 .cse3 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse5 .cse16 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse20 .cse3 .cse8 .cse19 .cse21 .cse11 .cse12 .cse2 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse5 .cse14 .cse6 .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22) (and .cse16 .cse1 .cse10 .cse6 .cse2 .cse13 .cse3) (and .cse3 .cse19 .cse21 .cse1 .cse10 .cse23 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (and .cse14 .cse15 .cse16 .cse3 .cse17 (not (= ~q_write_ev~0 0)) .cse1 .cse10 .cse18 .cse22) (not (<= 1 |old(~q_free~0)|)) (and .cse1 .cse10 .cse6 .cse13 .cse2 .cse3 .cse19) (and .cse16 .cse1 .cse6 .cse2 .cse13 .cse20 .cse3 .cse19) (and .cse15 .cse1 .cse10 .cse6 .cse7 .cse18 .cse13 .cse3 .cse19) (and .cse14 .cse10 .cse6 (and .cse21 .cse16 .cse1 .cse23 .cse3 .cse19)) (not (= 0 |old(~p_num_write~0)|)) (and .cse4 (and (and .cse5 .cse6 .cse7 .cse20 .cse3 .cse8 .cse9 .cse11 .cse12 .cse13 .cse22) .cse17)) (not (= |old(~p_dw_st~0)| 0))))) [2019-09-08 06:35:46,787 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 395 437) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (<= |old(~q_req_up~0)| 0)) (= 1 |old(~c_dr_pc~0)|) (not (<= 1 |old(~q_free~0)|)) (and (not (= ~c_dr_pc~0 1)) (= 0 ~p_dw_st~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_num_read~0 0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-09-08 06:35:46,787 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-09-08 06:35:46,787 INFO L439 ceAbstractionStarter]: At program point L404(line 404) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (= 0 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 1 ~q_free~0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (<= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse8 (= 0 ~p_num_write~0))) (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (<= |old(~q_req_up~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_st~0 2) .cse7 .cse8) (= 1 |old(~c_dr_pc~0)|) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse4 .cse5 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse8) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2019-09-08 06:35:46,787 INFO L439 ceAbstractionStarter]: At program point L402(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (<= |old(~q_req_up~0)| 0)) (= 1 |old(~c_dr_pc~0)|) (not (<= 1 |old(~q_free~0)|)) (and (not (= ~c_dr_pc~0 1)) (= 0 ~p_dw_st~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_num_read~0 0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-09-08 06:35:46,787 INFO L439 ceAbstractionStarter]: At program point L402-1(line 402) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (<= |old(~q_req_up~0)| 0)) (= 1 |old(~c_dr_pc~0)|) (not (<= 1 |old(~q_free~0)|)) (and (not (= ~c_dr_pc~0 1)) (= 0 ~p_dw_st~0) (= ~p_last_write~0 ~q_buf_0~0) (<= 1 ~q_free~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_num_read~0 0) (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-09-08 06:35:46,788 INFO L439 ceAbstractionStarter]: At program point L423(line 423) the Hoare annotation is: (let ((.cse20 (= 1 ~p_dw_pc~0)) (.cse23 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (let ((.cse0 (not .cse6)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~c_dr_st~0 2)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse15 (= 0 ~p_dw_st~0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse13 (not (= ~q_req_up~0 1))) (.cse17 (<= ~q_req_up~0 0)) (.cse10 (= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse16 (= ~c_num_read~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse1 (= 0 ~q_free~0)) (.cse19 (= 1 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not .cse20))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3) (not (<= |old(~q_req_up~0)| 0)) (and .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse4 .cse14 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse15 .cse3 .cse7 .cse8 .cse16 .cse11 .cse12 .cse2 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse4 .cse17 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse14 .cse1 .cse10 .cse5 .cse2 .cse13 .cse3) (and .cse3 .cse8 .cse16 .cse1 .cse10 .cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (and (and .cse4 .cse14 .cse5 .cse6 .cse15 .cse3 .cse7 .cse9 .cse11 .cse12 .cse13 .cse18) .cse20) (and .cse17 .cse21 .cse14 .cse3 .cse20 (not (= ~q_write_ev~0 0)) .cse1 .cse10 .cse22 .cse18) (not (<= 1 |old(~q_free~0)|)) (and .cse1 .cse10 .cse5 .cse13 .cse2 .cse3 .cse8) (and .cse14 .cse1 .cse5 .cse2 .cse13 .cse15 .cse3 .cse8) (and .cse21 .cse14 .cse1 .cse10 .cse5 .cse22 .cse6 .cse13 .cse3) (and .cse21 .cse1 .cse10 .cse5 .cse6 .cse22 .cse13 .cse3 .cse8) (and .cse17 .cse10 .cse5 (and .cse16 .cse14 .cse1 .cse19 .cse3 .cse8)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2019-09-08 06:35:46,788 INFO L439 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse20 (= 1 ~p_dw_pc~0)) (.cse23 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (let ((.cse0 (not .cse6)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~c_dr_st~0 2)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse15 (= 0 ~p_dw_st~0)) (.cse19 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse13 (not (= ~q_req_up~0 1))) (.cse17 (<= ~q_req_up~0 0)) (.cse10 (= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse16 (= ~c_num_read~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse1 (= 0 ~q_free~0)) (.cse22 (= 1 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not .cse20))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3) (not (<= |old(~q_req_up~0)| 0)) (and .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse4 .cse14 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse15 .cse3 .cse7 .cse8 .cse16 .cse11 .cse12 .cse2 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse4 .cse17 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse14 .cse1 .cse10 .cse5 .cse2 .cse13 .cse3) (and .cse17 .cse19 .cse14 .cse3 .cse20 .cse1 .cse10 .cse21 .cse18) (and .cse3 .cse8 .cse16 .cse1 .cse10 .cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse1 .cse10 .cse5 .cse13 .cse2 .cse3 .cse8) (and .cse14 .cse1 .cse5 .cse2 .cse13 .cse15 .cse3 .cse8) (and .cse19 .cse1 .cse10 .cse5 .cse6 .cse21 .cse13 .cse3 .cse8) (and .cse17 .cse10 .cse5 (and .cse16 .cse14 .cse1 .cse22 .cse3 .cse8)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2019-09-08 06:35:46,789 INFO L439 ceAbstractionStarter]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse21 (= 1 ~p_dw_pc~0)) (.cse23 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (let ((.cse0 (not .cse6)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (<= 1 ~q_free~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~c_dr_st~0 2)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse15 (= 0 ~p_dw_st~0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse13 (not (= ~q_req_up~0 1))) (.cse17 (<= ~q_req_up~0 0)) (.cse10 (= 2 ~p_dw_st~0)) (.cse5 (<= 2 ~q_write_ev~0)) (.cse16 (= ~c_num_read~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse1 (= 0 ~q_free~0)) (.cse19 (= 1 ~p_num_write~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not .cse21))) (or (not (= ~p_dw_i~0 1)) (and .cse0 .cse1 .cse2 .cse3) (not (<= |old(~q_req_up~0)| 0)) (and .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2) (= 1 |old(~c_dr_pc~0)|) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and .cse4 .cse14 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse2 .cse13) (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (and .cse0 .cse15 .cse3 .cse7 .cse8 .cse16 .cse11 .cse12 .cse2 (= 0 ~p_num_write~0)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and .cse4 .cse17 .cse5 .cse6 .cse3 .cse7 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse14 .cse1 .cse10 .cse5 .cse2 .cse13 .cse3) (and .cse3 .cse8 .cse16 .cse1 .cse10 .cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (and .cse17 .cse20 .cse14 .cse3 .cse21 (not (= ~q_write_ev~0 0)) .cse1 .cse10 .cse22 .cse18) (not (<= 1 |old(~q_free~0)|)) (and .cse1 .cse10 .cse5 .cse13 .cse2 .cse3 .cse8) (and .cse14 .cse1 .cse5 .cse2 .cse13 .cse15 .cse3 .cse8) (and .cse20 .cse1 .cse10 .cse5 .cse6 .cse22 .cse13 .cse3 .cse8) (and .cse17 .cse10 .cse5 (and .cse16 .cse14 .cse1 .cse19 .cse3 .cse8)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0))))) [2019-09-08 06:35:46,789 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 06:35:46,789 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (<= ~q_req_up~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (not (= ~c_dr_pc~0 1)) (= 0 ~q_free~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (not (= 1 ~p_dw_i~0)) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0) (not (= 1 ~p_dw_pc~0))) [2019-09-08 06:35:46,789 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 06:35:46,789 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 06:35:46,789 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 61) no Hoare annotation was computed. [2019-09-08 06:35:46,789 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 64) no Hoare annotation was computed. [2019-09-08 06:35:46,789 INFO L443 ceAbstractionStarter]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2019-09-08 06:35:46,790 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 51 69) no Hoare annotation was computed. [2019-09-08 06:35:46,790 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 51 69) no Hoare annotation was computed. [2019-09-08 06:35:46,790 INFO L446 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 51 69) the Hoare annotation is: true [2019-09-08 06:35:46,790 INFO L439 ceAbstractionStarter]: At program point L66(lines 54 68) the Hoare annotation is: (let ((.cse17 (= 1 ~c_dr_pc~0)) (.cse26 (+ ~c_num_read~0 1))) (let ((.cse9 (not (<= .cse26 ~p_num_write~0))) (.cse10 (not (<= ~p_num_write~0 .cse26))) (.cse13 (not (= 2 ~c_dr_st~0))) (.cse3 (not (= ~q_free~0 0))) (.cse15 (not (= 1 ~p_num_write~0))) (.cse20 (not (= 0 ~p_num_write~0))) (.cse25 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse12 (not (<= ~q_req_up~0 0))) (.cse14 (not (= ~p_dw_st~0 0))) (.cse7 (= ~p_dw_pc~0 1)) (.cse16 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse22 (not .cse17)) (.cse11 (not (= ~q_read_ev~0 2))) (.cse8 (not (= ~p_dw_st~0 2))) (.cse23 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse0 (not (<= 2 ~q_write_ev~0))) (.cse18 (not (<= 1 ~q_free~0))) (.cse5 (= 1 ~q_req_up~0)) (.cse6 (= 0 ~c_dr_st~0)) (.cse19 (not (<= ~q_free~0 1))) (.cse24 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse2 .cse1 .cse10 .cse11 (not .cse7) .cse8 (= 0 ~q_write_ev~0) .cse12 .cse3 .cse13 .cse4) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse14 .cse4 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse3 .cse11 .cse15 .cse7 .cse8 .cse16 .cse12) (or .cse17 .cse1 .cse2 .cse3 .cse6 .cse4 .cse7) (or .cse4 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse8) (or .cse17 .cse1 .cse2 .cse18 .cse6 .cse14 .cse7 .cse16 .cse19 .cse20 .cse21 .cse4) (or .cse9 .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse10 .cse7 .cse8 .cse4) (or .cse17 .cse1 .cse2 .cse3 .cse6 .cse11 .cse4) (or (or .cse0 .cse23 .cse1 .cse2 .cse18 .cse22 .cse13 .cse8 .cse19 .cse24 .cse21 .cse12) (= ~q_read_ev~0 1) .cse4) (or .cse2 .cse1 .cse22 .cse8 .cse23 .cse0 .cse18 .cse5 .cse6 .cse4 .cse7 .cse19 .cse24 .cse21) (or .cse17 .cse1 .cse2 .cse3 .cse6 (not (= ~q_read_ev~0 0)) .cse4) (or .cse2 .cse1 .cse11 .cse8 .cse25 .cse4 .cse3 .cse5 .cse15 .cse7 .cse16) (or .cse2 .cse1 .cse11 .cse20 .cse25 .cse12 .cse4 .cse17 .cse18 .cse14 .cse7 .cse16 .cse19 .cse21) (or .cse2 .cse1 .cse22 .cse11 .cse8 .cse23 .cse0 .cse18 .cse5 .cse6 .cse19 .cse24 .cse4 .cse21)))) [2019-09-08 06:35:46,790 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 167) no Hoare annotation was computed. [2019-09-08 06:35:46,790 INFO L443 ceAbstractionStarter]: For program point do_read_cEXIT(lines 155 207) no Hoare annotation was computed. [2019-09-08 06:35:46,790 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 200) no Hoare annotation was computed. [2019-09-08 06:35:46,791 INFO L443 ceAbstractionStarter]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2019-09-08 06:35:46,791 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 166) no Hoare annotation was computed. [2019-09-08 06:35:46,791 INFO L439 ceAbstractionStarter]: At program point L193(line 193) the Hoare annotation is: (let ((.cse11 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse8 (not .cse12)) (.cse15 (not (<= .cse18 ~p_num_write~0))) (.cse14 (not .cse11)) (.cse16 (not (<= ~p_num_write~0 .cse18))) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse17 (= 1 |old(~q_req_up~0)|)) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= ~p_dw_st~0 2))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= |old(~q_req_up~0)| 0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse10 .cse11 (not (<= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_dw_st~0 0)) .cse12 .cse7 (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse13 .cse8 (or (or .cse0 .cse1 (or .cse14 .cse4)) .cse15 .cse2 .cse16 .cse3 .cse6)) (or .cse13 (or .cse15 (or .cse0 .cse1 .cse14 .cse12) .cse2 .cse17 .cse16 .cse3 .cse6)) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse17 .cse3 .cse5 .cse7) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse10)))) [2019-09-08 06:35:46,791 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 195) no Hoare annotation was computed. [2019-09-08 06:35:46,792 INFO L439 ceAbstractionStarter]: At program point do_read_cENTRY(lines 155 207) the Hoare annotation is: (let ((.cse17 (= ~c_dr_pc~0 1))) (let ((.cse25 (not .cse17)) (.cse20 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse26 (= ~c_num_read~0 0)) (.cse16 (= 0 ~q_free~0)) (.cse19 (not (= ~c_dr_st~0 0))) (.cse27 (+ ~c_num_read~0 1)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse28 (+ |old(~c_num_read~0)| 1)) (.cse14 (= ~p_dw_pc~0 1))) (let ((.cse9 (not .cse14)) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse22 (not (<= .cse28 ~p_num_write~0))) (.cse21 (not .cse0)) (.cse23 (not (<= ~p_num_write~0 .cse28))) (.cse15 (<= .cse27 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse27)) (.cse12 (not (<= |old(~q_req_up~0)| 0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse7 (not (= ~p_dw_st~0 2))) (.cse11 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse24 (= 1 |old(~q_req_up~0)|)) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (and .cse25 .cse20 .cse26 .cse16 .cse19))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse5 .cse7 .cse12 .cse0 .cse13 .cse3 .cse4 .cse6 .cse14 .cse8 .cse10) (or .cse13 .cse9 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (or .cse1 .cse2 (or .cse21 .cse5)) .cse22 .cse3 .cse23 .cse4 .cse7)) (or .cse13 (or .cse22 (or .cse1 .cse2 .cse21 .cse14) .cse3 .cse24 .cse23 .cse4 .cse7) (and .cse15 .cse17 .cse20 .cse16 .cse18 .cse19)) (or .cse2 .cse1 .cse5 (and .cse25 (<= 1 ~q_free~0) .cse20 .cse26 (<= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) .cse19) (not (= 0 ~p_num_write~0)) .cse11 .cse12 .cse0 (not (<= 1 |old(~q_free~0)|)) .cse4 (not (= ~p_dw_st~0 0)) .cse14 .cse8 (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse2 .cse1 .cse5 .cse7 .cse11 .cse0 .cse3 .cse24 .cse4 .cse6 .cse8 .cse10))))) [2019-09-08 06:35:46,792 INFO L443 ceAbstractionStarter]: For program point L171(lines 170 201) no Hoare annotation was computed. [2019-09-08 06:35:46,792 INFO L439 ceAbstractionStarter]: At program point L202(lines 155 207) the Hoare annotation is: (let ((.cse18 (= 1 |old(~c_dr_pc~0)|)) (.cse25 (+ |old(~c_num_read~0)| 1)) (.cse10 (= ~p_dw_pc~0 1)) (.cse12 (= ~c_dr_pc~0 1)) (.cse13 (<= 1 ~q_free~0)) (.cse14 (<= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_dr_st~0 2))) (let ((.cse5 (not (<= |old(~q_req_up~0)| 0))) (.cse3 (not (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~p_num_write~0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (and .cse12 (= ~c_num_read~0 1) .cse13 .cse14 .cse15 .cse16)) (.cse21 (not .cse10)) (.cse17 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse23 (not (<= .cse25 ~p_num_write~0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse22 (not .cse18)) (.cse7 (not (= |old(~q_free~0)| 0))) (.cse19 (= 1 |old(~q_req_up~0)|)) (.cse24 (not (<= ~p_num_write~0 .cse25))) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~p_dw_st~0 2))) (.cse20 (and (<= ~p_num_write~0 ~c_num_read~0) .cse12 .cse13 (<= ~c_num_read~0 ~p_num_write~0) .cse14 .cse15 .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse0 .cse3 (and .cse12 .cse13 (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_num_read~0 0) .cse14 .cse15 .cse16) (not (= 0 ~p_num_write~0)) .cse17 .cse5 .cse18 (not (<= 1 |old(~q_free~0)|)) .cse8 (not (= ~p_dw_st~0 0)) .cse10 .cse11 (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse17 .cse7 .cse19 .cse8 .cse9 .cse11) (or .cse20 .cse6 .cse21 (or (or .cse0 .cse1 (or .cse22 .cse3)) .cse23 .cse7 .cse24 .cse8 .cse4)) (or (or .cse0 .cse1 .cse7 .cse8 .cse3 .cse9 .cse4 .cse11) .cse2 .cse21 .cse17) (or .cse6 (or .cse23 (or .cse0 .cse1 .cse22 .cse10) .cse7 .cse19 .cse24 .cse8 .cse4) .cse20)))) [2019-09-08 06:35:46,792 INFO L439 ceAbstractionStarter]: At program point L198(line 198) the Hoare annotation is: (let ((.cse11 (= 1 |old(~c_dr_pc~0)|)) (.cse18 (+ |old(~c_num_read~0)| 1)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse8 (not .cse12)) (.cse15 (not (<= .cse18 ~p_num_write~0))) (.cse14 (not .cse11)) (.cse16 (not (<= ~p_num_write~0 .cse18))) (.cse9 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse17 (= 1 |old(~q_req_up~0)|)) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse4 (not (= ~q_read_ev~0 2))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= ~p_dw_st~0 2))) (.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= |old(~q_req_up~0)| 0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) (or .cse1 .cse0 .cse4 (not (= 0 ~p_num_write~0)) .cse9 .cse10 .cse11 (not (<= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_dw_st~0 0)) .cse12 .cse7 (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse13 .cse8 (or (or .cse0 .cse1 (or .cse14 .cse4)) .cse15 .cse2 .cse16 .cse3 .cse6)) (or .cse13 (or .cse15 (or .cse0 .cse1 .cse14 .cse12) .cse2 .cse17 .cse16 .cse3 .cse6)) (or .cse1 .cse0 .cse4 .cse6 .cse9 .cse2 .cse17 .cse3 .cse5 .cse7) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse10)))) [2019-09-08 06:35:46,793 INFO L439 ceAbstractionStarter]: At program point L198-1(lines 158 206) the Hoare annotation is: (let ((.cse10 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse11 (= ~c_num_read~0 0)) (.cse27 (+ |old(~c_num_read~0)| 1)) (.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse7 (= ~p_dw_pc~0 1)) (.cse9 (<= 1 ~q_free~0)) (.cse12 (<= ~q_free~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= ~c_dr_st~0 0)))) (let ((.cse22 (and (<= ~p_num_write~0 ~c_num_read~0) .cse9 (<= ~c_num_read~0 ~p_num_write~0) .cse12 .cse13 .cse14)) (.cse25 (not .cse7)) (.cse17 (not .cse5)) (.cse16 (not (<= .cse27 ~p_num_write~0))) (.cse20 (not (<= ~p_num_write~0 .cse27))) (.cse3 (not (= ~q_read_ev~0 ~q_write_ev~0))) (.cse19 (= 1 |old(~q_req_up~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse24 (and .cse10 .cse11 (= 0 ~q_free~0) .cse14)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse21 (not (= ~p_dw_st~0 2))) (.cse26 (and (= ~c_num_read~0 1) .cse9 .cse12 .cse13 .cse14)) (.cse4 (not (<= |old(~q_req_up~0)| 0))) (.cse15 (not (<= 2 ~q_write_ev~0))) (.cse18 (not (= |old(~q_free~0)| 0))) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse23 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= 0 ~p_num_write~0)) .cse3 .cse4 .cse5 (not (<= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_dw_st~0 0)) .cse7 .cse8 (not (<= |old(~q_free~0)| 1)) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse15 (or .cse16 (or .cse1 .cse0 .cse17 .cse7) .cse18 .cse19 .cse20 .cse6 .cse21) .cse22) (or (or .cse1 .cse0 .cse18 .cse6 .cse2 .cse23 .cse21 .cse8) .cse24 .cse25 .cse26 .cse3) (or .cse15 .cse22 .cse25 (or (or .cse1 .cse0 (or .cse17 .cse2)) .cse16 .cse18 .cse20 .cse6 .cse21)) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse26 .cse18 .cse19 .cse6 .cse24 .cse23 .cse8) (or .cse1 .cse0 .cse24 .cse2 .cse21 .cse26 .cse4 .cse15 .cse18 .cse6 .cse23 .cse7 .cse8)))) [2019-09-08 06:35:46,793 INFO L439 ceAbstractionStarter]: At program point L163(lines 158 206) the Hoare annotation is: (let ((.cse12 (= ~p_dw_pc~0 1)) (.cse24 (+ ~c_num_read~0 1)) (.cse5 (= 1 |old(~c_dr_pc~0)|)) (.cse25 (+ |old(~c_num_read~0)| 1))) (let ((.cse22 (not (<= .cse25 ~p_num_write~0))) (.cse21 (not .cse5)) (.cse7 (= 1 |old(~q_req_up~0)|)) (.cse23 (not (<= ~p_num_write~0 .cse25))) (.cse15 (<= .cse24 ~p_num_write~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse20 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse16 (= 0 ~q_free~0)) (.cse18 (<= ~p_num_write~0 .cse24)) (.cse19 (not (= ~c_dr_st~0 0))) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse11 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse8 (= 0 |old(~c_dr_st~0)|)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~p_num_write~0))) (.cse3 (not (= ~p_dw_st~0 2))) (.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not .cse12)) (.cse4 (not (= ~q_read_ev~0 ~q_write_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 (not (= 0 ~p_num_write~0)) .cse4 .cse11 .cse5 (not (<= 1 |old(~q_free~0)|)) .cse8 (not (= ~p_dw_st~0 0)) .cse12 .cse10 (not (<= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse13 .cse14 (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (or .cse1 .cse0 (or .cse21 .cse2)) .cse22 .cse6 .cse23 .cse8 .cse3)) (or .cse13 (or .cse22 (or .cse1 .cse0 .cse21 .cse12) .cse6 .cse7 .cse23 .cse8 .cse3) (and .cse15 .cse17 .cse20 .cse16 .cse18 .cse19)) (or .cse5 .cse13 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse12 .cse3 .cse10 .cse11) (or (or .cse5 .cse1 .cse0 .cse6 .cse8 .cse2 .cse9 .cse3 .cse10) .cse14 .cse4)))) [2019-09-08 06:35:46,793 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 438 454) no Hoare annotation was computed. [2019-09-08 06:35:46,793 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 438 454) no Hoare annotation was computed. [2019-09-08 06:35:46,793 INFO L439 ceAbstractionStarter]: At program point init_modelENTRY(lines 438 454) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (and (not (= ~c_dr_pc~0 1)) (= ~c_num_read~0 0) (= 0 ~q_free~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (not (= 1 ~p_dw_i~0)) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 0 ~p_num_write~0)) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (<= ~q_req_up~0 0))) [2019-09-08 06:35:46,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:35:46 BoogieIcfgContainer [2019-09-08 06:35:46,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:35:46,919 INFO L168 Benchmark]: Toolchain (without parser) took 153290.37 ms. Allocated memory was 133.7 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 88.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-08 06:35:46,920 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 06:35:46,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.27 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 87.8 MB in the beginning and 175.6 MB in the end (delta: -87.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-08 06:35:46,922 INFO L168 Benchmark]: Boogie Preprocessor took 77.12 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 173.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-08 06:35:46,922 INFO L168 Benchmark]: RCFGBuilder took 590.56 ms. Allocated memory is still 200.8 MB. Free memory was 173.4 MB in the beginning and 143.1 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2019-09-08 06:35:46,923 INFO L168 Benchmark]: TraceAbstraction took 152073.15 ms. Allocated memory was 200.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 142.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-09-08 06:35:46,926 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.49 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 545.27 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 87.8 MB in the beginning and 175.6 MB in the end (delta: -87.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.12 ms. Allocated memory is still 200.8 MB. Free memory was 175.6 MB in the beginning and 173.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 590.56 ms. Allocated memory is still 200.8 MB. Free memory was 173.4 MB in the beginning and 143.1 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 152073.15 ms. Allocated memory was 200.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 142.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == p_last_write))) && (((!(2 <= q_write_ev) || !(p_dw_pc == 1)) || (((((c_num_read + 1 <= p_num_write && 0 == q_free) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && q_req_up == \old(q_req_up))) || ((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(c_num_read) + 1 <= p_num_write)) || !(\old(q_free) == 0)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && ((!(2 <= q_write_ev) || (((((!(\old(c_num_read) + 1 <= p_num_write) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((c_num_read + 1 <= p_num_write && c_dr_pc == 1) && q_req_up == \old(q_req_up)) && 0 == q_free) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)))) && (((((((((((1 == \old(c_dr_pc) || !(2 <= q_write_ev)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(\old(q_req_up) <= 0))) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || !(\old(p_dw_pc) == 1)) || ((((((((1 == p_dw_i && !(c_dr_pc == 1)) && 0 == q_free) && !(c_dr_st == 0)) && \old(p_dw_pc) == 1) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || \old(p_dw_st) == 0) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write)) || 1 == c_dr_pc) || !(1 <= \old(q_free))) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(\old(q_free) <= 1)) || !(c_last_read == \old(p_last_write)))) && ((((0 == c_dr_st || ((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0)) || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || \old(p_dw_pc) == 1) || !(\old(q_free) <= 1)) || !(0 == c_num_read)) || !(0 == \old(p_num_write)))) && ((((((((((\old(p_dw_st) == 0 || ((((p_num_write == \old(p_num_write) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st)) || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1)) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || ((0 == q_free && p_num_write == \old(p_num_write)) && p_last_write == q_buf_0)) || ((((((((1 == p_dw_i && !(c_dr_pc == 1)) && 0 == q_free) && !(c_dr_st == 0)) && \old(p_dw_pc) == 1) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((!(2 <= q_write_ev) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && \old(p_dw_pc) == p_dw_pc)) || !(\old(p_dw_pc) == 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (!(c_num_read <= \old(p_num_write)) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= c_num_read))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == c_dr_pc)) || !(\old(q_free) <= 1)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read)) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write)) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || c_dr_st == 2) && (((((((((((((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && !(c_dr_st == 0)) || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((!(p_dw_i == 1) || (((((((((!(c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || (((((((((!(c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_req_up) <= 0)) || (((((((p_last_write == q_buf_0 && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write) && !(tmp___1 == 0)) && c_dr_st == 2)) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || ((((((((((c_dr_pc == 1 && p_last_write == q_buf_0) && c_num_read == 1) && 1 == p_dw_pc) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) && !(tmp___1 == 0)) && c_dr_st == 2)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || (((((((!(c_dr_pc == 1) && tmp___1 == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && q_read_ev == 2) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || ((((((((((tmp___1 == 1 && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(p_dw_st) == 0))) && ((((((((((((((((((((((c_dr_pc == 1 && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((((((!(c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || !(\old(q_req_up) <= 0)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && q_read_ev == 2) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(2 <= q_write_ev)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(tmp___1 == 0)) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) || ((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && \old(p_dw_pc) == p_dw_pc)) || (((((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || c_dr_st == 2) || !(\old(p_dw_st) == 2)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && \old(p_dw_pc) == p_dw_pc) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || c_dr_st == 2)) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((((1 == p_dw_i && !(c_dr_pc == 1)) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 0)) || c_dr_st == 2) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || c_dr_st == 2) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((c_dr_st == 2 || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || (((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc))) && (((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || (((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || !(\old(p_dw_st) == 2))) && (((((((((((((!(2 <= q_write_ev) || !(\old(c_num_read) <= \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_req_up) <= 0)) || !(\old(p_dw_pc) == 1)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) && 1 == p_dw_pc))) && ((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || c_dr_st == 2) || !(\old(p_dw_st) == 2))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((c_dr_pc == 1 && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc)) || !(q_read_ev == 2)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && q_read_ev == 2) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((!(c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((1 == p_dw_i && !(c_dr_pc == 1)) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || (((((((((!(c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || !(q_read_ev == 2)) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || !(2 <= q_write_ev)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((!(\old(p_dw_pc) == 1) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((c_num_read + 1 <= p_num_write && c_dr_pc == 1) && p_last_write == q_buf_0) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && !(tmp___1 == 0)) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) && 1 == p_dw_pc))) && ((((((((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || !(\old(q_req_up) <= 0)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || __retres1 == 0) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2)) && (((((((((((!(c_num_read + 1 <= p_num_write) || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(p_num_write <= c_num_read + 1)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || 0 == q_write_ev) || !(q_req_up <= 0)) || !(q_free == 0)) || !(2 == c_dr_st)) || __retres1 == 0)) && (((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || __retres1 == 0) || p_dw_pc == 1)) && ((((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || __retres1 == 0) || !(q_free == 0)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || !(q_req_up <= 0))) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || __retres1 == 0) || p_dw_pc == 1)) && ((((((((__retres1 == 0 || !(2 <= q_write_ev)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 2))) && (((((((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 <= q_free)) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || !(q_free <= 1)) || !(0 == p_num_write)) || !(c_last_read == p_last_write)) || __retres1 == 0)) && ((((((((((!(c_num_read + 1 <= p_num_write) || !(2 <= q_write_ev)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || !(p_num_write <= c_num_read + 1)) || p_dw_pc == 1) || !(p_dw_st == 2)) || __retres1 == 0)) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || !(q_read_ev == 2)) || __retres1 == 0)) && (((((((((((((!(2 <= q_write_ev) || !(c_num_read <= p_num_write)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 <= q_free)) || !(1 == c_dr_pc)) || !(2 == c_dr_st)) || !(p_dw_st == 2)) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write)) || !(q_req_up <= 0)) || q_read_ev == 1) || __retres1 == 0)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(p_dw_st == 2)) || !(c_num_read <= p_num_write)) || !(2 <= q_write_ev)) || !(1 <= q_free)) || 1 == q_req_up) || 0 == c_dr_st) || __retres1 == 0) || p_dw_pc == 1) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write))) && ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || !(q_read_ev == 0)) || __retres1 == 0)) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || __retres1 == 0) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(q_req_up <= 0)) || __retres1 == 0) || 1 == c_dr_pc) || !(1 <= q_free)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || !(q_free <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(c_num_read <= p_num_write)) || !(2 <= q_write_ev)) || !(1 <= q_free)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || __retres1 == 0) || !(c_last_read == p_last_write)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || (((((c_dr_pc == 1 && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(\old(q_req_up) <= 0)) || !(2 <= q_write_ev)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || ((((((c_dr_pc == 1 && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == p_last_write))) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || (((((c_dr_pc == 1 && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && (((((((((p_num_write <= c_num_read && c_dr_pc == 1) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) || ((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(c_num_read) + 1 <= p_num_write)) || !(\old(q_free) == 0)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || (((((c_dr_pc == 1 && c_num_read == 1) && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2)) || !(p_dw_pc == 1)) || !(q_read_ev == q_write_ev))) && ((!(2 <= q_write_ev) || (((((!(\old(c_num_read) + 1 <= p_num_write) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || ((((((p_num_write <= c_num_read && c_dr_pc == 1) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2)) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(p_dw_i == 1) || (((!(c_dr_pc == 1) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_req_up) <= 0)) || (((((((((((p_num_write <= c_num_read && 2 <= q_write_ev) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && !(1 == p_dw_pc)) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1)) && !(c_dr_st == 0))) || 1 == \old(c_dr_pc)) || (((((((((((!(c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && q_write_ev == \old(q_write_ev)) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || (((((((((((p_num_write <= c_num_read && q_read_ev == 2) && 2 <= q_write_ev) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && !(q_req_up == 1))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || (((((((((!(c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && !(1 == p_dw_pc)) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && 0 == p_num_write)) || !(\old(q_read_ev) == \old(q_write_ev))) || ((((((((((p_num_write <= c_num_read && q_req_up <= 0) && 2 <= q_write_ev) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2)) || ((((((q_read_ev == 2 && 0 == q_free) && 2 == p_dw_st) && 2 <= q_write_ev) && !(c_dr_st == 0)) && !(q_req_up == 1)) && p_last_write == q_buf_0)) || ((((((((p_last_write == q_buf_0 && !(1 == p_dw_pc)) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write) && \old(q_read_ev) == q_read_ev) && !(q_req_up == 1)) && q_write_ev == \old(q_write_ev))) || ((((((((((((p_num_write <= c_num_read && q_read_ev == 2) && 2 <= q_write_ev) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(q_req_up == 1)) && c_dr_st == 2) && 1 == p_dw_pc)) || (((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 0)) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && c_dr_st == 2)) || !(1 <= \old(q_free))) || ((((((0 == q_free && 2 == p_dw_st) && 2 <= q_write_ev) && !(q_req_up == 1)) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(1 == p_dw_pc))) || (((((((q_read_ev == 2 && 0 == q_free) && 2 <= q_write_ev) && !(c_dr_st == 0)) && !(q_req_up == 1)) && 0 == p_dw_st) && p_last_write == q_buf_0) && !(1 == p_dw_pc))) || ((((((((c_num_read + 1 <= p_num_write && q_read_ev == 2) && 0 == q_free) && 2 == p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && !(q_req_up == 1)) && p_last_write == q_buf_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) && !(q_req_up == 1)) && p_last_write == q_buf_0) && !(1 == p_dw_pc))) || (((q_req_up <= 0 && 2 == p_dw_st) && 2 <= q_write_ev) && ((((c_num_read == 0 && q_read_ev == 2) && 0 == q_free) && 1 == p_num_write) && p_last_write == q_buf_0) && !(1 == p_dw_pc))) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((\old(p_dw_st) == 0 || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || \old(p_dw_pc) == 1) && ((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || \old(p_dw_pc) == 1) || !(\old(q_free) <= 1)) || !(0 == c_num_read)) || ((\old(p_dw_pc) == p_dw_pc && p_last_write == q_buf_0) && 0 == p_num_write)) || !(0 == \old(p_num_write)))) && (((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || ((((0 == q_free && p_num_write == \old(p_num_write)) && \old(p_dw_pc) == 1) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == c_dr_pc)) || !(\old(q_free) <= 1)) || !(q_read_ev == 2)) || ((((p_last_write == q_buf_0 && q_req_up == \old(q_req_up)) && !(0 == p_dw_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || \old(p_dw_st) == 0) || !(2 == c_dr_st)) || !(0 == c_num_read))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || ((((p_last_write == q_buf_0 && q_req_up == \old(q_req_up)) && !(0 == p_dw_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || !(1 <= \old(q_free))) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(\old(q_free) <= 1)) || !(c_last_read == \old(p_last_write)))) && (((!(2 <= q_write_ev) || !(\old(p_dw_pc) == 1)) || (((p_num_write == \old(p_num_write) && \old(p_dw_pc) == p_dw_pc && p_last_write == q_buf_0) && !(0 == p_dw_st)) && q_req_up == \old(q_req_up))) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (!(c_num_read <= \old(p_num_write)) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= c_num_read)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || c_dr_st == 2) && (((((((((((((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && !(c_dr_st == 0)) || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || (((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && ((!(\old(p_dw_pc) == 1) || (((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(p_dw_st) == 0)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || (((((((c_num_read + 1 <= p_num_write && c_dr_pc == 1) && p_last_write == q_buf_0) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc))) && ((((((((((((((((((((((c_dr_pc == 1 && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((((((!(c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 2)) || !(\old(q_req_up) <= 0)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && q_read_ev == 2) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(2 <= q_write_ev)) || !(\old(q_free) == 0)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(q_read_ev == 2)) || c_dr_st == 2) || !(\old(p_dw_st) == 2)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && \old(p_dw_pc) == p_dw_pc) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || ((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc))) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || c_dr_st == 2)) && (((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || ((((1 == p_dw_i && !(c_dr_pc == 1)) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 0)) || c_dr_st == 2) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_st) == 2)) || c_dr_st == 2) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 <= q_write_ev)) || !(1 <= \old(q_free))) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || \old(p_dw_pc) == 1) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((c_dr_st == 2 || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && (((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || \old(p_dw_pc) == 1) || !(\old(p_dw_st) == 2)) || (((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc))) && (((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || (((((((p_num_write == \old(p_num_write) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || !(\old(p_dw_st) == 2))) && ((((((((!(2 <= q_write_ev) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || 1 == \old(q_req_up)) || !(q_read_ev == 2)) || c_dr_st == 2) || !(\old(p_dw_st) == 2))) && ((((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((!(c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(q_read_ev == 2)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && q_read_ev == 2) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || (((((((((c_dr_pc == 1 && p_last_write == q_buf_0) && c_num_read == 1) && 1 == p_dw_pc) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) && c_dr_st == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || ((((((p_last_write == q_buf_0 && 1 == p_dw_pc) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write) && c_dr_st == 2)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((c_dr_pc == 1 && p_last_write == q_buf_0) && c_num_read == 1) && 1 <= q_free) && 2 == p_dw_st) && q_free <= 1) && 1 == p_num_write) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc)) || !(q_read_ev == 2)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && q_read_ev == 2) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(p_dw_st) == 2)) || !(q_read_ev == q_write_ev)) || 1 == \old(c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || (((((((!(c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && c_num_read == 0) && 0 == q_free) && 2 == p_dw_st) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || !(1 == \old(p_num_write))) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(0 == \old(p_num_write))) || ((((1 == p_dw_i && !(c_dr_pc == 1)) && 0 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || (((((((((!(c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || !(q_read_ev == 2)) || (c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1)) || !(2 <= q_write_ev)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1)) && ((((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) || ((((((((((q_req_up <= 0 && c_num_read + 1 <= p_num_write) && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && \old(p_dw_pc) == p_dw_pc)) || (((((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2))) && ((((((((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || !(q_read_ev == 2)) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 2)) || 0 == q_write_ev) || !(\old(q_req_up) <= 0)) || (((((((((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && 2 == p_dw_st) && p_num_write <= c_num_read + 1) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st)))) && ((((((((((((!(2 <= q_write_ev) || !(\old(c_num_read) <= \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == \old(c_dr_pc))) || !(2 == \old(c_dr_st))) || !(\old(p_dw_st) == 2)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_req_up) <= 0)) || (((((((((((p_num_write <= c_num_read && p_num_write == \old(p_num_write)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 <= q_free) && q_req_up == \old(q_req_up)) && c_num_read <= p_num_write) && 2 == p_dw_st) && q_free <= 1) && c_last_read == p_last_write) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc)) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || (((0 == q_free && p_num_write == \old(p_num_write)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || 0 == c_dr_st) || \old(p_dw_pc) == 1) && ((((((((((((((!(p_dw_i == 1) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || !(1 <= \old(q_free))) || (((((((p_last_write == q_buf_0 && 1 <= q_free) && q_req_up == \old(q_req_up)) && !(0 == p_dw_st)) && q_free <= 1) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(\old(q_free) <= 1)) || ((((p_last_write == q_buf_0 && 0 == q_free) && !(0 == p_dw_st)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && ((((((((((\old(p_dw_st) == 0 || !(2 <= q_write_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == c_dr_st) || !(q_read_ev == 2)) || (((((p_num_write == \old(p_num_write) && p_last_write == q_buf_0) && q_req_up == \old(q_req_up)) && 0 == q_free) && !(0 == p_dw_st)) && \old(p_dw_pc) == p_dw_pc)) || \old(p_dw_pc) == 1)) && (((((0 == c_dr_st || ((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || \old(p_dw_pc) == 1) || !(\old(q_free) <= 1)) || !(0 == c_num_read)) || ((((p_last_write == q_buf_0 && 1 <= q_free) && q_free <= 1) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || (((0 == q_free && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == c_dr_st) || !(\old(p_dw_pc) == 1)) || ((((0 == q_free && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == c_dr_pc)) || !(\old(q_free) <= 1)) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || \old(p_dw_st) == 0) || ((((((p_last_write == q_buf_0 && 1 <= q_free) && q_req_up == \old(q_req_up)) && !(0 == p_dw_st)) && q_free <= 1) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(2 == c_dr_st)) || ((((p_last_write == q_buf_0 && 0 == q_free) && !(0 == p_dw_st)) && 1 == p_num_write) && \old(p_dw_pc) == p_dw_pc)) || !(0 == c_num_read))) && (((((((((((((1 == p_num_write || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(q_read_ev == 2)) || !(0 == \old(p_num_write))) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || !(1 <= \old(q_free))) || 0 == c_dr_st) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(\old(q_free) <= 1)) || c_last_read == p_last_write) || !(c_last_read == \old(p_last_write)))) && (((!(2 <= q_write_ev) || (((((p_last_write == q_buf_0 && \old(p_num_write) + 1 <= p_num_write) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && \old(p_dw_pc) == p_dw_pc)) || !(\old(p_dw_pc) == 1)) || (\old(p_dw_st) == 0 || !(2 == c_dr_st)) || (!(c_num_read <= \old(p_num_write)) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 <= \old(q_free))) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(\old(q_free) <= 1)) || !(\old(p_num_write) <= c_num_read)) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 1 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 <= q_free)) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || !(q_free <= 1)) || !(0 == p_num_write)) || !(c_last_read == p_last_write)) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(c_dr_st == 0)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || 1 == c_dr_pc) || !(q_free == 0)) || __retres1 == 1) || !(1 == p_num_write)) || !(0 == c_num_read))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(q_req_up <= 0)) || !(1 <= q_free)) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || !(q_free <= 1)) || !(c_last_read == p_last_write)) || __retres1 == 1)) && (((q_req_up <= 0 && !(c_dr_st == 0)) || (((((((((!(c_num_read + 1 <= p_num_write) || !(2 <= q_write_ev)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || 1 == q_req_up) || !(p_num_write <= c_num_read + 1)) || !(q_read_ev == 2)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || __retres1 == 1)) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(q_req_up <= 0)) || 1 == c_dr_pc) || !(1 <= q_free)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || !(q_free <= 1)) || !(c_last_read == p_last_write)) || __retres1 == 1)) && (__retres1 == 1 || !(p_dw_pc == 1) || (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 2)) || !(c_num_read <= p_num_write)) || !(2 <= q_write_ev)) || !(1 <= q_free)) || !(2 == c_dr_st)) || 1 == q_req_up) || !(p_dw_st == 0)) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write))) && (((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || __retres1 == 1) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_read_ev == 2)) || !(p_dw_st == 0)) || p_dw_pc == 1)) && ((((((1 == c_dr_pc || __retres1 == 1) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == c_dr_st) || !(p_dw_st == 0)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(\old(q_req_up) <= 0)) || 1 == \old(c_dr_pc)) || !(1 <= \old(q_free))) || 0 == \old(c_dr_st)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(\old(q_free) <= 1)) || (((((1 <= q_free && q_req_up == \old(q_req_up)) && c_num_read == 0) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(\old(c_last_read) == p_last_write)) && ((!(2 <= q_write_ev) || (((((!(\old(c_num_read) + 1 <= p_num_write) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || p_dw_pc == 1) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(p_dw_st == 2)) || (((((p_num_write <= c_num_read && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0)))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || !(p_dw_st == 2)) || !(0 == \old(c_num_read))) || (((q_req_up == \old(q_req_up) && c_num_read == 0) && 0 == q_free) && !(c_dr_st == 0))) || !(p_dw_pc == 1)) || ((((c_num_read == 1 && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(q_read_ev == q_write_ev))) && (((!(2 <= q_write_ev) || (((((p_num_write <= c_num_read && 1 <= q_free) && c_num_read <= p_num_write) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(p_dw_pc == 1)) || ((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc)) || !(q_read_ev == 2)) || !(\old(c_num_read) + 1 <= p_num_write)) || !(\old(q_free) == 0)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(p_dw_st == 2))) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || ((((c_num_read == 1 && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || 1 == \old(q_req_up)) || 0 == \old(c_dr_st)) || (((q_req_up == \old(q_req_up) && c_num_read == 0) && 0 == q_free) && !(c_dr_st == 0))) || !(1 == p_num_write)) || !(0 == \old(c_num_read)))) && ((((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || (((q_req_up == \old(q_req_up) && c_num_read == 0) && 0 == q_free) && !(c_dr_st == 0))) || !(q_read_ev == 2)) || !(p_dw_st == 2)) || ((((c_num_read == 1 && 1 <= q_free) && q_free <= 1) && c_last_read == p_last_write) && !(c_dr_st == 0))) || !(\old(q_req_up) <= 0)) || !(2 <= q_write_ev)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((0 == __retres1 || (!(2 <= q_write_ev) || !(p_dw_st == 2) || (((((((!(c_num_read <= p_num_write) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 <= q_free)) || !(2 == c_dr_st)) || !(1 == c_dr_pc)) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write)) || !(q_req_up <= 0)) && ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_req_up <= 0)) || !(c_num_read <= p_num_write)) || !(2 <= q_write_ev)) || !(1 <= q_free)) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write)) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || 0 == __retres1)) && ((((((((((!(c_num_read + 1 <= p_num_write) || !(2 <= q_write_ev)) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || !(p_num_write <= c_num_read + 1)) || !(1 == c_dr_pc)) || 0 == __retres1) || p_dw_pc == 1) || !(p_dw_st == 2))) && ((0 == __retres1 || !(q_read_ev == 1)) || (!(2 <= q_write_ev) || 1 == q_req_up) || ((((((((!(c_num_read <= p_num_write) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 <= q_free)) || 0 == c_dr_st) || !(1 == c_dr_pc)) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write)) || !(p_dw_st == 2))) && ((((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || !(q_read_ev == 2)) || !(1 == p_num_write)) || p_dw_pc == 1) || !(p_dw_st == 2)) || !(0 == c_num_read)) || 0 == __retres1) || !(q_req_up <= 0))) && ((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 2)) || !(1 == c_dr_pc) || !(q_read_ev == 2))) && (((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(q_free == 0)) || 1 == q_req_up) || 0 == __retres1) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(1 == c_dr_pc) || !(q_read_ev == 2))) && ((((((((((((!(c_num_read + 1 <= p_num_write) || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(p_num_write <= c_num_read + 1)) || !(p_dw_pc == 1)) || !(p_dw_st == 2)) || 0 == q_write_ev) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || !(q_req_up <= 0)) || !(q_free == 0)) || !(2 == c_dr_st)) || q_write_ev == 1) || 0 == __retres1)) && (((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_free == 0)) || 0 == __retres1) || 0 == c_dr_st) || 1 == c_dr_pc)) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || 0 == __retres1) || !(p_dw_st == 2)) || !(q_read_ev == q_write_ev)) || !(q_free == 0)) || 1 == q_req_up) || !(1 == p_num_write)) || p_dw_pc == 1) || !(0 == c_num_read))) && ((((((((!(2 <= q_write_ev) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || !(q_free == 0)) || 1 == q_req_up) || 0 == c_dr_st) || p_dw_pc == 1) || !(p_dw_st == 2))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || 0 == __retres1) || !(q_read_ev == 2)) || !(0 == p_num_write)) || !(q_read_ev == q_write_ev)) || !(q_req_up <= 0)) || 1 == c_dr_pc) || !(1 <= q_free)) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || !(q_free <= 1)) || !(c_last_read == p_last_write))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 <= q_free)) || 0 == c_dr_st) || !(p_dw_st == 0)) || p_dw_pc == 1) || !(0 == c_num_read)) || 1 == c_dr_pc) || !(q_free <= 1)) || !(0 == p_num_write)) || 0 == __retres1) || !(c_last_read == p_last_write))) && (((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(p_dw_st == 2)) || !(c_num_read <= p_num_write)) || !(2 <= q_write_ev)) || !(1 <= q_free)) || 1 == q_req_up) || 0 == __retres1) || 0 == c_dr_st) || p_dw_pc == 1) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write))) && ((((((((((((0 == __retres1 || !(p_dw_i == 1)) || !(q_buf_0 == p_last_write)) || !(p_dw_st == 2)) || !(1 == c_dr_pc) || !(q_read_ev == 2)) || !(c_num_read <= p_num_write)) || !(2 <= q_write_ev)) || !(1 <= q_free)) || 1 == q_req_up) || 0 == c_dr_st) || !(q_free <= 1)) || !(p_num_write <= c_num_read)) || !(c_last_read == p_last_write)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 139 locations, 1 error locations. SAFE Result, 151.8s OverallTime, 20 OverallIterations, 8 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 113.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 4060 SDtfs, 7628 SDslu, 6070 SDs, 0 SdLazy, 9332 SolverSat, 2767 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1716 GetRequests, 1534 SyntacticMatches, 9 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25958occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 11071 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 56 LocationsWithAnnotation, 44878 PreInvPairs, 52308 NumberOfFragments, 25465 HoareAnnotationTreeSize, 44878 FomulaSimplifications, 354163 FormulaSimplificationTreeSizeReduction, 13.9s HoareSimplificationTime, 56 FomulaSimplificationsInter, 365147 FormulaSimplificationTreeSizeReductionInter, 98.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3923 NumberOfCodeBlocks, 3923 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3896 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060083 SizeOfPredicates, 11 NumberOfNonLiveVariables, 6930 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 2345/2425 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...