/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:34:55,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:34:55,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:34:55,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:34:55,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:34:55,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:34:55,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:34:55,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:34:55,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:34:55,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:34:55,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:34:55,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:34:55,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:34:55,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:34:55,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:34:55,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:34:55,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:34:55,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:34:55,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:34:55,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:34:55,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:34:55,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:34:55,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:34:55,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:34:55,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:34:55,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:34:55,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:34:55,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:34:55,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:34:55,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:34:55,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:34:56,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:34:56,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:34:56,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:34:56,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:34:56,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:34:56,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:34:56,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:34:56,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:34:56,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:34:56,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:34:56,013 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 [2020-07-07 11:34:56,031 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:34:56,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:34:56,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:34:56,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:34:56,033 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:34:56,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:34:56,033 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:34:56,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:34:56,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:34:56,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:34:56,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:34:56,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:34:56,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:34:56,036 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:34:56,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:34:56,036 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:34:56,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:34:56,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:34:56,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:34:56,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:34:56,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:34:56,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:34:56,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:34:56,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:34:56,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:34:56,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:34:56,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:34:56,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:34:56,039 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:34:56,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:34:56,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:34:56,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:34:56,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:34:56,311 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:34:56,311 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:34:56,312 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-07 11:34:56,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65daa97c3/bbb9c6c871ce4e1d960c6118d0baafa2/FLAG34ce8476f [2020-07-07 11:34:56,831 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:34:56,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-07 11:34:56,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65daa97c3/bbb9c6c871ce4e1d960c6118d0baafa2/FLAG34ce8476f [2020-07-07 11:34:57,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65daa97c3/bbb9c6c871ce4e1d960c6118d0baafa2 [2020-07-07 11:34:57,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:34:57,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:34:57,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:34:57,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:34:57,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:34:57,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbda745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57, skipping insertion in model container [2020-07-07 11:34:57,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:34:57,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:34:57,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:34:57,428 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:34:57,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:34:57,478 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:34:57,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57 WrapperNode [2020-07-07 11:34:57,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:34:57,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:34:57,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:34:57,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:34:57,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... [2020-07-07 11:34:57,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:34:57,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:34:57,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:34:57,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:34:57,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:34:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:34:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:34:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-07 11:34:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-07 11:34:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-07 11:34:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-07 11:34:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-07 11:34:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-07 11:34:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-07 11:34:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-07 11:34:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-07 11:34:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-07 11:34:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-07 11:34:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-07 11:34:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:34:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:34:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:34:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-07 11:34:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-07 11:34:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-07 11:34:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-07 11:34:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-07 11:34:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-07 11:34:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-07 11:34:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-07 11:34:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-07 11:34:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-07 11:34:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-07 11:34:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-07 11:34:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:34:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:34:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:34:58,055 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:34:58,055 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-07 11:34:58,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:34:58 BoogieIcfgContainer [2020-07-07 11:34:58,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:34:58,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:34:58,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:34:58,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:34:58,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:34:57" (1/3) ... [2020-07-07 11:34:58,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bb673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:34:58, skipping insertion in model container [2020-07-07 11:34:58,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:34:57" (2/3) ... [2020-07-07 11:34:58,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bb673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:34:58, skipping insertion in model container [2020-07-07 11:34:58,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:34:58" (3/3) ... [2020-07-07 11:34:58,074 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-07 11:34:58,083 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:34:58,091 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:34:58,104 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:34:58,128 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:34:58,128 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:34:58,128 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:34:58,128 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:34:58,129 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:34:58,129 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:34:58,129 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:34:58,129 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:34:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-07 11:34:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-07 11:34:58,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:34:58,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:34:58,161 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:34:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:34:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-07 11:34:58,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:34:58,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016498344] [2020-07-07 11:34:58,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:34:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:34:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:34:58,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016498344] [2020-07-07 11:34:58,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:34:58,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:34:58,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550778826] [2020-07-07 11:34:58,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:34:58,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:34:58,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:34:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:34:58,715 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2020-07-07 11:34:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:34:59,775 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2020-07-07 11:34:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:34:59,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-07-07 11:34:59,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:34:59,795 INFO L225 Difference]: With dead ends: 356 [2020-07-07 11:34:59,795 INFO L226 Difference]: Without dead ends: 248 [2020-07-07 11:34:59,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:34:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-07-07 11:34:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2020-07-07 11:34:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-07-07 11:34:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2020-07-07 11:34:59,902 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2020-07-07 11:34:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:34:59,903 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2020-07-07 11:34:59,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:34:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2020-07-07 11:34:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 11:34:59,908 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:34:59,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:34:59,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:34:59,909 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:34:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:34:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2020-07-07 11:34:59,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:34:59,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046938129] [2020-07-07 11:34:59,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:34:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:00,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046938129] [2020-07-07 11:35:00,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:00,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 11:35:00,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308271582] [2020-07-07 11:35:00,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 11:35:00,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 11:35:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:35:00,103 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2020-07-07 11:35:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:00,682 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2020-07-07 11:35:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:35:00,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2020-07-07 11:35:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:00,686 INFO L225 Difference]: With dead ends: 406 [2020-07-07 11:35:00,686 INFO L226 Difference]: Without dead ends: 238 [2020-07-07 11:35:00,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:35:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-07 11:35:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2020-07-07 11:35:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-07 11:35:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2020-07-07 11:35:00,728 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2020-07-07 11:35:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:00,729 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2020-07-07 11:35:00,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 11:35:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2020-07-07 11:35:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-07 11:35:00,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:00,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:00,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:35:00,733 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2020-07-07 11:35:00,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:00,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946086056] [2020-07-07 11:35:00,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:01,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946086056] [2020-07-07 11:35:01,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:01,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:35:01,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345168453] [2020-07-07 11:35:01,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:35:01,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:35:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:01,023 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2020-07-07 11:35:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:02,218 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2020-07-07 11:35:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 11:35:02,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-07-07 11:35:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:02,227 INFO L225 Difference]: With dead ends: 582 [2020-07-07 11:35:02,227 INFO L226 Difference]: Without dead ends: 417 [2020-07-07 11:35:02,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-07-07 11:35:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-07-07 11:35:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2020-07-07 11:35:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-07-07 11:35:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2020-07-07 11:35:02,323 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2020-07-07 11:35:02,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:02,327 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2020-07-07 11:35:02,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:35:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2020-07-07 11:35:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-07 11:35:02,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:02,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:02,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:35:02,333 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2020-07-07 11:35:02,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:02,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299425640] [2020-07-07 11:35:02,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:02,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299425640] [2020-07-07 11:35:02,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:02,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 11:35:02,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722023424] [2020-07-07 11:35:02,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 11:35:02,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 11:35:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-07 11:35:02,562 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2020-07-07 11:35:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:05,249 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2020-07-07 11:35:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-07 11:35:05,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-07-07 11:35:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:05,256 INFO L225 Difference]: With dead ends: 873 [2020-07-07 11:35:05,256 INFO L226 Difference]: Without dead ends: 554 [2020-07-07 11:35:05,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2020-07-07 11:35:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-07-07 11:35:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2020-07-07 11:35:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-07 11:35:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2020-07-07 11:35:05,303 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2020-07-07 11:35:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:05,304 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2020-07-07 11:35:05,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 11:35:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2020-07-07 11:35:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 11:35:05,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:05,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:05,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:35:05,306 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:05,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-07 11:35:05,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:05,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75809918] [2020-07-07 11:35:05,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:05,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75809918] [2020-07-07 11:35:05,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:05,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 11:35:05,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283927603] [2020-07-07 11:35:05,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:35:05,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:05,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:35:05,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:35:05,494 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2020-07-07 11:35:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:06,549 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2020-07-07 11:35:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:35:06,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2020-07-07 11:35:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:06,560 INFO L225 Difference]: With dead ends: 612 [2020-07-07 11:35:06,561 INFO L226 Difference]: Without dead ends: 418 [2020-07-07 11:35:06,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:35:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-07-07 11:35:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2020-07-07 11:35:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-07 11:35:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2020-07-07 11:35:06,615 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2020-07-07 11:35:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:06,616 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2020-07-07 11:35:06,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:35:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2020-07-07 11:35:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 11:35:06,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:06,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:06,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:35:06,618 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2020-07-07 11:35:06,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:06,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598358267] [2020-07-07 11:35:06,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:06,776 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598358267] [2020-07-07 11:35:06,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:06,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:35:06,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602559201] [2020-07-07 11:35:06,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:35:06,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:06,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:35:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:06,778 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2020-07-07 11:35:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:07,599 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2020-07-07 11:35:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 11:35:07,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-07 11:35:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:07,603 INFO L225 Difference]: With dead ends: 727 [2020-07-07 11:35:07,603 INFO L226 Difference]: Without dead ends: 421 [2020-07-07 11:35:07,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:35:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-07-07 11:35:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2020-07-07 11:35:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-07-07 11:35:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2020-07-07 11:35:07,640 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2020-07-07 11:35:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:07,641 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2020-07-07 11:35:07,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:35:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2020-07-07 11:35:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 11:35:07,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:07,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:07,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:35:07,665 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2020-07-07 11:35:07,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:07,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869491401] [2020-07-07 11:35:07,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:07,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869491401] [2020-07-07 11:35:07,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:07,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:35:07,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644822904] [2020-07-07 11:35:07,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:35:07,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:07,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:35:07,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:07,865 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2020-07-07 11:35:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:10,574 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2020-07-07 11:35:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-07 11:35:10,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-07 11:35:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:10,585 INFO L225 Difference]: With dead ends: 1164 [2020-07-07 11:35:10,585 INFO L226 Difference]: Without dead ends: 840 [2020-07-07 11:35:10,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2020-07-07 11:35:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-07-07 11:35:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2020-07-07 11:35:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-07-07 11:35:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2020-07-07 11:35:10,722 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2020-07-07 11:35:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:10,723 INFO L479 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2020-07-07 11:35:10,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:35:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2020-07-07 11:35:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 11:35:10,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:10,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:10,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:35:10,729 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2020-07-07 11:35:10,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:10,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138417747] [2020-07-07 11:35:10,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:10,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138417747] [2020-07-07 11:35:10,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:10,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:35:10,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755217277] [2020-07-07 11:35:10,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:35:10,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:35:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:10,955 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2020-07-07 11:35:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:11,751 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2020-07-07 11:35:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:35:11,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-07-07 11:35:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:11,757 INFO L225 Difference]: With dead ends: 1352 [2020-07-07 11:35:11,757 INFO L226 Difference]: Without dead ends: 764 [2020-07-07 11:35:11,760 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:35:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-07-07 11:35:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2020-07-07 11:35:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-07-07 11:35:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2020-07-07 11:35:11,829 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2020-07-07 11:35:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:11,829 INFO L479 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2020-07-07 11:35:11,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:35:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2020-07-07 11:35:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 11:35:11,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:11,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:11,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 11:35:11,833 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2020-07-07 11:35:11,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:11,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622721592] [2020-07-07 11:35:11,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:12,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622721592] [2020-07-07 11:35:12,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:12,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:35:12,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462716572] [2020-07-07 11:35:12,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:35:12,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:35:12,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:35:12,011 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 6 states. [2020-07-07 11:35:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:12,829 INFO L93 Difference]: Finished difference Result 1262 states and 1648 transitions. [2020-07-07 11:35:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:35:12,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-07 11:35:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:12,838 INFO L225 Difference]: With dead ends: 1262 [2020-07-07 11:35:12,838 INFO L226 Difference]: Without dead ends: 814 [2020-07-07 11:35:12,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:35:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2020-07-07 11:35:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 708. [2020-07-07 11:35:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-07-07 11:35:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 908 transitions. [2020-07-07 11:35:12,959 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 908 transitions. Word has length 66 [2020-07-07 11:35:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:12,960 INFO L479 AbstractCegarLoop]: Abstraction has 708 states and 908 transitions. [2020-07-07 11:35:12,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:35:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 908 transitions. [2020-07-07 11:35:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-07 11:35:12,962 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:12,963 INFO L422 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] [2020-07-07 11:35:12,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 11:35:12,963 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1757954899, now seen corresponding path program 1 times [2020-07-07 11:35:12,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:12,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251198453] [2020-07-07 11:35:12,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 11:35:13,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251198453] [2020-07-07 11:35:13,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324533913] [2020-07-07 11:35:13,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:13,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:35:13,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:13,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:35:13,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-07-07 11:35:13,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281285510] [2020-07-07 11:35:13,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:35:13,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:13,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:35:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:13,449 INFO L87 Difference]: Start difference. First operand 708 states and 908 transitions. Second operand 3 states. [2020-07-07 11:35:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:13,609 INFO L93 Difference]: Finished difference Result 1674 states and 2250 transitions. [2020-07-07 11:35:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:35:13,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-07 11:35:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:13,617 INFO L225 Difference]: With dead ends: 1674 [2020-07-07 11:35:13,617 INFO L226 Difference]: Without dead ends: 812 [2020-07-07 11:35:13,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-07-07 11:35:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-07-07 11:35:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-07-07 11:35:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1048 transitions. [2020-07-07 11:35:13,757 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1048 transitions. Word has length 86 [2020-07-07 11:35:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:13,759 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 1048 transitions. [2020-07-07 11:35:13,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:35:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1048 transitions. [2020-07-07 11:35:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-07 11:35:13,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:13,764 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-07 11:35:13,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-07 11:35:13,979 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash -232030383, now seen corresponding path program 1 times [2020-07-07 11:35:13,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:13,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782423067] [2020-07-07 11:35:13,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 11:35:14,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782423067] [2020-07-07 11:35:14,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:14,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 11:35:14,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132867096] [2020-07-07 11:35:14,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:35:14,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:14,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:35:14,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:35:14,237 INFO L87 Difference]: Start difference. First operand 812 states and 1048 transitions. Second operand 8 states. [2020-07-07 11:35:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:15,108 INFO L93 Difference]: Finished difference Result 962 states and 1270 transitions. [2020-07-07 11:35:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:35:15,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-07-07 11:35:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:15,117 INFO L225 Difference]: With dead ends: 962 [2020-07-07 11:35:15,117 INFO L226 Difference]: Without dead ends: 959 [2020-07-07 11:35:15,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:35:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-07-07 11:35:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 820. [2020-07-07 11:35:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-07-07 11:35:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1043 transitions. [2020-07-07 11:35:15,233 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1043 transitions. Word has length 98 [2020-07-07 11:35:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:15,233 INFO L479 AbstractCegarLoop]: Abstraction has 820 states and 1043 transitions. [2020-07-07 11:35:15,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:35:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1043 transitions. [2020-07-07 11:35:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-07 11:35:15,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:15,237 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-07 11:35:15,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 11:35:15,237 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-07-07 11:35:15,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:15,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453660041] [2020-07-07 11:35:15,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 11:35:15,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453660041] [2020-07-07 11:35:15,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661870477] [2020-07-07 11:35:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:15,656 INFO L264 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-07 11:35:15,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:35:15,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:35:15,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-07 11:35:15,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083431507] [2020-07-07 11:35:15,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 11:35:15,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:15,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 11:35:15,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-07-07 11:35:15,787 INFO L87 Difference]: Start difference. First operand 820 states and 1043 transitions. Second operand 16 states. [2020-07-07 11:35:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:20,064 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2020-07-07 11:35:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-07 11:35:20,066 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-07-07 11:35:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:20,091 INFO L225 Difference]: With dead ends: 2540 [2020-07-07 11:35:20,091 INFO L226 Difference]: Without dead ends: 2537 [2020-07-07 11:35:20,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2020-07-07 11:35:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2020-07-07 11:35:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2020-07-07 11:35:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-07-07 11:35:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2020-07-07 11:35:20,550 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2020-07-07 11:35:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:20,551 INFO L479 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2020-07-07 11:35:20,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 11:35:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2020-07-07 11:35:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-07 11:35:20,561 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:20,562 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:20,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-07 11:35:20,777 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-07-07 11:35:20,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:20,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309379335] [2020-07-07 11:35:20,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-07-07 11:35:21,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309379335] [2020-07-07 11:35:21,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:35:21,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 11:35:21,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714560139] [2020-07-07 11:35:21,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 11:35:21,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 11:35:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:35:21,096 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2020-07-07 11:35:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:22,112 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2020-07-07 11:35:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:35:22,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2020-07-07 11:35:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:22,127 INFO L225 Difference]: With dead ends: 3773 [2020-07-07 11:35:22,128 INFO L226 Difference]: Without dead ends: 2107 [2020-07-07 11:35:22,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:35:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-07-07 11:35:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2020-07-07 11:35:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2020-07-07 11:35:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2020-07-07 11:35:22,404 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2020-07-07 11:35:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:22,405 INFO L479 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2020-07-07 11:35:22,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 11:35:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2020-07-07 11:35:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-07 11:35:22,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:35:22,414 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:35:22,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 11:35:22,414 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:35:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:35:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2020-07-07 11:35:22,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:35:22,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106230557] [2020-07-07 11:35:22,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:35:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-07-07 11:35:22,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106230557] [2020-07-07 11:35:22,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714345154] [2020-07-07 11:35:22,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:35:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:35:22,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-07 11:35:22,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:35:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-07 11:35:22,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-07 11:35:22,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-07-07 11:35:22,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286978834] [2020-07-07 11:35:22,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:35:22,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:35:22,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:35:22,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:35:22,850 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2020-07-07 11:35:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:35:22,938 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2020-07-07 11:35:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:35:22,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-07 11:35:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:35:22,940 INFO L225 Difference]: With dead ends: 2401 [2020-07-07 11:35:22,940 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 11:35:22,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:35:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 11:35:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 11:35:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 11:35:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 11:35:22,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-07 11:35:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:35:22,954 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 11:35:22,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:35:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 11:35:22,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 11:35:23,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-07 11:35:23,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 11:35:24,177 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2020-07-07 11:35:30,608 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-07 11:35:31,719 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-07 11:35:32,917 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-07 11:35:33,274 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2020-07-07 11:35:33,390 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-07-07 11:35:34,129 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 83 [2020-07-07 11:35:34,396 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-07 11:35:35,387 WARN L193 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 77 [2020-07-07 11:35:36,103 WARN L193 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2020-07-07 11:35:36,693 WARN L193 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2020-07-07 11:35:36,970 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 36 [2020-07-07 11:35:38,086 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2020-07-07 11:35:38,216 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-07-07 11:35:38,359 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-07-07 11:35:41,278 WARN L193 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 214 DAG size of output: 150 [2020-07-07 11:35:41,449 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-07-07 11:35:41,978 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2020-07-07 11:35:42,523 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-07-07 11:35:42,812 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-07 11:35:43,081 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-07 11:35:46,092 WARN L193 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 227 DAG size of output: 153 [2020-07-07 11:35:48,527 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 178 DAG size of output: 127 [2020-07-07 11:35:50,008 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 179 DAG size of output: 116 [2020-07-07 11:35:50,850 WARN L193 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 89 [2020-07-07 11:35:51,019 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-07-07 11:35:52,070 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 181 DAG size of output: 100 [2020-07-07 11:35:55,023 WARN L193 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 214 DAG size of output: 150 [2020-07-07 11:35:55,285 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 1 [2020-07-07 11:35:55,668 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-07-07 11:35:55,883 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-07-07 11:35:56,477 WARN L193 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-07-07 11:35:56,674 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-07-07 11:35:57,126 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 53 [2020-07-07 11:35:59,342 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 214 DAG size of output: 130 [2020-07-07 11:36:00,055 WARN L193 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2020-07-07 11:36:01,336 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 200 DAG size of output: 90 [2020-07-07 11:36:01,341 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-07 11:36:01,341 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-07 11:36:01,342 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-07 11:36:01,342 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-07 11:36:01,342 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-07-07 11:36:01,342 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-07 11:36:01,343 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-07 11:36:01,343 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-07 11:36:01,343 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 ~p_dw_i~0)) (= ~c_dr_pc~0 1) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-07 11:36:01,343 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-07 11:36:01,343 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and (<= ~p_dw_pc~0 0) (not (= ~c_dr_pc~0 1)) (= 1 ~p_dw_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~q_free~0)) (not (= 0 |old(~c_num_read~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-07 11:36:01,344 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-07 11:36:01,344 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-07 11:36:01,344 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-07 11:36:01,344 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-07 11:36:01,344 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-07 11:36:01,345 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse12 (= ~c_dr_pc~0 1))) (let ((.cse2 (not .cse12)) (.cse19 (= 1 ~p_dw_i~0)) (.cse4 (= 0 ~q_free~0)) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~p_dw_st~0))) (let ((.cse14 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (and .cse4 .cse6 (= 1 ~p_num_write~0) .cse7 .cse8)) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse13 (not (<= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse11 (and (<= 2 ~c_dr_st~0) (not (= 1 ~p_dw_st~0)) .cse2 .cse6 .cse19 (not (= ~p_dw_pc~0 ~q_free~0)) (not (= ~p_dw_st~0 ~q_free~0)))) (.cse3 (let ((.cse18 (not .cse19))) (and (or .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse18)))) (.cse9 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse3 (let ((.cse5 (+ |old(~p_num_write~0)| 1))) (and .cse4 (<= ~p_num_write~0 .cse5) .cse6 (<= .cse5 ~p_num_write~0) .cse7 .cse8)) .cse9) (or .cse10 .cse11 .cse3 .cse12 .cse9 .cse13) (or .cse14 .cse0 .cse10 .cse15 .cse3 .cse16 .cse17 .cse9 .cse13) (or .cse14 .cse0 .cse10 .cse15 .cse3 .cse16 .cse17 .cse12 .cse13) (or .cse1 .cse11 .cse3 .cse12 .cse9))))) [2020-07-07 11:36:01,346 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse21 (= 1 ~p_dw_i~0)) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse8 (= |old(~q_free~0)| ~q_free~0))) (let ((.cse3 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse22 (or (and .cse2 .cse5 .cse21 .cse6 .cse7 (not (= 0 ~q_free~0)) (not (= ~p_dw_pc~0 ~q_free~0)) .cse8) (and .cse2 (<= 1 ~q_free~0) .cse5 .cse21 .cse6 .cse7 .cse8))) (.cse4 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse9 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not (= 0 |old(~p_num_write~0)|))) (.cse17 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse18 (and .cse22 .cse4 (= ~c_last_read~0 ~p_last_write~0) .cse9)) (.cse12 (and .cse3 .cse22 .cse4 .cse9)) (.cse15 (not (= 1 |old(~q_free~0)|))) (.cse10 (let ((.cse20 (not .cse21))) (and (or .cse20 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse20)))) (.cse13 (= ~c_dr_pc~0 1)) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) .cse10 .cse11) (or .cse12 .cse1 .cse10 .cse13 .cse11) (or .cse14 .cse0 .cse15 .cse16 .cse10 .cse17 .cse18 .cse11 .cse19) (or .cse14 .cse0 .cse15 .cse16 .cse10 .cse17 .cse13 .cse18 .cse19) (or .cse12 .cse15 .cse10 .cse13 .cse11 .cse19))))) [2020-07-07 11:36:01,346 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse9 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse15 (= 0 ~q_free~0)) (.cse10 (<= ~p_dw_pc~0 0)) (.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (= 1 ~p_dw_pc~0)) (.cse7 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (let ((.cse17 (not (= 1 ~p_dw_i~0)))) (and (or .cse17 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse17)))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (= ~c_dr_pc~0 1)) (.cse6 (and .cse9 .cse15 .cse10 .cse11 (= 1 ~p_num_write~0) .cse16)) (.cse8 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11) .cse2 .cse4 .cse12 .cse7 .cse8) (or .cse13 (and (<= 2 ~c_dr_st~0) .cse14) .cse4 .cse12 .cse7) (or .cse1 .cse13 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse12) .cse4 (and .cse9 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse14 .cse11 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse16) .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse8)))) [2020-07-07 11:36:01,346 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-07 11:36:01,346 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-07 11:36:01,347 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-07 11:36:01,347 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse19 (= 1 ~p_dw_i~0))) (let ((.cse16 (not (= 1 |old(~p_dw_pc~0)|))) (.cse18 (= 1 ~p_dw_pc~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse9 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse10 (= 0 ~p_num_write~0)) (.cse12 (= |old(~q_free~0)| ~q_free~0)) (.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse4 (let ((.cse21 (not .cse19))) (and (or .cse21 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse21)))) (.cse17 (= ~c_dr_pc~0 1)) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse15 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse20 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or .cse16 .cse4 .cse17 .cse14 (and (<= 2 ~c_dr_st~0) .cse18 .cse19 .cse20)) (or .cse1 .cse16 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse17) .cse4 .cse14 (and .cse6 (<= ~p_num_write~0 ~c_num_read~0) (<= ~c_num_read~0 ~p_num_write~0) .cse7 .cse18 .cse19 .cse8 .cse20 .cse11 .cse12 .cse13)) (or .cse0 .cse1 .cse2 (and .cse6 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) .cse3 .cse4 .cse5 .cse17 .cse15) (or .cse2 .cse4 .cse17 .cse14 .cse15 (and .cse6 (<= ~p_dw_pc~0 0) .cse19 .cse8 .cse20))))) [2020-07-07 11:36:01,347 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse15 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse6 (= 1 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse8 (and .cse13 (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse19 .cse15 (= ~c_last_read~0 ~p_last_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_free~0)| ~q_free~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse5 (= 0 ~q_free~0)) (.cse14 (<= ~p_dw_pc~0 0)) (.cse16 (= 1 ~p_num_write~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse3 (let ((.cse18 (not .cse19))) (and (or .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|) (= 0 |old(~q_free~0)|)) (or (not (<= 1 |old(~q_free~0)|)) .cse18)))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse17 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (not .cse2) .cse3 .cse4 (and .cse5 .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse7)) (or .cse8 .cse9 .cse0 .cse10 .cse11 .cse3 .cse12 .cse2 (and .cse13 .cse5 .cse14 .cse15 .cse16 .cse7) .cse17) (or (and .cse13 .cse14 .cse15) .cse10 .cse3 .cse2 .cse4 .cse17) (or .cse1 (and (<= 2 ~c_dr_st~0) .cse6) .cse3 .cse2 .cse4) (or .cse8 .cse9 .cse0 .cse10 (and .cse5 .cse14 .cse16 .cse7) .cse11 .cse3 .cse12 .cse4 .cse17)))) [2020-07-07 11:36:01,348 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-07 11:36:01,348 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-07 11:36:01,348 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-07 11:36:01,348 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-07 11:36:01,348 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-07 11:36:01,348 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 1 ~q_free~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (<= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= 1 ~p_num_write~0))) (.cse12 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse0 .cse4 .cse3 .cse5 .cse8) (or .cse9 .cse10 .cse1 .cse4 .cse3 .cse5 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse1 (not (<= ~p_num_write~0 .cse13)) .cse4 .cse5 .cse8 .cse12 (not (<= .cse13 ~p_num_write~0)))) (or .cse9 .cse4 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 (not (= 1 ~c_num_read~0)) .cse7) (or .cse9 .cse10 .cse1 .cse4 .cse5 .cse8 .cse11 .cse12))) [2020-07-07 11:36:01,349 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-07 11:36:01,349 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-07 11:36:01,349 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-07 11:36:01,349 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-07 11:36:01,349 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-07 11:36:01,349 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse3 (= ~c_dr_pc~0 1)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 1 ~q_free~0))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (not (<= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= 1 ~p_num_write~0))) (.cse12 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7) (or .cse0 .cse4 .cse3 .cse5 .cse8) (or .cse9 .cse10 .cse1 .cse4 .cse3 .cse5 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse1 (not (<= ~p_num_write~0 .cse13)) .cse4 .cse5 .cse8 .cse12 (not (<= .cse13 ~p_num_write~0)))) (or .cse9 .cse4 .cse3 .cse5 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 (not (= 1 ~c_num_read~0)) .cse7) (or .cse9 .cse10 .cse1 .cse4 .cse5 .cse8 .cse11 .cse12))) [2020-07-07 11:36:01,350 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse16 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse17 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse4 (= 0 ~p_dw_st~0))) (let ((.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 1 ~q_free~0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (and (<= 2 ~c_dr_st~0) (or (and .cse16 .cse17) .cse4))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (<= ~p_dw_pc~0 0))) (.cse12 (not (= 0 ~c_num_read~0))) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse13 (not (= 0 ~q_free~0))) (.cse7 (and .cse16 (< 0 (+ immediate_notify_threads_~tmp~0 1)) .cse17 (<= immediate_notify_threads_~tmp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 ~c_num_read~0)) .cse8) (or .cse0 .cse1 .cse2 (not .cse9) .cse3 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse7 .cse8) (or .cse10 .cse3 .cse9 .cse11 .cse7) (or .cse10 .cse12 .cse1 .cse3 .cse11 .cse6 .cse13 .cse7) (let ((.cse15 (+ ~c_num_read~0 1))) (or .cse14 .cse0 .cse1 (not (<= ~p_num_write~0 .cse15)) .cse3 .cse11 .cse13 (not (<= .cse15 ~p_num_write~0)))) (or .cse14 .cse0 .cse3 .cse9 .cse11) (or .cse10 .cse12 .cse1 .cse3 .cse9 .cse6 .cse13 .cse7)))) [2020-07-07 11:36:01,350 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-07 11:36:01,350 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:36:01,350 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_free~0 |old(~q_free~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_dr_i~0 |old(~c_dr_i~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2020-07-07 11:36:01,351 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:36:01,351 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse40 (<= 1 ~q_free~0)) (.cse9 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse39 (= 1 ~p_dw_i~0)) (.cse41 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse42 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse28 (or (and .cse9 .cse40 .cse39) (and .cse9 .cse39 .cse41 .cse42))) (.cse34 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse36 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse37 (not (<= 1 |old(~q_free~0)|))) (.cse35 (not .cse39)) (.cse26 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse12 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse13 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse14 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse15 (= ~a_t~0 |old(~a_t~0)|)) (.cse16 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse17 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse18 (= 0 ~p_dw_st~0)) (.cse19 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse27 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (and (or (and .cse26 .cse9 .cse10 .cse39 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27) (and .cse26 .cse9 .cse10 .cse39 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse41 .cse27 .cse42)) .cse20)) (.cse4 (let ((.cse38 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse34 .cse38 .cse35 .cse36) (or .cse38 .cse37 .cse35)))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0))) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (= 0 |old(~q_free~0)|))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse30 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse23 (not (<= 2 |old(~p_dw_st~0)|))) (.cse25 (and (or .cse34 .cse35 .cse36) (or .cse37 .cse35))) (.cse29 (and .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse1 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 1 ~q_free~0)) .cse3 .cse4 .cse5 .cse21) (or .cse6 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse24 .cse25 .cse8 (and .cse26 .cse11 .cse12 (= 1 ~p_num_write~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (or .cse0 .cse22 (= 1 |old(~p_dw_st~0)|) .cse25 .cse29 .cse3) (or .cse30 .cse6 .cse22 .cse2 .cse3 .cse4 .cse31) (or .cse0 .cse6 .cse1 .cse7 .cse8 .cse2 .cse4 .cse5 .cse21) (let ((.cse32 (+ |old(~c_num_read~0)| 1))) (or .cse6 .cse22 .cse23 .cse24 (not (<= |old(~p_num_write~0)| .cse32)) .cse25 (not (<= .cse32 |old(~p_num_write~0)|)) (let ((.cse33 (+ ~c_num_read~0 1))) (and .cse26 (<= ~p_num_write~0 .cse33) .cse11 .cse12 .cse13 .cse14 (<= .cse33 ~p_num_write~0) .cse15 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28)) (not .cse0))) (or .cse30 .cse6 .cse22 .cse23 .cse25 .cse29 .cse3 .cse31))))) [2020-07-07 11:36:01,352 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse41 (= 1 ~p_dw_i~0))) (let ((.cse9 (= 1 |old(~c_dr_pc~0)|)) (.cse34 (+ |old(~c_num_read~0)| 1)) (.cse35 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse37 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse38 (not (<= 1 |old(~q_free~0)|))) (.cse36 (not .cse41)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse17 (or (and .cse41 (not (= ~p_dw_pc~0 ~q_free~0)) (not (= 0 ~q_free~0))) (and (<= 1 ~q_free~0) .cse41))) (.cse19 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse12 .cse39 .cse14 .cse17 .cse19)) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (<= ~p_dw_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~c_num_read~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse29 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse23 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse24 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse20 (= 1 ~q_free~0)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse27 (let ((.cse40 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse35 .cse40 .cse36 .cse37) (or .cse40 .cse38 .cse36)))) (.cse26 (not (<= |old(~p_dw_pc~0)| 0))) (.cse33 (and .cse12 (not .cse14) .cse39 .cse17)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_dw_pc~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse32 (= 1 |old(~p_dw_st~0)|)) (.cse5 (not (<= |old(~p_num_write~0)| .cse34))) (.cse6 (and (or .cse35 .cse36 .cse37) (or .cse38 .cse36))) (.cse7 (not (<= .cse34 |old(~p_num_write~0)|))) (.cse30 (not (<= 2 |old(~c_dr_st~0)|))) (.cse8 (not .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21 (and .cse22 .cse15 .cse23 .cse16 .cse24 .cse18 .cse19 .cse20 .cse25) .cse26 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse2 .cse30 .cse8 .cse27 .cse31) (or .cse0 .cse1 .cse2 (not (= 1 |old(~p_num_write~0)|)) .cse3 .cse4 .cse6 .cse21) (or .cse0 .cse1 .cse10 .cse11 .cse21 (and .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse18 .cse20 .cse19) .cse30 .cse8 .cse26 .cse27 .cse28) (or .cse29 .cse1 .cse2 .cse4 .cse32 .cse6 .cse30 .cse8 .cse31) (or .cse9 .cse33 .cse10 (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse12 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse22 .cse23 .cse24 .cse20 .cse25) .cse30 .cse27 .cse26) (or .cse9 .cse33 .cse2 .cse32 .cse6 .cse30) (or .cse1 .cse2 .cse4 .cse3 .cse32 .cse5 .cse6 .cse7 .cse30 .cse8))))) [2020-07-07 11:36:01,352 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-07 11:36:01,352 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-07 11:36:01,352 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-07 11:36:01,353 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse62 (<= 1 ~q_free~0)) (.cse57 (= 1 ~p_dw_i~0)) (.cse64 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse65 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse49 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse50 (= |old(~q_free~0)| ~q_free~0)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse38 (= 0 ~q_free~0)) (.cse55 (or (and .cse62 .cse57) (and .cse57 .cse64 .cse65))) (.cse41 (<= 2 ~p_dw_st~0)) (.cse59 (<= ~c_num_read~0 ~p_num_write~0)) (.cse60 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse33 (= ~c_dr_pc~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse51 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse53 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse54 (not (<= 1 |old(~q_free~0)|))) (.cse52 (not .cse57)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse63 (= 0 ~p_dw_st~0))) (or (and .cse62 .cse57 .cse63) (and .cse57 .cse63 .cse64 .cse65)))) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse34 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse29 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse36 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse61 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse51 .cse61 .cse52 .cse53) (or .cse61 .cse54 .cse52)))) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse23 (and .cse59 .cse60 .cse32 .cse5 .cse39 .cse33 .cse37)) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse26 (and .cse59 .cse60 .cse32 .cse39 .cse55 .cse33 .cse37 .cse41)) (.cse27 (let ((.cse58 (+ ~c_num_read~0 1))) (and .cse38 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse39 .cse55 .cse33 .cse37 .cse41))) (.cse40 (= 1 ~p_num_write~0)) (.cse21 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse43 (not (<= 2 |old(~p_dw_st~0)|))) (.cse42 (not (= 0 |old(~q_free~0)|))) (.cse44 (not (<= |old(~p_num_write~0)| .cse56))) (.cse48 (and .cse2 .cse49 .cse4 .cse39 .cse57 .cse6 .cse7 .cse37 .cse32 .cse8 .cse33 .cse10 .cse11 .cse13 .cse50 .cse15)) (.cse46 (not (<= .cse56 |old(~p_num_write~0)|))) (.cse24 (not .cse0)) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse47 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse32 (not (= 1 ~p_dw_st~0)) (not .cse33) .cse39 .cse55)) (.cse45 (and (or .cse51 .cse52 .cse53) (or .cse54 .cse52))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 .cse23 .cse17 .cse24 .cse18 .cse25 .cse26 .cse27) (or .cse21 .cse23 .cse28 .cse19 .cse26 .cse29 .cse1 .cse30 .cse17 .cse24 .cse18 .cse27 .cse31) (or .cse0 .cse21 .cse23 .cse28 .cse26 .cse19 .cse29 .cse1 (and .cse32 .cse3 .cse33 .cse5 .cse34 .cse35 .cse36 .cse14 .cse37) (and .cse38 .cse39 .cse34 .cse40 .cse37 .cse41) .cse30 .cse18 .cse27 .cse31) (or .cse21 .cse23 .cse22 .cse42 .cse43 .cse44 .cse45 .cse46 .cse24 .cse26 .cse27) (or .cse20 .cse21 .cse22 .cse43 .cse47 .cse48 .cse45 .cse17 .cse24 .cse25) (or .cse21 .cse23 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse42 .cse43 .cse45 .cse30 .cse26 .cse27 (and .cse49 .cse6 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse50 .cse15)) (or .cse21 .cse22 .cse43 .cse42 .cse47 .cse44 .cse48 .cse45 .cse46 .cse17 .cse24) (or .cse0 .cse22 .cse47 .cse16 .cse45 .cse17))))) [2020-07-07 11:36:01,353 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse35 (= 1 ~p_dw_i~0))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse28 (+ |old(~c_num_read~0)| 1)) (.cse29 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse31 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse32 (not (<= 1 |old(~q_free~0)|))) (.cse30 (not .cse35)) (.cse26 (= 0 ~q_free~0)) (.cse18 (= 1 ~p_dw_pc~0)) (.cse21 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (<= 2 ~p_dw_st~0))) (let ((.cse1 (not (= 1 |old(~q_free~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (= 0 |old(~c_num_read~0)|))) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse20 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse4 (not (<= |old(~p_dw_pc~0)| 0))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse12 (let ((.cse34 (+ ~c_num_read~0 1))) (and .cse26 (<= .cse34 ~p_num_write~0) (<= ~p_num_write~0 .cse34) .cse18 .cse35 (= ~c_dr_pc~0 1) .cse21 .cse23))) (.cse3 (let ((.cse33 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse29 .cse33 .cse30 .cse31) (or .cse33 .cse32 .cse30)))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= 1 |old(~p_dw_pc~0)|))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 0 |old(~q_free~0)|))) (.cse14 (= 1 |old(~p_dw_st~0)|)) (.cse9 (not (<= |old(~p_num_write~0)| .cse28))) (.cse10 (and (or .cse29 .cse30 .cse31) (or .cse32 .cse30))) (.cse11 (not (<= .cse28 |old(~p_num_write~0)|))) (.cse2 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (not .cse0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse6 .cse14 .cse10 .cse2) (or .cse5 .cse1 .cse15 .cse16 .cse12 .cse2 .cse3 .cse4 .cse17) (or .cse5 .cse6 (not (= 1 |old(~p_num_write~0)|)) .cse7 .cse8 (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) .cse18 .cse19 .cse20 .cse21 (= |old(~q_free~0)| ~q_free~0) .cse22 .cse23) .cse10 .cse16 .cse12) (or .cse24 .cse5 .cse6 .cse7 .cse14 .cse10 .cse2 .cse13 .cse25) (let ((.cse27 (= 0 ~c_num_read~0))) (or .cse0 .cse5 .cse1 .cse15 (and .cse26 .cse18 .cse27 (= 1 ~p_num_write~0) .cse21 .cse23) .cse16 .cse12 (and .cse19 .cse27 .cse20 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0) .cse21 (= 1 ~q_free~0) .cse22) .cse4 .cse3 .cse17)) (or .cse24 .cse5 .cse6 .cse12 .cse2 .cse3 .cse25) (or .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse2 .cse13))))) [2020-07-07 11:36:01,353 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-07 11:36:01,354 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-07 11:36:01,354 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-07 11:36:01,354 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse61 (<= 1 ~q_free~0)) (.cse60 (= 1 ~p_dw_i~0)) (.cse63 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse64 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse45 (= 0 ~q_free~0)) (.cse54 (or (and .cse61 .cse60) (and .cse60 .cse63 .cse64))) (.cse47 (<= 2 ~p_dw_st~0)) (.cse56 (<= ~c_num_read~0 ~p_num_write~0)) (.cse57 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse58 (+ |old(~c_num_read~0)| 1)) (.cse50 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse52 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse53 (not (<= 1 |old(~q_free~0)|))) (.cse51 (not .cse60)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse62 (= 0 ~p_dw_st~0))) (or (and .cse61 .cse60 .cse62) (and .cse60 .cse62 .cse63 .cse64)))) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse41 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse42 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse48 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse46 (= 1 ~p_dw_pc~0)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse44 (= ~p_last_write~0 ~q_buf_0~0)) (.cse39 (<= 2 ~c_dr_st~0)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse40 (= ~c_dr_pc~0 1)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse49 (= |old(~q_free~0)| ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse29 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse31 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse35 (and .cse2 .cse48 .cse4 .cse46 .cse60 .cse6 .cse7 .cse44 .cse39 .cse8 .cse10 .cse40 .cse11 .cse13 .cse49 .cse15)) (.cse21 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse23 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse41 .cse12 .cse42 .cse13 .cse43 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse59 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse50 .cse59 .cse51 .cse52) (or .cse59 .cse53 .cse51)))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse37 (not (<= |old(~p_num_write~0)| .cse58))) (.cse38 (not (<= .cse58 |old(~p_num_write~0)|))) (.cse26 (not .cse0)) (.cse20 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse24 (and .cse56 .cse57 .cse39 .cse46 .cse5 .cse40 .cse44)) (.cse36 (not (= 0 |old(~q_free~0)|))) (.cse32 (not (<= 2 |old(~p_dw_st~0)|))) (.cse25 (not (= 0 |old(~c_num_read~0)|))) (.cse22 (and .cse56 .cse57 .cse39 .cse46 .cse54 .cse40 .cse44 .cse47)) (.cse27 (let ((.cse55 (+ ~c_num_read~0 1))) (and .cse45 (<= .cse55 ~p_num_write~0) (<= ~p_num_write~0 .cse55) .cse46 .cse54 .cse40 .cse44 .cse47))) (.cse30 (not (= 1 |old(~p_dw_pc~0)|))) (.cse33 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse39 (not (= 1 ~p_dw_st~0)) (not .cse40) .cse46 .cse54)) (.cse34 (and (or .cse50 .cse51 .cse52) (or .cse53 .cse51))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse19 .cse22 .cse23 .cse1 .cse24 .cse25 .cse17 .cse26 .cse18 .cse27 .cse28) (or .cse29 .cse20 .cse30 .cse24 .cse17 .cse26 .cse18 .cse31 .cse22 .cse27) (or .cse29 .cse20 .cse30 .cse32 .cse33 .cse34 .cse17 .cse26 .cse31 .cse35) (or .cse20 .cse30 .cse32 .cse36 .cse33 .cse37 .cse34 .cse38 .cse17 .cse26 .cse35) (or .cse0 .cse20 .cse21 .cse22 .cse19 .cse23 .cse1 (and .cse39 .cse3 .cse40 .cse5 .cse41 .cse42 .cse43 .cse14 .cse44) .cse24 (and .cse45 .cse46 .cse41 (= 1 ~p_num_write~0) .cse44 .cse47) .cse25 .cse18 .cse27 .cse28) (or .cse20 .cse30 .cse24 .cse36 .cse32 .cse37 .cse34 .cse38 .cse26 .cse22 .cse27) (or .cse20 .cse30 (not (= 1 |old(~p_num_write~0)|)) .cse24 .cse36 .cse32 .cse34 .cse25 (and .cse2 .cse48 .cse4 .cse46 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse49 .cse15) .cse22 .cse27) (or .cse0 .cse30 .cse33 .cse16 .cse34 .cse17))))) [2020-07-07 11:36:01,354 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-07 11:36:01,355 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse62 (<= 1 ~q_free~0)) (.cse57 (= 1 ~p_dw_i~0)) (.cse64 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse65 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse49 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse4 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse50 (= |old(~q_free~0)| ~q_free~0)) (.cse56 (+ |old(~c_num_read~0)| 1)) (.cse38 (= 0 ~q_free~0)) (.cse55 (or (and .cse62 .cse57) (and .cse57 .cse64 .cse65))) (.cse41 (<= 2 ~p_dw_st~0)) (.cse59 (<= ~c_num_read~0 ~p_num_write~0)) (.cse60 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= 2 ~c_dr_st~0)) (.cse39 (= 1 ~p_dw_pc~0)) (.cse33 (= ~c_dr_pc~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse51 (= |old(~p_dw_st~0)| |old(~q_free~0)|)) (.cse53 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse54 (not (<= 1 |old(~q_free~0)|))) (.cse52 (not .cse57)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse5 (let ((.cse63 (= 0 ~p_dw_st~0))) (or (and .cse62 .cse57 .cse63) (and .cse57 .cse63 .cse64 .cse65)))) (.cse7 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse34 (= 0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse36 (= 0 ~p_num_write~0)) (.cse14 (= 1 ~q_free~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse29 (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse35 .cse13 .cse36 .cse14 .cse15)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse18 (let ((.cse61 (not (= 0 |old(~p_dw_st~0)|)))) (and (or .cse51 .cse61 .cse52 .cse53) (or .cse61 .cse54 .cse52)))) (.cse31 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse25 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse23 (and .cse59 .cse60 .cse32 .cse5 .cse39 .cse33 .cse37)) (.cse30 (not (= 0 |old(~c_num_read~0)|))) (.cse26 (and .cse59 .cse60 .cse32 .cse39 .cse55 .cse33 .cse37 .cse41)) (.cse27 (let ((.cse58 (+ ~c_num_read~0 1))) (and .cse38 (<= .cse58 ~p_num_write~0) (<= ~p_num_write~0 .cse58) .cse39 .cse55 .cse33 .cse37 .cse41))) (.cse40 (= 1 ~p_num_write~0)) (.cse21 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse43 (not (<= 2 |old(~p_dw_st~0)|))) (.cse42 (not (= 0 |old(~q_free~0)|))) (.cse44 (not (<= |old(~p_num_write~0)| .cse56))) (.cse48 (and .cse2 .cse49 .cse4 .cse39 .cse57 .cse6 .cse7 .cse37 .cse32 .cse8 .cse33 .cse10 .cse11 .cse13 .cse50 .cse15)) (.cse46 (not (<= .cse56 |old(~p_num_write~0)|))) (.cse24 (not .cse0)) (.cse22 (not (= 1 |old(~p_dw_pc~0)|))) (.cse47 (= 1 |old(~p_dw_st~0)|)) (.cse16 (and .cse32 (not (= 1 ~p_dw_st~0)) (not .cse33) .cse39 .cse55)) (.cse45 (and (or .cse51 .cse52 .cse53) (or .cse54 .cse52))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 .cse22 .cse23 .cse17 .cse24 .cse18 .cse25 .cse26 .cse27) (or .cse21 .cse23 .cse28 .cse19 .cse26 .cse29 .cse1 .cse30 .cse17 .cse24 .cse18 .cse27 .cse31) (or .cse0 .cse21 .cse23 .cse28 .cse26 .cse19 .cse29 .cse1 (and .cse32 .cse3 .cse33 .cse5 .cse34 .cse35 .cse36 .cse14 .cse37) (and .cse38 .cse39 .cse34 .cse40 .cse37 .cse41) .cse30 .cse18 .cse27 .cse31) (or .cse21 .cse23 .cse22 .cse42 .cse43 .cse44 .cse45 .cse46 .cse24 .cse26 .cse27) (or .cse20 .cse21 .cse22 .cse43 .cse47 .cse48 .cse45 .cse17 .cse24 .cse25) (or .cse21 .cse23 .cse22 (not (= 1 |old(~p_num_write~0)|)) .cse42 .cse43 .cse45 .cse30 .cse26 .cse27 (and .cse49 .cse6 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse50 .cse15)) (or .cse21 .cse22 .cse43 .cse42 .cse47 .cse44 .cse48 .cse45 .cse46 .cse17 .cse24) (or .cse0 .cse22 .cse47 .cse16 .cse45 .cse17))))) [2020-07-07 11:36:01,355 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-07 11:36:01,355 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-07 11:36:01,356 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-07 11:36:01,356 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-07 11:36:01,356 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-07 11:36:01,356 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-07 11:36:01,356 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-07 11:36:01,356 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (not (<= ~p_dw_pc~0 0))) (.cse3 (not (<= 2 ~c_dr_st~0))) (.cse7 (not (= 1 ~p_dw_pc~0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse8 (not (= 1 ~q_free~0))) (.cse6 (not (= 1 ~p_num_write~0))) (.cse4 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse9 (not (= 1 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 (not (= 0 ~c_num_read~0)) .cse5 .cse1 .cse2 .cse6 (not (= 0 ~q_free~0)) .cse4) (or .cse7 .cse5 (not (= 0 ~p_dw_st~0)) .cse1 .cse2 .cse8 .cse6 .cse4 .cse9 .cse10) (or .cse7 .cse1 .cse2 .cse3 .cse4) (or .cse7 .cse5 .cse1 .cse2 .cse8 .cse6 (not (<= 2 ~p_dw_st~0)) .cse4 .cse9 .cse10))) [2020-07-07 11:36:01,356 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-07 11:36:01,356 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-07 11:36:01,357 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-07 11:36:01,357 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-07 11:36:01,357 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-07 11:36:01,357 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-07 11:36:01,357 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 1 ~q_free~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-07 11:36:01,357 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-07 11:36:01,357 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-07 11:36:01,358 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-07 11:36:01,358 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-07 11:36:01,358 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-07 11:36:01,358 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-07 11:36:01,359 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse20 (<= 1 ~q_free~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse21 (not (= ~p_dw_st~0 ~q_free~0)))) (let ((.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse1 (<= ~p_dw_pc~0 0)) (.cse2 (let ((.cse22 (= 0 ~p_dw_st~0))) (or (and .cse20 .cse19 .cse22) (and .cse19 .cse22 (not (= ~p_dw_pc~0 ~q_free~0)) .cse21)))) (.cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse6 (= 0 ~p_num_write~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~q_free~0)) (.cse16 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~c_num_read~0 1))) (and .cse9 (<= .cse10 ~p_num_write~0) (<= ~p_num_write~0 .cse10) .cse11 .cse3 .cse8 .cse12)) (and (= ~c_num_read~0 |old(~c_num_read~0)|) .cse0 .cse1 (= ~p_num_write~0 |old(~p_num_write~0)|) .cse2 .cse13 .cse14 .cse15 .cse7 .cse16) (and .cse17 .cse18 .cse0 .cse2 .cse11 .cse8) (not (<= |old(~p_dw_pc~0)| 0)) (not (= 1 |old(~q_free~0)|)) (not .cse19) (and .cse17 .cse18 .cse0 .cse11 .cse8 .cse12) (and .cse9 .cse11 .cse4 (= 1 ~p_num_write~0) .cse8 .cse12) (not (= 0 |old(~c_num_read~0)|)) (and .cse0 (not (= 1 ~p_dw_st~0)) (not .cse3) .cse11 (or .cse20 .cse21)) (and .cse1 .cse2 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse7 .cse16) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))))) [2020-07-07 11:36:01,359 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= 1 ~q_free~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-07 11:36:01,359 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-07 11:36:01,359 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-07 11:36:01,359 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (not (= ~c_dr_pc~0 1)) (not (= 1 ~p_dw_i~0)) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-07 11:36:01,360 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 11:36:01,360 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-07 11:36:01,360 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-07 11:36:01,360 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-07 11:36:01,360 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-07 11:36:01,360 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-07 11:36:01,360 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-07 11:36:01,361 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse1 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse6 (not (= 0 ~q_free~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse3 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse7 (not (<= 2 ~c_dr_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (or .cse0 .cse3 .cse4 .cse8 .cse7))) [2020-07-07 11:36:01,361 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-07 11:36:01,361 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-07 11:36:01,361 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse11 (not (<= 2 |old(~p_dw_st~0)|))) (.cse12 (not (= 0 |old(~q_free~0)|))) (.cse15 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (<= 2 ~c_dr_st~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 0 ~p_dw_st~0)) (.cse10 (= 1 ~q_free~0)) (.cse13 (not (= 1 ~p_dw_i~0))) (.cse17 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (<= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 (not (<= ~p_num_write~0 .cse3)) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse14) (not .cse15))) (let ((.cse16 (= 1 ~c_num_read~0))) (or .cse0 (and .cse16 .cse6 .cse7 .cse8 .cse10 .cse14) .cse1 .cse2 (and .cse16 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse17 (not (= 1 ~p_num_write~0)))) (or (not (<= ~p_dw_pc~0 0)) .cse15 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (and .cse6 .cse7 (= 0 ~c_num_read~0) .cse8 .cse9 .cse10) .cse13 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse17 (not (= 0 ~p_num_write~0))))) [2020-07-07 11:36:01,361 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-07 11:36:01,361 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-07 11:36:01,362 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse17 (= 1 ~p_dw_i~0))) (let ((.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (not .cse17)) (.cse10 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= 1 ~q_free~0)) (.cse16 (= 1 ~p_dw_pc~0))) (let ((.cse0 (not .cse16)) (.cse7 (or (and .cse16 .cse17 (= ~c_dr_pc~0 1) .cse19) (and .cse10 .cse16 .cse17 .cse13 .cse19))) (.cse8 (<= 2 ~p_dw_st~0)) (.cse2 (and (or (= |old(~q_free~0)| ~p_dw_pc~0) .cse25) (or (not (<= 1 |old(~q_free~0)|)) .cse25))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse24 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not .cse20)) (.cse11 (= ~a_t~0 |old(~a_t~0)|)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse14 (= 0 ~c_num_read~0)) (.cse15 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~p_dw_st~0)) (.cse9 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse5 (= 1 ~c_num_read~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8) .cse9 (and .cse10 (= 0 ~q_free~0) .cse11 (= ~c_last_read~0 |old(~c_last_read~0)|) .cse12 .cse13 .cse14 .cse15) (not (= 1 ~p_num_write~0)) (and .cse5 .cse16 .cse17 .cse6 .cse18 .cse19 .cse20))) (let ((.cse23 (+ |old(~c_num_read~0)| 1)) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0))) (or .cse0 (and .cse21 .cse22 .cse6 .cse7 .cse8) .cse1 .cse2 (not (<= .cse23 ~p_num_write~0)) .cse4 .cse3 (not (<= ~p_num_write~0 .cse23)) (and .cse21 .cse22 .cse16 .cse17 .cse6 .cse18 .cse19 .cse20) (not .cse24))) (or (not (<= ~p_dw_pc~0 0)) .cse24 .cse1 (and .cse11 .cse13 .cse12 .cse14 .cse15 .cse6 .cse18 .cse19) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse25 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse9 (not (= 0 ~p_num_write~0))))))) [2020-07-07 11:36:01,362 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7) (and (= ~c_num_read~0 |old(~c_num_read~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_pc~0 1) (= ~c_last_read~0 |old(~c_last_read~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~q_free~0)| ~q_free~0)))) (or .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-07 11:36:01,362 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-07 11:36:01,362 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-07 11:36:01,363 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse17 (= 1 ~p_dw_i~0))) (let ((.cse7 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse8 (not (= 1 ~p_dw_pc~0))) (.cse9 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 0 |old(~q_free~0)|))) (.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse0 (= ~a_t~0 |old(~a_t~0)|)) (.cse13 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse14 (= |old(~q_free~0)| ~q_free~0)) (.cse15 (let ((.cse18 (= ~c_num_read~0 |old(~c_num_read~0)|))) (or (and .cse18 (<= 1 ~q_free~0) .cse17) (and .cse18 .cse17 (not (= ~p_dw_pc~0 ~q_free~0)))))) (.cse6 (not .cse17)) (.cse4 (= 1 |old(~c_dr_pc~0)|))) (and (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= 1 ~q_free~0)) (not (<= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse7 (not (= 0 ~p_num_write~0))) (or .cse8 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7 (not (= 1 ~p_num_write~0)) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse15)) (let ((.cse16 (+ |old(~c_num_read~0)| 1))) (or .cse8 .cse9 .cse5 (not (<= .cse16 ~p_num_write~0)) .cse10 .cse11 (and .cse12 (= ~c_dr_pc~0 1) .cse0 .cse13 .cse1 .cse2 .cse14 .cse15) .cse6 (not (<= ~p_num_write~0 .cse16)) (not .cse4)))))) [2020-07-07 11:36:01,363 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-07 11:36:01,363 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse7 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 .cse6 (not (<= ~p_num_write~0 .cse3)) (not .cse7))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse7 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse6 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse8 (not (= 0 ~p_num_write~0))))) [2020-07-07 11:36:01,363 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-07 11:36:01,363 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-07 11:36:01,364 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse12 (= 1 |old(~c_dr_pc~0)|)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= 1 ~p_dw_i~0))) (.cse13 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse3 (+ |old(~c_num_read~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= .cse3 ~p_num_write~0)) .cse4 .cse5 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (not (<= ~p_num_write~0 .cse3)) (not .cse12))) (or .cse0 .cse12 .cse1 .cse2 (and .cse6 (= 1 ~c_num_read~0) (not .cse7) .cse9 .cse8 .cse10) .cse4 .cse5 .cse11 .cse13 (not (= 1 ~p_num_write~0))) (or (not (<= ~p_dw_pc~0 0)) .cse12 .cse2 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse11 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse13 (not (= 0 ~p_num_write~0))))) [2020-07-07 11:36:01,364 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-07 11:36:01,364 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-07 11:36:01,364 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-07 11:36:01,364 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (not (= 0 |old(~q_free~0)|)) (and (= |old(~c_dr_i~0)| ~c_dr_i~0) (= 0 ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~c_num_read~0) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= 0 ~p_num_write~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (= 1 |old(~p_dw_i~0)|) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-07 11:36:01,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:36:01 BoogieIcfgContainer [2020-07-07 11:36:01,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:36:01,448 INFO L168 Benchmark]: Toolchain (without parser) took 64247.48 ms. Allocated memory was 137.9 MB in the beginning and 851.4 MB in the end (delta: 713.6 MB). Free memory was 102.5 MB in the beginning and 184.8 MB in the end (delta: -82.3 MB). Peak memory consumption was 714.2 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:01,449 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-07 11:36:01,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.65 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 89.5 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:01,450 INFO L168 Benchmark]: Boogie Preprocessor took 122.13 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 89.5 MB in the beginning and 179.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:01,450 INFO L168 Benchmark]: RCFGBuilder took 458.39 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 152.5 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:01,451 INFO L168 Benchmark]: TraceAbstraction took 63385.69 ms. Allocated memory was 201.9 MB in the beginning and 851.4 MB in the end (delta: 649.6 MB). Free memory was 151.8 MB in the beginning and 184.8 MB in the end (delta: -33.0 MB). Peak memory consumption was 699.5 MB. Max. memory is 7.1 GB. [2020-07-07 11:36:01,454 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.65 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 89.5 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.13 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 89.5 MB in the beginning and 179.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 458.39 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 152.5 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63385.69 ms. Allocated memory was 201.9 MB in the beginning and 851.4 MB in the end (delta: 649.6 MB). Free memory was 151.8 MB in the beginning and 184.8 MB in the end (delta: -33.0 MB). Peak memory consumption was 699.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((1 == \old(c_dr_pc) || !(1 == \old(q_free))) || (((((((((((((c_num_read == \old(c_num_read) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || !(2 <= \old(c_dr_st))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_dw_pc) <= 0)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || 1 == \old(p_dw_st)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && a_t == \old(a_t)) && c_dr_pc == 1) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || 1 == \old(p_dw_st)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && a_t == \old(a_t)) && c_dr_pc == 1) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && (((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && c_dr_pc == 1) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(1 == \old(p_num_write))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(c_num_read))) || ((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((1 == \old(c_dr_pc) || !(1 == \old(p_dw_pc))) || 1 == \old(p_dw_st)) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(1 == p_dw_pc) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 <= p_num_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(p_num_write <= \old(c_num_read) + 1)) || !(1 == \old(c_dr_pc))) || (((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && a_t == \old(a_t)) && c_dr_pc == 1) && c_last_read == \old(c_last_read)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free)) && ((((((((!(1 == p_dw_pc) || 1 == \old(c_dr_pc)) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(1 == p_num_write))) && ((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || ((((0 == q_free && 1 == p_dw_pc) && p_num_write <= c_num_read + 1) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0)) && (((((((((((((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || (((((\old(p_dw_st) == p_dw_st && 0 == q_free) && p_dw_pc <= 0) && c_dr_st == \old(c_dr_st)) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0))) && (((((((\old(p_dw_st) == p_dw_st && p_dw_pc <= 0) && c_dr_st == \old(c_dr_st)) || !(1 == \old(q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((!(1 == \old(p_dw_pc)) || (2 <= c_dr_st && 1 == p_dw_pc)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st)))) && (((((((((((((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)) || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || ((\old(q_free) == p_dw_pc || !(1 == p_dw_i)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((1 == c_num_read && c_last_read == p_last_write) && ((((1 == p_dw_pc && 1 == p_dw_i) && c_dr_pc == 1) && 1 == q_free) || ((((\old(p_dw_st) == p_dw_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && 1 == q_free))) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || (((((((\old(p_dw_st) == p_dw_st && 0 == q_free) && a_t == \old(a_t)) && c_last_read == \old(c_last_read)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc))) || !(1 == p_num_write)) || ((((((1 == c_num_read && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) && (((((((((!(1 == p_dw_pc) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && ((((1 == p_dw_pc && 1 == p_dw_i) && c_dr_pc == 1) && 1 == q_free) || ((((\old(p_dw_st) == p_dw_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && 1 == q_free))) && 2 <= p_dw_st)) || !(p_last_write == q_buf_0)) || ((\old(q_free) == p_dw_pc || !(1 == p_dw_i)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= p_num_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == \old(c_dr_pc)))) && (((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || (((((((a_t == \old(a_t) && c_dr_st == \old(c_dr_st)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || !(2 <= c_dr_st)) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == p_num_write)) || !(0 == q_free))) && ((((!(p_dw_pc <= 0) || (0 <= __retres1 && __retres1 <= 0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((c_num_read == \old(c_num_read) && 2 <= c_dr_st) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && (1 <= q_free || !(p_dw_st == q_free)))) || ((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && p_last_write == q_buf_0) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((1 == \old(c_dr_pc) || !(1 == \old(q_free))) || (((((((((((((c_num_read == \old(c_num_read) && p_dw_pc <= 0) && p_num_write == \old(p_num_write)) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || !(2 <= \old(c_dr_st))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_dw_pc) <= 0)) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || !(\old(p_num_write) <= \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((((((((p_dw_pc <= 0 && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_st == \old(c_dr_st)) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && 1 == q_free) && q_write_ev == \old(q_write_ev))) || !(1 == \old(q_free))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && c_dr_pc == 1) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || (((((0 == q_free && 1 == p_dw_pc) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((\old(p_dw_st) == \old(q_free) || !(0 == \old(p_dw_st))) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && ((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)))) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(1 == \old(p_dw_pc))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((((((!(\old(c_num_read) <= \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || 1 == \old(p_dw_st)) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_num_write) <= \old(c_num_read)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && (((1 <= q_free && 1 == p_dw_i) && 0 == p_dw_st) || (((1 == p_dw_i && 0 == p_dw_st) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && 1 == p_dw_pc) && c_dr_pc == 1) && p_last_write == q_buf_0)) || !(1 == \old(p_dw_pc))) || !(1 == \old(p_num_write))) || !(0 == \old(q_free))) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(0 == \old(c_num_read))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((0 == q_free && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free)))) && c_dr_pc == 1) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((((((((\old(p_dw_st) == p_dw_st && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && 1 == p_num_write) && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && 0 == c_num_read) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || 1 == \old(p_dw_st)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((((((((((((((c_num_read == \old(c_num_read) && \old(p_dw_st) == p_dw_st) && p_num_write == \old(p_num_write)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_last_read == \old(c_last_read)) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && 2 <= c_dr_st) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_pc) == p_dw_pc) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc)))) && (((((1 == \old(c_dr_pc) || !(1 == \old(p_dw_pc))) || 1 == \old(p_dw_st)) || ((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && ((1 <= q_free && 1 == p_dw_i) || ((1 == p_dw_i && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))))) || (((\old(p_dw_st) == \old(q_free) || !(1 == p_dw_i)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || (((((0 == q_free && p_num_write <= \old(p_num_write) + 1) && 1 == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) && (((((!(1 == \old(q_free)) || ((((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && 1 == p_dw_i) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || ((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || ((((0 == q_free && 1 == p_dw_pc) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || !(\old(p_dw_pc) <= 0))) && ((((!(1 == \old(p_dw_pc)) || ((((((2 <= c_dr_st && !(1 == p_dw_st)) && !(c_dr_pc == 1)) && 1 == p_dw_pc) && 1 == p_dw_i) && !(p_dw_pc == q_free)) && !(p_dw_st == q_free))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((!(p_dw_pc <= 0) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) || (__retres1 <= 0 && 0 <= __retres1)) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == p_num_write)) || !(0 == q_free)) || (__retres1 <= 0 && 0 <= __retres1))) && (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == q_free)) || !(1 == p_num_write)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && ((((!(1 == p_dw_pc) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(2 <= c_dr_st)) || (__retres1 <= 0 && 0 <= __retres1))) && (((((((((!(1 == p_dw_pc) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || c_dr_pc == 1) || !(1 == q_free)) || !(1 == p_num_write)) || !(2 <= p_dw_st)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_num_read)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((!(1 == p_dw_pc) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 <= p_num_write)) || ((((((p_num_write <= c_num_read && c_num_read <= p_num_write) && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(p_num_write <= \old(c_num_read) + 1)) || ((((((p_num_write <= c_num_read && c_num_read <= p_num_write) && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) && (((((((((!(1 == p_dw_pc) || (((((1 == c_num_read && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st)) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || (((((1 == c_num_read && 2 <= c_dr_st) && c_dr_pc == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(1 == p_num_write))) && (((((((((!(p_dw_pc <= 0) || 1 == \old(c_dr_pc)) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || (((((2 <= c_dr_st && c_dr_pc == 1) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || (((((((\old(p_dw_st) == p_dw_st && q_buf_0 == \old(q_buf_0)) && c_dr_st == \old(c_dr_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && p_last_write == q_buf_0) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) && ((((!(1 == \old(p_dw_pc)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || (((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && !(0 == q_free)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_dw_pc))) || !(\old(p_num_write) <= c_num_read)) || !(c_num_read <= \old(p_num_write))) || !(c_dr_pc == 1)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(2 <= \old(c_dr_st))) || ((((((((((\old(p_dw_st) == p_dw_st && p_num_write <= c_num_read) && c_num_read <= p_num_write) && q_buf_0 == \old(q_buf_0)) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && !(0 == q_free)) && p_last_write == q_buf_0) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev)))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((((((\old(p_dw_st) == p_dw_st && p_last_write == \old(p_last_write)) && q_buf_0 == \old(q_buf_0)) && c_dr_st == \old(c_dr_st)) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) && \old(q_free) == q_free) && q_write_ev == \old(q_write_ev))) || !(0 == \old(p_num_write))) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || !(c_last_read == \old(p_last_write))) || c_dr_pc == 1) || !(\old(p_dw_pc) <= 0))) && (((((!(1 == \old(q_free)) || (((!(1 == p_dw_i) || \old(p_dw_pc) == \old(q_free)) || 0 == \old(q_free)) && (!(1 <= \old(q_free)) || !(1 == p_dw_i)))) || c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) || ((((\old(p_dw_st) == p_dw_st && p_dw_pc <= 0) && 1 == p_dw_i) && c_dr_st == \old(c_dr_st)) && !(0 == q_free))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.0s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2089 SDtfs, 4979 SDslu, 2214 SDs, 0 SdLazy, 10331 SolverSat, 2049 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 622 SyntacticMatches, 4 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2338occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 1555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3013 PreInvPairs, 3531 NumberOfFragments, 13008 HoareAnnotationTreeSize, 3013 FomulaSimplifications, 38236070 FormulaSimplificationTreeSizeReduction, 7.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 1290290 FormulaSimplificationTreeSizeReductionInter, 30.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1466 ConstructedInterpolants, 0 QuantifiedInterpolants, 378975 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1910 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 310/340 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...