/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:29:54,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:29:54,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:29:54,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:29:54,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:29:54,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:29:54,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:29:54,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:29:54,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:29:54,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:29:54,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:29:54,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:29:54,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:29:54,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:29:54,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:29:54,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:29:54,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:29:54,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:29:54,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:29:54,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:29:54,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:29:54,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:29:54,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:29:54,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:29:54,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:29:54,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:29:54,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:29:54,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:29:54,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:29:54,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:29:54,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:29:54,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:29:54,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:29:54,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:29:54,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:29:54,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:29:54,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:29:54,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:29:54,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:29:54,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:29:54,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:29:54,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:29:54,881 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:29:54,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:29:54,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:29:54,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:29:54,886 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:29:54,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:29:54,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:29:54,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:29:54,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:29:54,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:29:54,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:29:54,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:29:54,889 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:29:54,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:29:54,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:29:54,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:29:54,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:29:54,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:29:54,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:29:54,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:29:54,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:29:54,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:29:54,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:29:54,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:29:54,892 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:29:54,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:29:55,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:29:55,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:29:55,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:29:55,365 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:29:55,366 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:29:55,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-12-23 09:29:55,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6919fed34/087ae85d355d4e1fb3320fd6e1c0013b/FLAG302aa150d [2020-12-23 09:29:56,086 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:29:56,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2020-12-23 09:29:56,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6919fed34/087ae85d355d4e1fb3320fd6e1c0013b/FLAG302aa150d [2020-12-23 09:29:56,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/6919fed34/087ae85d355d4e1fb3320fd6e1c0013b [2020-12-23 09:29:56,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:29:56,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:29:56,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:56,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:29:56,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:29:56,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58851ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56, skipping insertion in model container [2020-12-23 09:29:56,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:29:56,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:29:56,631 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_buf_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_last_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_last_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_num_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_num_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] [2020-12-23 09:29:56,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:56,701 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:29:56,716 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_buf_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_last_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_last_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p_dw_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~c_dr_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~q_free~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_write_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~q_read_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_num_write~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p_dw_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_num_read~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_dr_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] [2020-12-23 09:29:56,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:56,775 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:29:56,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56 WrapperNode [2020-12-23 09:29:56,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:56,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:56,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:29:56,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:29:56,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:56,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:29:56,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:29:56,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:29:56,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... [2020-12-23 09:29:56,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:29:56,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:29:56,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:29:56,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:29:56,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:29:57,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:29:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:29:57,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:29:57,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:29:57,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:29:57,546 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2020-12-23 09:29:57,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:57 BoogieIcfgContainer [2020-12-23 09:29:57,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:29:57,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:29:57,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:29:57,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:29:57,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:29:56" (1/3) ... [2020-12-23 09:29:57,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363fea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:57, skipping insertion in model container [2020-12-23 09:29:57,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:56" (2/3) ... [2020-12-23 09:29:57,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363fea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:57, skipping insertion in model container [2020-12-23 09:29:57,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:57" (3/3) ... [2020-12-23 09:29:57,560 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2020-12-23 09:29:57,567 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:29:57,573 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 09:29:57,596 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-23 09:29:57,628 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:29:57,629 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:29:57,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:29:57,629 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:29:57,629 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:29:57,630 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:29:57,630 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:29:57,630 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:29:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2020-12-23 09:29:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:29:57,667 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:57,669 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] [2020-12-23 09:29:57,672 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:57,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:57,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595671, now seen corresponding path program 1 times [2020-12-23 09:29:57,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:57,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100685753] [2020-12-23 09:29:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:58,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100685753] [2020-12-23 09:29:58,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:58,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:58,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834143729] [2020-12-23 09:29:58,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:58,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:58,128 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 3 states. [2020-12-23 09:29:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:58,261 INFO L93 Difference]: Finished difference Result 266 states and 419 transitions. [2020-12-23 09:29:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:58,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 09:29:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:58,295 INFO L225 Difference]: With dead ends: 266 [2020-12-23 09:29:58,301 INFO L226 Difference]: Without dead ends: 174 [2020-12-23 09:29:58,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-23 09:29:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2020-12-23 09:29:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-12-23 09:29:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2020-12-23 09:29:58,422 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2020-12-23 09:29:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:58,423 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2020-12-23 09:29:58,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2020-12-23 09:29:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:29:58,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:58,426 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] [2020-12-23 09:29:58,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:29:58,427 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash 32121146, now seen corresponding path program 1 times [2020-12-23 09:29:58,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:58,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131581940] [2020-12-23 09:29:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:58,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131581940] [2020-12-23 09:29:58,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:58,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:29:58,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659170513] [2020-12-23 09:29:58,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:29:58,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:29:58,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:58,498 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand 5 states. [2020-12-23 09:29:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:58,629 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2020-12-23 09:29:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:29:58,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-12-23 09:29:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:58,639 INFO L225 Difference]: With dead ends: 540 [2020-12-23 09:29:58,639 INFO L226 Difference]: Without dead ends: 400 [2020-12-23 09:29:58,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:29:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-12-23 09:29:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 176. [2020-12-23 09:29:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-12-23 09:29:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2020-12-23 09:29:58,687 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 39 [2020-12-23 09:29:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:58,688 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2020-12-23 09:29:58,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:29:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2020-12-23 09:29:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:29:58,693 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:58,693 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] [2020-12-23 09:29:58,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:29:58,695 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash 94160760, now seen corresponding path program 1 times [2020-12-23 09:29:58,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:58,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392470894] [2020-12-23 09:29:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:58,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392470894] [2020-12-23 09:29:58,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:58,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:58,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043034760] [2020-12-23 09:29:58,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:58,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:58,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:58,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:58,796 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand 4 states. [2020-12-23 09:29:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:58,908 INFO L93 Difference]: Finished difference Result 466 states and 666 transitions. [2020-12-23 09:29:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:58,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-23 09:29:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:58,910 INFO L225 Difference]: With dead ends: 466 [2020-12-23 09:29:58,911 INFO L226 Difference]: Without dead ends: 331 [2020-12-23 09:29:58,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-12-23 09:29:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 246. [2020-12-23 09:29:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-12-23 09:29:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 343 transitions. [2020-12-23 09:29:58,931 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 343 transitions. Word has length 39 [2020-12-23 09:29:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:58,932 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 343 transitions. [2020-12-23 09:29:58,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 343 transitions. [2020-12-23 09:29:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 09:29:58,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:58,935 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] [2020-12-23 09:29:58,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:29:58,935 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1899983946, now seen corresponding path program 1 times [2020-12-23 09:29:58,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:58,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877481894] [2020-12-23 09:29:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:58,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877481894] [2020-12-23 09:29:58,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:58,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:58,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836071926] [2020-12-23 09:29:58,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:58,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:58,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:58,994 INFO L87 Difference]: Start difference. First operand 246 states and 343 transitions. Second operand 3 states. [2020-12-23 09:29:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:59,044 INFO L93 Difference]: Finished difference Result 626 states and 868 transitions. [2020-12-23 09:29:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:59,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-12-23 09:29:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:59,048 INFO L225 Difference]: With dead ends: 626 [2020-12-23 09:29:59,048 INFO L226 Difference]: Without dead ends: 466 [2020-12-23 09:29:59,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-12-23 09:29:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2020-12-23 09:29:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2020-12-23 09:29:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 635 transitions. [2020-12-23 09:29:59,090 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 635 transitions. Word has length 39 [2020-12-23 09:29:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:59,091 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 635 transitions. [2020-12-23 09:29:59,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 635 transitions. [2020-12-23 09:29:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 09:29:59,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:59,100 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] [2020-12-23 09:29:59,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:29:59,101 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash -909810741, now seen corresponding path program 1 times [2020-12-23 09:29:59,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:59,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157719252] [2020-12-23 09:29:59,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:59,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157719252] [2020-12-23 09:29:59,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:59,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:59,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227295938] [2020-12-23 09:29:59,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:59,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:59,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:59,224 INFO L87 Difference]: Start difference. First operand 462 states and 635 transitions. Second operand 3 states. [2020-12-23 09:29:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:59,291 INFO L93 Difference]: Finished difference Result 1090 states and 1499 transitions. [2020-12-23 09:29:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:59,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-23 09:29:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:59,301 INFO L225 Difference]: With dead ends: 1090 [2020-12-23 09:29:59,301 INFO L226 Difference]: Without dead ends: 738 [2020-12-23 09:29:59,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2020-12-23 09:29:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 714. [2020-12-23 09:29:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-12-23 09:29:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 959 transitions. [2020-12-23 09:29:59,349 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 959 transitions. Word has length 40 [2020-12-23 09:29:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:59,350 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 959 transitions. [2020-12-23 09:29:59,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 959 transitions. [2020-12-23 09:29:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 09:29:59,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:59,353 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] [2020-12-23 09:29:59,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:29:59,353 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:59,354 INFO L82 PathProgramCache]: Analyzing trace with hash -956850730, now seen corresponding path program 1 times [2020-12-23 09:29:59,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:59,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276034662] [2020-12-23 09:29:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:59,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276034662] [2020-12-23 09:29:59,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:59,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:59,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464774840] [2020-12-23 09:29:59,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:59,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:59,455 INFO L87 Difference]: Start difference. First operand 714 states and 959 transitions. Second operand 3 states. [2020-12-23 09:29:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:59,552 INFO L93 Difference]: Finished difference Result 1966 states and 2646 transitions. [2020-12-23 09:29:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:59,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-23 09:29:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:59,560 INFO L225 Difference]: With dead ends: 1966 [2020-12-23 09:29:59,561 INFO L226 Difference]: Without dead ends: 1257 [2020-12-23 09:29:59,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2020-12-23 09:29:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1237. [2020-12-23 09:29:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2020-12-23 09:29:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2020-12-23 09:29:59,640 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 40 [2020-12-23 09:29:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:59,641 INFO L481 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2020-12-23 09:29:59,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2020-12-23 09:29:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 09:29:59,644 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:59,644 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] [2020-12-23 09:29:59,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:29:59,646 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1951308106, now seen corresponding path program 1 times [2020-12-23 09:29:59,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:59,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201337788] [2020-12-23 09:29:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:59,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201337788] [2020-12-23 09:29:59,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:59,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:59,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129483037] [2020-12-23 09:29:59,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:59,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:59,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:59,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:59,738 INFO L87 Difference]: Start difference. First operand 1237 states and 1648 transitions. Second operand 3 states. [2020-12-23 09:29:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:59,865 INFO L93 Difference]: Finished difference Result 2929 states and 3880 transitions. [2020-12-23 09:29:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:59,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 09:29:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:59,875 INFO L225 Difference]: With dead ends: 2929 [2020-12-23 09:29:59,876 INFO L226 Difference]: Without dead ends: 1729 [2020-12-23 09:29:59,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2020-12-23 09:29:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1705. [2020-12-23 09:29:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2020-12-23 09:29:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2236 transitions. [2020-12-23 09:29:59,969 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2236 transitions. Word has length 45 [2020-12-23 09:29:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:59,970 INFO L481 AbstractCegarLoop]: Abstraction has 1705 states and 2236 transitions. [2020-12-23 09:29:59,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2236 transitions. [2020-12-23 09:29:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:29:59,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:59,971 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:29:59,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:29:59,972 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:29:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1660743978, now seen corresponding path program 1 times [2020-12-23 09:29:59,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:59,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405660535] [2020-12-23 09:29:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:30:00,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405660535] [2020-12-23 09:30:00,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:00,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:30:00,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343950327] [2020-12-23 09:30:00,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:30:00,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:00,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:30:00,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:30:00,010 INFO L87 Difference]: Start difference. First operand 1705 states and 2236 transitions. Second operand 4 states. [2020-12-23 09:30:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:00,131 INFO L93 Difference]: Finished difference Result 1993 states and 2618 transitions. [2020-12-23 09:30:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:30:00,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-12-23 09:30:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:00,143 INFO L225 Difference]: With dead ends: 1993 [2020-12-23 09:30:00,144 INFO L226 Difference]: Without dead ends: 1991 [2020-12-23 09:30:00,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:30:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2020-12-23 09:30:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1703. [2020-12-23 09:30:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2020-12-23 09:30:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2227 transitions. [2020-12-23 09:30:00,284 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2227 transitions. Word has length 46 [2020-12-23 09:30:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:00,284 INFO L481 AbstractCegarLoop]: Abstraction has 1703 states and 2227 transitions. [2020-12-23 09:30:00,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:30:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2227 transitions. [2020-12-23 09:30:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-12-23 09:30:00,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:00,286 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:00,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:30:00,289 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash -56555803, now seen corresponding path program 1 times [2020-12-23 09:30:00,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:00,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753748974] [2020-12-23 09:30:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:30:00,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753748974] [2020-12-23 09:30:00,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516554951] [2020-12-23 09:30:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:00,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-23 09:30:00,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:30:00,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:00,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-23 09:30:00,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712801814] [2020-12-23 09:30:00,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:30:00,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:30:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:30:00,663 INFO L87 Difference]: Start difference. First operand 1703 states and 2227 transitions. Second operand 6 states. [2020-12-23 09:30:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:00,941 INFO L93 Difference]: Finished difference Result 3615 states and 4764 transitions. [2020-12-23 09:30:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:30:00,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2020-12-23 09:30:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:00,958 INFO L225 Difference]: With dead ends: 3615 [2020-12-23 09:30:00,958 INFO L226 Difference]: Without dead ends: 3613 [2020-12-23 09:30:00,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:30:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2020-12-23 09:30:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3021. [2020-12-23 09:30:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3021 states. [2020-12-23 09:30:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 3971 transitions. [2020-12-23 09:30:01,188 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 3971 transitions. Word has length 47 [2020-12-23 09:30:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:01,190 INFO L481 AbstractCegarLoop]: Abstraction has 3021 states and 3971 transitions. [2020-12-23 09:30:01,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:30:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3971 transitions. [2020-12-23 09:30:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 09:30:01,192 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:01,192 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:01,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-23 09:30:01,408 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2073247729, now seen corresponding path program 2 times [2020-12-23 09:30:01,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:01,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877604611] [2020-12-23 09:30:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:30:01,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877604611] [2020-12-23 09:30:01,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:01,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:30:01,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682128828] [2020-12-23 09:30:01,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:30:01,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:30:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:01,499 INFO L87 Difference]: Start difference. First operand 3021 states and 3971 transitions. Second operand 3 states. [2020-12-23 09:30:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:01,702 INFO L93 Difference]: Finished difference Result 4413 states and 5844 transitions. [2020-12-23 09:30:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:30:01,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-23 09:30:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:01,714 INFO L225 Difference]: With dead ends: 4413 [2020-12-23 09:30:01,714 INFO L226 Difference]: Without dead ends: 2271 [2020-12-23 09:30:01,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2020-12-23 09:30:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2261. [2020-12-23 09:30:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2020-12-23 09:30:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2929 transitions. [2020-12-23 09:30:01,874 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2929 transitions. Word has length 50 [2020-12-23 09:30:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:01,875 INFO L481 AbstractCegarLoop]: Abstraction has 2261 states and 2929 transitions. [2020-12-23 09:30:01,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:30:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2929 transitions. [2020-12-23 09:30:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 09:30:01,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:01,878 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:01,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:30:01,878 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1744624096, now seen corresponding path program 1 times [2020-12-23 09:30:01,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:01,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985532236] [2020-12-23 09:30:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:30:01,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985532236] [2020-12-23 09:30:01,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:01,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:30:01,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371707527] [2020-12-23 09:30:01,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:30:01,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:30:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:30:01,941 INFO L87 Difference]: Start difference. First operand 2261 states and 2929 transitions. Second operand 4 states. [2020-12-23 09:30:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:02,266 INFO L93 Difference]: Finished difference Result 6497 states and 8385 transitions. [2020-12-23 09:30:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:30:02,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-23 09:30:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:02,289 INFO L225 Difference]: With dead ends: 6497 [2020-12-23 09:30:02,289 INFO L226 Difference]: Without dead ends: 4369 [2020-12-23 09:30:02,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:30:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2020-12-23 09:30:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4335. [2020-12-23 09:30:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2020-12-23 09:30:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 5521 transitions. [2020-12-23 09:30:02,578 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 5521 transitions. Word has length 54 [2020-12-23 09:30:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:02,579 INFO L481 AbstractCegarLoop]: Abstraction has 4335 states and 5521 transitions. [2020-12-23 09:30:02,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:30:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 5521 transitions. [2020-12-23 09:30:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 09:30:02,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:02,583 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:02,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:30:02,584 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash -133219174, now seen corresponding path program 1 times [2020-12-23 09:30:02,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:02,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785741435] [2020-12-23 09:30:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:30:02,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785741435] [2020-12-23 09:30:02,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:02,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:30:02,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594063984] [2020-12-23 09:30:02,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:30:02,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:02,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:30:02,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:30:02,624 INFO L87 Difference]: Start difference. First operand 4335 states and 5521 transitions. Second operand 4 states. [2020-12-23 09:30:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:02,976 INFO L93 Difference]: Finished difference Result 7753 states and 9875 transitions. [2020-12-23 09:30:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:30:02,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 09:30:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:02,998 INFO L225 Difference]: With dead ends: 7753 [2020-12-23 09:30:02,998 INFO L226 Difference]: Without dead ends: 4373 [2020-12-23 09:30:03,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:30:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2020-12-23 09:30:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4099. [2020-12-23 09:30:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4099 states. [2020-12-23 09:30:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 5131 transitions. [2020-12-23 09:30:03,322 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 5131 transitions. Word has length 62 [2020-12-23 09:30:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:03,323 INFO L481 AbstractCegarLoop]: Abstraction has 4099 states and 5131 transitions. [2020-12-23 09:30:03,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:30:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 5131 transitions. [2020-12-23 09:30:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 09:30:03,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:03,328 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:03,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:30:03,330 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:03,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 192048362, now seen corresponding path program 1 times [2020-12-23 09:30:03,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:03,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879609491] [2020-12-23 09:30:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 09:30:03,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879609491] [2020-12-23 09:30:03,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:03,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:30:03,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28864691] [2020-12-23 09:30:03,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:30:03,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:30:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:30:03,390 INFO L87 Difference]: Start difference. First operand 4099 states and 5131 transitions. Second operand 6 states. [2020-12-23 09:30:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:03,735 INFO L93 Difference]: Finished difference Result 6541 states and 8149 transitions. [2020-12-23 09:30:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 09:30:03,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2020-12-23 09:30:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:03,747 INFO L225 Difference]: With dead ends: 6541 [2020-12-23 09:30:03,747 INFO L226 Difference]: Without dead ends: 2561 [2020-12-23 09:30:03,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:30:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2020-12-23 09:30:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2056. [2020-12-23 09:30:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2020-12-23 09:30:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2538 transitions. [2020-12-23 09:30:03,915 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2538 transitions. Word has length 89 [2020-12-23 09:30:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:03,915 INFO L481 AbstractCegarLoop]: Abstraction has 2056 states and 2538 transitions. [2020-12-23 09:30:03,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:30:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2538 transitions. [2020-12-23 09:30:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 09:30:03,918 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:03,918 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:03,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:30:03,918 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:03,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:03,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2062407350, now seen corresponding path program 1 times [2020-12-23 09:30:03,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:03,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320173473] [2020-12-23 09:30:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-23 09:30:03,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320173473] [2020-12-23 09:30:03,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:03,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:30:03,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926756367] [2020-12-23 09:30:03,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:30:03,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:03,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:30:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:03,950 INFO L87 Difference]: Start difference. First operand 2056 states and 2538 transitions. Second operand 3 states. [2020-12-23 09:30:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:04,063 INFO L93 Difference]: Finished difference Result 2058 states and 2539 transitions. [2020-12-23 09:30:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:30:04,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-12-23 09:30:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:04,070 INFO L225 Difference]: With dead ends: 2058 [2020-12-23 09:30:04,070 INFO L226 Difference]: Without dead ends: 1569 [2020-12-23 09:30:04,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2020-12-23 09:30:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2020-12-23 09:30:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-12-23 09:30:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1947 transitions. [2020-12-23 09:30:04,183 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1947 transitions. Word has length 91 [2020-12-23 09:30:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:04,183 INFO L481 AbstractCegarLoop]: Abstraction has 1569 states and 1947 transitions. [2020-12-23 09:30:04,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:30:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1947 transitions. [2020-12-23 09:30:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 09:30:04,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:04,186 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:04,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:30:04,187 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1584127351, now seen corresponding path program 1 times [2020-12-23 09:30:04,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:04,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123941571] [2020-12-23 09:30:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:30:04,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123941571] [2020-12-23 09:30:04,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:04,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:30:04,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137936771] [2020-12-23 09:30:04,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:30:04,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:04,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:30:04,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:04,224 INFO L87 Difference]: Start difference. First operand 1569 states and 1947 transitions. Second operand 3 states. [2020-12-23 09:30:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:04,307 INFO L93 Difference]: Finished difference Result 2545 states and 3158 transitions. [2020-12-23 09:30:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:30:04,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-23 09:30:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:04,313 INFO L225 Difference]: With dead ends: 2545 [2020-12-23 09:30:04,313 INFO L226 Difference]: Without dead ends: 1095 [2020-12-23 09:30:04,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2020-12-23 09:30:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1026. [2020-12-23 09:30:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-12-23 09:30:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1255 transitions. [2020-12-23 09:30:04,394 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1255 transitions. Word has length 102 [2020-12-23 09:30:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:04,394 INFO L481 AbstractCegarLoop]: Abstraction has 1026 states and 1255 transitions. [2020-12-23 09:30:04,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:30:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1255 transitions. [2020-12-23 09:30:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 09:30:04,397 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:04,397 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:04,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:30:04,397 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:04,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1991347350, now seen corresponding path program 1 times [2020-12-23 09:30:04,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:04,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466571459] [2020-12-23 09:30:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:30:04,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466571459] [2020-12-23 09:30:04,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:04,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:30:04,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535129748] [2020-12-23 09:30:04,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:30:04,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:30:04,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:30:04,469 INFO L87 Difference]: Start difference. First operand 1026 states and 1255 transitions. Second operand 4 states. [2020-12-23 09:30:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:04,585 INFO L93 Difference]: Finished difference Result 1967 states and 2397 transitions. [2020-12-23 09:30:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:30:04,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2020-12-23 09:30:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:04,589 INFO L225 Difference]: With dead ends: 1967 [2020-12-23 09:30:04,590 INFO L226 Difference]: Without dead ends: 979 [2020-12-23 09:30:04,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:30:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2020-12-23 09:30:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 958. [2020-12-23 09:30:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2020-12-23 09:30:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1155 transitions. [2020-12-23 09:30:04,673 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1155 transitions. Word has length 104 [2020-12-23 09:30:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:04,674 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 1155 transitions. [2020-12-23 09:30:04,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:30:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1155 transitions. [2020-12-23 09:30:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-23 09:30:04,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:04,676 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:04,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:30:04,677 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2042293350, now seen corresponding path program 1 times [2020-12-23 09:30:04,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:04,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235474757] [2020-12-23 09:30:04,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:30:04,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235474757] [2020-12-23 09:30:04,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:04,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:30:04,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126682593] [2020-12-23 09:30:04,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:30:04,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:30:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:04,722 INFO L87 Difference]: Start difference. First operand 958 states and 1155 transitions. Second operand 3 states. [2020-12-23 09:30:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:04,801 INFO L93 Difference]: Finished difference Result 1681 states and 2044 transitions. [2020-12-23 09:30:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:30:04,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-23 09:30:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:04,805 INFO L225 Difference]: With dead ends: 1681 [2020-12-23 09:30:04,805 INFO L226 Difference]: Without dead ends: 949 [2020-12-23 09:30:04,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2020-12-23 09:30:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 872. [2020-12-23 09:30:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-12-23 09:30:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1033 transitions. [2020-12-23 09:30:04,898 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1033 transitions. Word has length 104 [2020-12-23 09:30:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:04,898 INFO L481 AbstractCegarLoop]: Abstraction has 872 states and 1033 transitions. [2020-12-23 09:30:04,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:30:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1033 transitions. [2020-12-23 09:30:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 09:30:04,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:04,901 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:04,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:30:04,902 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:04,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:04,902 INFO L82 PathProgramCache]: Analyzing trace with hash 795979083, now seen corresponding path program 1 times [2020-12-23 09:30:04,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:04,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679019372] [2020-12-23 09:30:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:30:04,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679019372] [2020-12-23 09:30:04,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:04,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:30:04,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757171331] [2020-12-23 09:30:04,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:30:04,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:30:04,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:30:04,964 INFO L87 Difference]: Start difference. First operand 872 states and 1033 transitions. Second operand 5 states. [2020-12-23 09:30:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:05,117 INFO L93 Difference]: Finished difference Result 2004 states and 2354 transitions. [2020-12-23 09:30:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:30:05,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-12-23 09:30:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:05,120 INFO L225 Difference]: With dead ends: 2004 [2020-12-23 09:30:05,121 INFO L226 Difference]: Without dead ends: 861 [2020-12-23 09:30:05,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:30:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-12-23 09:30:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 571. [2020-12-23 09:30:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-12-23 09:30:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 658 transitions. [2020-12-23 09:30:05,202 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 658 transitions. Word has length 105 [2020-12-23 09:30:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:05,202 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 658 transitions. [2020-12-23 09:30:05,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:30:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 658 transitions. [2020-12-23 09:30:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-23 09:30:05,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:05,205 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:05,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:30:05,206 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 231071671, now seen corresponding path program 1 times [2020-12-23 09:30:05,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:05,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907519131] [2020-12-23 09:30:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-12-23 09:30:05,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907519131] [2020-12-23 09:30:05,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:05,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:30:05,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75891634] [2020-12-23 09:30:05,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:30:05,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:30:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:05,319 INFO L87 Difference]: Start difference. First operand 571 states and 658 transitions. Second operand 3 states. [2020-12-23 09:30:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:05,376 INFO L93 Difference]: Finished difference Result 743 states and 849 transitions. [2020-12-23 09:30:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:30:05,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2020-12-23 09:30:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:05,378 INFO L225 Difference]: With dead ends: 743 [2020-12-23 09:30:05,378 INFO L226 Difference]: Without dead ends: 290 [2020-12-23 09:30:05,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-12-23 09:30:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-12-23 09:30:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-12-23 09:30:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 314 transitions. [2020-12-23 09:30:05,420 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 314 transitions. Word has length 158 [2020-12-23 09:30:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:05,420 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 314 transitions. [2020-12-23 09:30:05,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:30:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 314 transitions. [2020-12-23 09:30:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 09:30:05,422 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:05,423 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:05,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:30:05,423 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:05,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1337877945, now seen corresponding path program 1 times [2020-12-23 09:30:05,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:05,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548138272] [2020-12-23 09:30:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-12-23 09:30:05,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548138272] [2020-12-23 09:30:05,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:05,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:30:05,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889883635] [2020-12-23 09:30:05,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:30:05,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:05,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:30:05,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:05,524 INFO L87 Difference]: Start difference. First operand 290 states and 314 transitions. Second operand 3 states. [2020-12-23 09:30:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:05,563 INFO L93 Difference]: Finished difference Result 487 states and 529 transitions. [2020-12-23 09:30:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:30:05,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-12-23 09:30:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:05,565 INFO L225 Difference]: With dead ends: 487 [2020-12-23 09:30:05,565 INFO L226 Difference]: Without dead ends: 288 [2020-12-23 09:30:05,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-23 09:30:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2020-12-23 09:30:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-12-23 09:30:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 307 transitions. [2020-12-23 09:30:05,595 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 307 transitions. Word has length 159 [2020-12-23 09:30:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:05,595 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 307 transitions. [2020-12-23 09:30:05,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:30:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 307 transitions. [2020-12-23 09:30:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 09:30:05,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:05,598 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:30:05,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:30:05,598 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:05,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1976533731, now seen corresponding path program 1 times [2020-12-23 09:30:05,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:05,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267180338] [2020-12-23 09:30:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 46 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 09:30:05,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267180338] [2020-12-23 09:30:05,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135042216] [2020-12-23 09:30:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:05,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 09:30:05,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 09:30:06,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:06,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2020-12-23 09:30:06,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965790943] [2020-12-23 09:30:06,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:30:06,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:30:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:30:06,246 INFO L87 Difference]: Start difference. First operand 288 states and 307 transitions. Second operand 9 states. [2020-12-23 09:30:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:06,357 INFO L93 Difference]: Finished difference Result 539 states and 577 transitions. [2020-12-23 09:30:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:30:06,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2020-12-23 09:30:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:06,358 INFO L225 Difference]: With dead ends: 539 [2020-12-23 09:30:06,358 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 09:30:06,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:30:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 09:30:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 09:30:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 09:30:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 09:30:06,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2020-12-23 09:30:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:06,360 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 09:30:06,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:30:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 09:30:06,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 09:30:06,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:06,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 09:30:06,861 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 144 [2020-12-23 09:30:07,171 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 123 [2020-12-23 09:30:07,852 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 140 [2020-12-23 09:30:08,552 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 143 [2020-12-23 09:30:09,686 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-12-23 09:30:10,053 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2020-12-23 09:30:10,321 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-12-23 09:30:11,270 WARN L197 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2020-12-23 09:30:11,737 WARN L197 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2020-12-23 09:30:12,220 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2020-12-23 09:30:12,717 WARN L197 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2020-12-23 09:30:13,238 WARN L197 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2020-12-23 09:30:13,801 WARN L197 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2020-12-23 09:30:14,286 WARN L197 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2020-12-23 09:30:14,615 WARN L197 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2020-12-23 09:30:15,628 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-12-23 09:30:16,218 WARN L197 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2020-12-23 09:30:16,715 WARN L197 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2020-12-23 09:30:16,965 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2020-12-23 09:30:17,525 WARN L197 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2020-12-23 09:30:18,015 WARN L197 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2020-12-23 09:30:18,355 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2020-12-23 09:30:18,903 WARN L197 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2020-12-23 09:30:19,475 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2020-12-23 09:30:19,968 WARN L197 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2020-12-23 09:30:21,087 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 127 DAG size of output: 87 [2020-12-23 09:30:21,092 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-23 09:30:21,092 INFO L189 CegarLoopUtils]: For program point L267-1(lines 266 279) no Hoare annotation was computed. [2020-12-23 09:30:21,092 INFO L185 CegarLoopUtils]: At program point L234-1(lines 267 271) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,092 INFO L189 CegarLoopUtils]: For program point L267-2(lines 267 271) no Hoare annotation was computed. [2020-12-23 09:30:21,092 INFO L189 CegarLoopUtils]: For program point L267-4(lines 266 279) no Hoare annotation was computed. [2020-12-23 09:30:21,093 INFO L185 CegarLoopUtils]: At program point L69(lines 53 71) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~p_num_write~0 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,093 INFO L185 CegarLoopUtils]: At program point L69-1(lines 53 71) the Hoare annotation is: (let ((.cse14 (= ~q_free~0 1)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse13 (= ~q_read_ev~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~q_req_up~0 0)) (.cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse4 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse5 (= ~p_dw_i~0 1)) (.cse7 (= ~q_free~0 0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (not (= ~q_write_ev~0 0)))) (or (let ((.cse8 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 ~p_num_write~0) .cse9 (<= ~p_num_write~0 .cse8) .cse10 .cse11 .cse12)) (and .cse13 .cse9 .cse10 .cse1 .cse12 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse16 .cse6 .cse9 .cse17 .cse10 .cse11 .cse12 .cse15) (and .cse7 .cse0 .cse9 .cse1 .cse10 .cse12 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse10 .cse12 .cse2 .cse3 .cse4 .cse14 .cse15 .cse5 .cse6) (and .cse1 .cse2 .cse14 .cse5 .cse16 .cse6 .cse13 .cse9 .cse17 .cse10 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse4 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse5 (= ~c_num_read~0 0) .cse7 .cse9 .cse10 .cse12 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)))) [2020-12-23 09:30:21,093 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 09:30:21,093 INFO L189 CegarLoopUtils]: For program point L251(lines 251 256) no Hoare annotation was computed. [2020-12-23 09:30:21,093 INFO L189 CegarLoopUtils]: For program point L251-1(lines 251 256) no Hoare annotation was computed. [2020-12-23 09:30:21,094 INFO L192 CegarLoopUtils]: At program point L466(lines 457 468) the Hoare annotation is: true [2020-12-23 09:30:21,094 INFO L189 CegarLoopUtils]: For program point L285-1(lines 284 297) no Hoare annotation was computed. [2020-12-23 09:30:21,094 INFO L189 CegarLoopUtils]: For program point L285-3(lines 284 297) no Hoare annotation was computed. [2020-12-23 09:30:21,094 INFO L189 CegarLoopUtils]: For program point L120(lines 120 128) no Hoare annotation was computed. [2020-12-23 09:30:21,094 INFO L185 CegarLoopUtils]: At program point L87(lines 75 89) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,095 INFO L185 CegarLoopUtils]: At program point L87-1(lines 75 89) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse17 (= ~q_read_ev~0 1)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ~q_free~0 1)) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (not .cse19)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse6 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse7 (= ~p_dw_i~0 1)) (.cse12 (= ~c_dr_pc~0 1)) (.cse8 (= ~q_free~0 0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (not (= ~q_write_ev~0 0))) (.cse20 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7 (= ~c_num_read~0 0) .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (let ((.cse13 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8 (<= .cse13 ~p_num_write~0) .cse9 (<= ~p_num_write~0 .cse13) .cse10 .cse14 .cse11)) (and .cse5 .cse15 .cse16 .cse7 .cse12 .cse17 .cse9 .cse18 .cse19 .cse10 .cse14 .cse11 .cse20) (and .cse17 .cse9 .cse10 .cse2 .cse11 .cse3 .cse5 .cse15 .cse20 .cse7 .cse12) (and .cse2 .cse3 .cse5 .cse15 .cse16 .cse7 .cse12 .cse9 .cse18 .cse10 .cse14 .cse11 .cse20) (and .cse5 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse7 .cse12 .cse9 .cse10 .cse11 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8 .cse9 .cse10 .cse11 .cse20)))))) [2020-12-23 09:30:21,095 INFO L192 CegarLoopUtils]: At program point L434(lines 397 439) the Hoare annotation is: true [2020-12-23 09:30:21,095 INFO L185 CegarLoopUtils]: At program point L88(lines 72 90) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_num_write~0 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,095 INFO L185 CegarLoopUtils]: At program point L88-1(lines 72 90) the Hoare annotation is: (let ((.cse20 (= ~p_dw_st~0 0))) (let ((.cse18 (= ~q_read_ev~0 1)) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse8 (= ~q_free~0 0)) (.cse2 (not .cse20)) (.cse3 (= ~q_req_up~0 0)) (.cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse16 (= ~q_free~0 1)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse19 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (not (= ~q_write_ev~0 0))) (.cse21 (not (= ~q_write_ev~0 1)))) (or (let ((.cse9 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 ~p_num_write~0) .cse10 (<= ~p_num_write~0 .cse9) .cse11 .cse12 .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 (= ~c_dr_pc~0 0) .cse6 (= ~c_num_read~0 0) .cse8 .cse10 .cse11 .cse13 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (and .cse14 .cse15 .cse16 .cse17 .cse6 .cse7 .cse18 .cse10 .cse19 .cse20 .cse11 .cse12 .cse13 .cse21) (and .cse18 .cse10 .cse11 .cse2 .cse13 .cse3 .cse14 .cse15 .cse16 .cse21 .cse6 .cse7) (and .cse14 .cse15 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse10 .cse11 .cse13 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse21))) (and .cse2 .cse3 .cse14 .cse15 .cse16 .cse17 .cse6 .cse7 .cse10 .cse19 .cse11 .cse12 .cse13 .cse21)))) [2020-12-23 09:30:21,095 INFO L189 CegarLoopUtils]: For program point L336(lines 336 340) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L189 CegarLoopUtils]: For program point L336-1(lines 331 371) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L189 CegarLoopUtils]: For program point L386(lines 386 391) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L189 CegarLoopUtils]: For program point L123(lines 123 127) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L189 CegarLoopUtils]: For program point L57(lines 57 66) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L189 CegarLoopUtils]: For program point L57-2(lines 57 66) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L189 CegarLoopUtils]: For program point L57-3(lines 57 66) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L189 CegarLoopUtils]: For program point L57-5(lines 57 66) no Hoare annotation was computed. [2020-12-23 09:30:21,096 INFO L185 CegarLoopUtils]: At program point L272-1(lines 263 280) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,097 INFO L189 CegarLoopUtils]: For program point L173(lines 172 203) no Hoare annotation was computed. [2020-12-23 09:30:21,097 INFO L185 CegarLoopUtils]: At program point L272-3(lines 263 280) the Hoare annotation is: (let ((.cse10 (= ~q_free~0 1)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse0 (= ~q_free~0 0)) (.cse1 (not (= ~c_dr_st~0 0))) (.cse2 (= ~q_read_ev~0 2)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse5 (not (= ~q_write_ev~0 0))) (.cse6 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse9) (and .cse1 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse3 .cse11 .cse5 .cse6 .cse10 .cse7 .cse8 (<= ~c_num_read~0 ~p_num_write~0) .cse9) (and .cse2 .cse3 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse6 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse0 .cse1 .cse4 .cse5 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse0 (<= .cse12 ~p_num_write~0) .cse1 .cse2 (<= ~p_num_write~0 .cse12) .cse3 .cse4 .cse11 .cse5 .cse6 .cse8 .cse9)))) [2020-12-23 09:30:21,097 INFO L185 CegarLoopUtils]: At program point L454(lines 440 456) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,097 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 09:30:21,097 INFO L189 CegarLoopUtils]: For program point L190(lines 190 202) no Hoare annotation was computed. [2020-12-23 09:30:21,097 INFO L189 CegarLoopUtils]: For program point L58(lines 58 63) no Hoare annotation was computed. [2020-12-23 09:30:21,097 INFO L189 CegarLoopUtils]: For program point L58-1(lines 58 63) no Hoare annotation was computed. [2020-12-23 09:30:21,098 INFO L185 CegarLoopUtils]: At program point L372(lines 324 377) the Hoare annotation is: (let ((.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse13 (= ~q_free~0 1)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_req_up~0 1)) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse12 (= ~q_req_up~0 0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse19 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_dw_i~0 1)) (.cse20 (= ~c_num_read~0 0)) (.cse4 (= ~q_free~0 0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (= ~q_write_ev~0 0))) (.cse21 (<= ~p_num_write~0 1)) (.cse22 (<= 1 ~p_num_write~0)) (.cse11 (not (= ~q_write_ev~0 1)))) (or (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 ~p_num_write~0) .cse6 .cse7 (<= ~p_num_write~0 .cse5) .cse8 .cse9 .cse10 .cse11)) (and .cse4 .cse7 .cse0 .cse1 .cse8 .cse10 .cse12 .cse11 .cse2 .cse3) (and .cse7 .cse0 .cse1 .cse8 .cse10 .cse12 .cse13 .cse11 .cse2 .cse3) (and .cse1 .cse14 .cse12 .cse15 .cse16 .cse13 .cse17 .cse2 .cse3 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11) (and .cse6 .cse7 .cse18 .cse8 .cse1 .cse9 .cse10 .cse13 .cse11 .cse2 .cse17 .cse3) (and .cse0 .cse1 .cse14 .cse15 .cse16 .cse19 .cse2 .cse20 .cse4 .cse6 .cse7 .cse8 .cse21 .cse22 (= ~q_write_ev~0 ~q_read_ev~0)) (and .cse0 .cse1 .cse14 .cse12 .cse15 .cse16 .cse19 .cse2 .cse20 .cse4 .cse7 .cse8 .cse10 .cse21 .cse22 .cse11))) [2020-12-23 09:30:21,098 INFO L189 CegarLoopUtils]: For program point L174-1(lines 174 184) no Hoare annotation was computed. [2020-12-23 09:30:21,098 INFO L185 CegarLoopUtils]: At program point L356(lines 331 371) the Hoare annotation is: (let ((.cse22 (= ~p_dw_st~0 0)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse17 (<= .cse31 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 .cse31)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse0 (= ~q_req_up~0 1)) (.cse4 (not .cse22)) (.cse24 (= ~c_dr_pc~0 0)) (.cse12 (= ~q_free~0 0)) (.cse6 (not (= ~q_write_ev~0 0))) (.cse29 (<= ~p_num_write~0 1)) (.cse30 (<= 1 ~p_num_write~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse13 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse14 (= ~q_read_ev~0 2)) (.cse15 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse19 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse16 (= ~q_req_up~0 0)) (.cse20 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= ~p_num_write~0 0)) (.cse21 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse7 (= ~q_free~0 1)) (.cse10 (= ~p_dw_i~0 1)) (.cse25 (= ~c_num_read~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse26 (= ~p_dw_pc~0 0)) (.cse1 (not (= ~c_dr_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= ~q_write_ev~0 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (or (and .cse12 .cse13 .cse14 .cse4 .cse3 .cse15 .cse16 .cse6 .cse8 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse3 .cse15 .cse16 .cse6 .cse7 .cse8 .cse10 .cse11)) .cse17 .cse18 .cse5) (and .cse14 .cse4 .cse10 .cse11 .cse12 .cse17 .cse0 .cse1 .cse18 .cse3 .cse5 .cse6 .cse8) (and .cse12 .cse1 .cse14 .cse4 .cse3 .cse6 .cse16 .cse8 .cse10 .cse11) (and .cse4 .cse19 .cse16 .cse20 .cse21 .cse7 .cse9 .cse10 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (and .cse13 .cse14 .cse15 .cse7 .cse10 .cse9 .cse11 .cse1 .cse2 .cse22 .cse3 .cse5 .cse6 .cse8) (and .cse1 .cse14 .cse4 .cse3 .cse16 .cse6 .cse7 .cse8 .cse10 .cse11) (and .cse14 .cse19 .cse16 .cse20 .cse23 .cse21 .cse24 .cse7 .cse10 .cse25 .cse26 .cse22 .cse3 .cse27 .cse28) (and .cse13 .cse14 .cse4 .cse19 .cse15 .cse20 .cse21 .cse24 .cse10 .cse25 .cse12 .cse0 .cse3 .cse5 .cse29 .cse30 .cse28) (and .cse14 .cse4 .cse19 .cse20 .cse21 .cse24 .cse10 .cse25 .cse12 .cse0 .cse1 .cse3 .cse29 .cse30 .cse28) (and .cse14 .cse4 .cse19 .cse16 .cse20 .cse21 .cse24 .cse10 .cse25 .cse12 .cse1 .cse3 .cse6 .cse29 .cse30 .cse8) (and .cse13 .cse14 .cse15 .cse19 .cse16 .cse20 .cse23 .cse21 .cse7 .cse10 .cse25 .cse11 .cse26 .cse1 .cse3 .cse27 .cse28 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))))) [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L191(lines 191 197) no Hoare annotation was computed. [2020-12-23 09:30:21,099 INFO L185 CegarLoopUtils]: At program point L290-3(lines 281 298) the Hoare annotation is: (let ((.cse16 (= ~p_dw_st~0 0))) (let ((.cse6 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse5 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 1)) (.cse15 (= ~q_read_ev~0 2)) (.cse0 (not .cse16)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse2 (= ~q_req_up~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse7 (= ~p_dw_i~0 1)) (.cse18 (= ~q_free~0 0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (not (= ~q_write_ev~0 0))) (.cse14 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13 .cse14) (let ((.cse17 (+ ~c_num_read~0 1))) (and (<= .cse17 ~p_num_write~0) (<= ~p_num_write~0 .cse17) .cse12 (or (and .cse18 .cse15 .cse0 .cse11 .cse13 .cse2 .cse14 .cse7 .cse8) (and .cse15 .cse0 .cse11 .cse13 .cse2 .cse5 .cse14 .cse7 .cse8)))) (and (or (and .cse18 .cse9 .cse15 .cse0 .cse11 .cse13 .cse2 .cse14 .cse7 .cse8) (and .cse9 .cse15 .cse0 .cse11 .cse13 .cse2 .cse5 .cse14 .cse7 .cse8)) .cse1) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) .cse7 (= ~c_num_read~0 0) .cse18 .cse9 .cse11 .cse13 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse14)))) [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L307(lines 307 311) no Hoare annotation was computed. [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L307-2(lines 307 311) no Hoare annotation was computed. [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L307-3(lines 307 311) no Hoare annotation was computed. [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L307-5(lines 307 311) no Hoare annotation was computed. [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L76(lines 76 85) no Hoare annotation was computed. [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L76-2(lines 76 85) no Hoare annotation was computed. [2020-12-23 09:30:21,099 INFO L189 CegarLoopUtils]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2020-12-23 09:30:21,100 INFO L189 CegarLoopUtils]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2020-12-23 09:30:21,100 INFO L189 CegarLoopUtils]: For program point L27(lines 27 31) no Hoare annotation was computed. [2020-12-23 09:30:21,100 INFO L189 CegarLoopUtils]: For program point L27-2(lines 26 41) no Hoare annotation was computed. [2020-12-23 09:30:21,100 INFO L189 CegarLoopUtils]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2020-12-23 09:30:21,100 INFO L189 CegarLoopUtils]: For program point L27-5(lines 26 41) no Hoare annotation was computed. [2020-12-23 09:30:21,101 INFO L185 CegarLoopUtils]: At program point L341(lines 331 371) the Hoare annotation is: (let ((.cse30 (= ~p_dw_st~0 0)) (.cse32 (+ ~c_num_read~0 1))) (let ((.cse9 (= ~q_req_up~0 1)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (<= .cse32 ~p_num_write~0)) (.cse24 (<= ~p_num_write~0 .cse32)) (.cse20 (= ~p_dw_pc~0 1)) (.cse25 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse26 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse28 (= ~p_num_write~0 0)) (.cse16 (= ~q_free~0 1)) (.cse18 (= ~c_dr_pc~0 1)) (.cse29 (= ~p_dw_pc~0 0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (not .cse30)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse27 (= ~q_req_up~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (= ~c_num_read~0 0)) (.cse8 (= ~q_free~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (not (= ~q_write_ev~0 0))) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (<= 1 ~p_num_write~0)) (.cse22 (not (= ~q_write_ev~0 1))) (.cse14 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse16 .cse6 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse0 .cse1 .cse6 .cse18 .cse8 .cse23 .cse9 .cse10 .cse24 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse25 .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse20 .cse12 .cse13 .cse15 .cse14) (and .cse8 .cse10 .cse0 .cse1 .cse11 .cse27 .cse21 .cse22 .cse6 .cse14 .cse18) (and .cse10 .cse0 .cse1 .cse11 .cse21 .cse27 .cse16 .cse22 .cse6 .cse14 .cse18) (and .cse25 .cse0 .cse26 .cse2 .cse27 .cse3 .cse28 .cse4 .cse5 .cse16 .cse6 .cse7 .cse29 .cse30 .cse11 .cse31 .cse15 .cse14) (and .cse25 .cse0 .cse26 .cse16 .cse6 .cse17 .cse18 .cse10 .cse30 .cse19 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse16 .cse17 .cse6 .cse18 .cse10 .cse19 .cse11 .cse20 .cse21 .cse22 .cse14) (and .cse23 .cse24 .cse20 (or (and .cse25 .cse0 .cse1 .cse11 .cse26 .cse21 .cse27 .cse16 .cse22 .cse6 .cse14 .cse18) (and .cse8 .cse25 .cse0 .cse1 .cse11 .cse26 .cse21 .cse27 .cse22 .cse6 .cse14 .cse18))) (and .cse25 .cse0 .cse26 .cse2 .cse27 .cse3 .cse28 .cse4 .cse16 .cse6 .cse7 .cse18 .cse29 .cse10 .cse11 .cse31 .cse15 .cse14) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14)))) [2020-12-23 09:30:21,101 INFO L189 CegarLoopUtils]: For program point L77(lines 77 82) no Hoare annotation was computed. [2020-12-23 09:30:21,101 INFO L189 CegarLoopUtils]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2020-12-23 09:30:21,101 INFO L185 CegarLoopUtils]: At program point L259(lines 246 261) the Hoare annotation is: (let ((.cse27 (= ~p_dw_st~0 0)) (.cse30 (+ ~c_num_read~0 1))) (let ((.cse28 (<= .cse30 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 .cse30)) (.cse26 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~p_dw_pc~0 1)) (.cse25 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse19 (= ~q_req_up~0 1)) (.cse16 (not .cse27)) (.cse18 (= ~q_free~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse23 (not (= ~q_write_ev~0 0))) (.cse21 (<= ~p_num_write~0 1)) (.cse22 (<= 1 ~p_num_write~0)) (.cse24 (not (= ~q_write_ev~0 1))) (.cse0 (= ~q_read_ev~0 2)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse5 (= ~p_num_write~0 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= ~p_dw_pc~0 0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~q_write_ev~0 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (and .cse0 .cse16 .cse2 .cse1 .cse4 .cse6 .cse17 .cse8 .cse9 .cse18 .cse19 .cse13 .cse20 .cse21 .cse22 .cse15) (and .cse18 .cse12 .cse0 .cse16 .cse13 .cse23 .cse3 .cse24 .cse8 .cse10) (and .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse8 .cse10 .cse12 .cse26 .cse13 .cse20 .cse23 .cse24) (and .cse0 .cse1 .cse7 .cse8 .cse25 .cse10 .cse12 .cse26 .cse27 .cse13 .cse20 .cse23 .cse24) (and .cse28 (or (and .cse18 .cse0 .cse16 .cse13 .cse1 .cse3 .cse23 .cse24 .cse8 .cse10) (and .cse0 .cse16 .cse13 .cse1 .cse23 .cse3 .cse7 .cse24 .cse8 .cse10)) .cse29 .cse20) (and .cse12 .cse0 .cse16 .cse13 .cse3 .cse23 .cse7 .cse24 .cse8 .cse10) (and .cse0 .cse16 .cse8 .cse10 .cse18 .cse19 .cse28 .cse12 .cse29 .cse13 .cse20 .cse23 .cse24) (and .cse19 .cse12 .cse26 .cse13 .cse16 .cse20 .cse23 .cse7 .cse24 .cse8 .cse25 .cse10) (and .cse0 .cse16 .cse2 .cse4 .cse6 .cse17 .cse8 .cse9 .cse18 .cse19 .cse12 .cse13 .cse21 .cse22 .cse15) (and .cse0 .cse16 .cse2 .cse3 .cse4 .cse6 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse23 .cse21 .cse22 .cse24) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse6 .cse5 .cse17 .cse7 .cse8 .cse9 .cse11 .cse27 .cse13 .cse14 .cse15)))) [2020-12-23 09:30:21,102 INFO L185 CegarLoopUtils]: At program point L259-1(lines 246 261) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse6 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse12 (= ~q_free~0 1)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse18 (<= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_dw_pc~0 1)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (not .cse19)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse8 (= ~q_req_up~0 0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (= ~p_dw_i~0 1)) (.cse2 (= ~q_free~0 0)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (not (= ~q_write_ev~0 0))) (.cse9 (not (= ~q_write_ev~0 1)))) (or (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (<= ~p_num_write~0 .cse0) .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse10 .cse11)))) (and .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse3 .cse14 .cse6 .cse15 .cse16 .cse12 .cse17 .cse10 .cse11 .cse13 .cse18 .cse19 .cse5 .cse1 .cse7 .cse9) (and .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse12 .cse9 .cse10 .cse11) (and .cse4 .cse14 .cse8 .cse15 .cse16 .cse12 .cse17 .cse10 .cse11 .cse13 .cse18 .cse5 .cse1 .cse7 .cse9) (and .cse3 .cse4 .cse14 .cse8 .cse15 .cse16 (= ~c_dr_pc~0 0) .cse10 (= ~c_num_read~0 0) .cse2 .cse13 .cse5 .cse7 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse9)))) [2020-12-23 09:30:21,102 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 09:30:21,102 INFO L189 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-23 09:30:21,102 INFO L189 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-12-23 09:30:21,102 INFO L185 CegarLoopUtils]: At program point L260(lines 243 262) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse12 (<= .cse31 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 .cse31)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse22 (= ~q_req_up~0 1)) (.cse3 (not .cse21)) (.cse24 (= ~c_dr_pc~0 0)) (.cse0 (= ~q_free~0 0)) (.cse7 (not (= ~q_write_ev~0 0))) (.cse29 (<= ~p_num_write~0 1)) (.cse30 (<= 1 ~p_num_write~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse1 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse2 (= ~q_read_ev~0 2)) (.cse5 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse6 (= ~q_req_up~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= ~p_num_write~0 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse11 (= ~q_free~0 1)) (.cse9 (= ~p_dw_i~0 1)) (.cse25 (= ~c_num_read~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse26 (= ~p_dw_pc~0 0)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= ~q_write_ev~0 ~q_read_ev~0))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9 .cse10)) .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse2 .cse3 .cse4 .cse7 .cse6 .cse8 .cse9 .cse10) (and .cse3 .cse16 .cse6 .cse17 .cse18 .cse11 .cse19 .cse9 .cse10 .cse15 .cse20 .cse4 .cse14 .cse7 .cse8) (and .cse1 .cse2 .cse5 .cse11 .cse9 .cse19 .cse10 .cse15 .cse20 .cse21 .cse4 .cse14 .cse7 .cse8) (and .cse15 .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse2 .cse3 .cse9 .cse10 .cse0 .cse22 .cse12 .cse15 .cse13 .cse4 .cse14 .cse7 .cse8) (and .cse1 .cse2 .cse16 .cse5 .cse6 .cse17 .cse18 .cse23 .cse24 .cse11 .cse9 .cse25 .cse26 .cse21 .cse4 .cse27 .cse28) (and .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 .cse18 .cse24 .cse9 .cse25 .cse0 .cse22 .cse4 .cse14 .cse29 .cse30 .cse28) (and .cse22 .cse15 .cse20 .cse4 .cse3 .cse14 .cse7 .cse11 .cse8 .cse9 .cse19 .cse10) (and .cse2 .cse3 .cse16 .cse17 .cse18 .cse24 .cse9 .cse25 .cse0 .cse22 .cse15 .cse4 .cse29 .cse30 .cse28) (and .cse2 .cse3 .cse16 .cse6 .cse17 .cse18 .cse24 .cse9 .cse25 .cse0 .cse15 .cse4 .cse7 .cse29 .cse30 .cse8) (and .cse1 .cse2 .cse5 .cse16 .cse6 .cse17 .cse23 .cse18 .cse11 .cse9 .cse25 .cse10 .cse26 .cse15 .cse4 .cse27 .cse28 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))))) [2020-12-23 09:30:21,103 INFO L185 CegarLoopUtils]: At program point L260-1(lines 243 262) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse17 (= ~q_free~0 0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse18 (not .cse11)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse15 (not (= ~q_write_ev~0 0))) (.cse19 (= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 1)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9) (and .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse17 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16) (let ((.cse20 (+ ~c_num_read~0 1))) (and (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20) .cse14 (or (and .cse17 .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9))))))) [2020-12-23 09:30:21,103 INFO L189 CegarLoopUtils]: For program point L161(lines 161 169) no Hoare annotation was computed. [2020-12-23 09:30:21,103 INFO L185 CegarLoopUtils]: At program point L13-1(lines 160 208) the Hoare annotation is: (let ((.cse16 (= ~p_dw_st~0 0))) (let ((.cse1 (not .cse16)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 0))) (.cse9 (not (= ~q_write_ev~0 1))) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse11 (= ~q_read_ev~0 2)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse14 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse15 (= ~c_num_read~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~c_num_read~0 ~p_num_write~0) (= ~q_req_up~0 1) .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse4 .cse15 (= ~q_free~0 0) .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse9 .cse10) (and .cse0 .cse11 .cse2 .cse12 (= ~q_req_up~0 0) .cse13 (= ~p_num_write~0 0) .cse14 .cse3 .cse4 .cse15 (= ~p_dw_pc~0 0) .cse5 .cse16 .cse6 (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse10)))) [2020-12-23 09:30:21,104 INFO L185 CegarLoopUtils]: At program point L393(lines 382 395) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse17 (= ~q_free~0 0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse18 (not .cse11)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse15 (not (= ~q_write_ev~0 0))) (.cse19 (= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 1)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9) (and .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse17 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16) (let ((.cse20 (+ ~c_num_read~0 1))) (and (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20) .cse14 (or (and .cse17 .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9))))))) [2020-12-23 09:30:21,104 INFO L189 CegarLoopUtils]: For program point L360(lines 360 367) no Hoare annotation was computed. [2020-12-23 09:30:21,104 INFO L185 CegarLoopUtils]: At program point L394(lines 378 396) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse17 (= ~q_free~0 0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse18 (not .cse11)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse15 (not (= ~q_write_ev~0 0))) (.cse19 (= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 1)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9) (and .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 (= ~c_dr_pc~0 0) .cse8 (= ~c_num_read~0 0) .cse17 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16) (let ((.cse20 (+ ~c_num_read~0 1))) (and (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20) .cse14 (or (and .cse17 .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9))))))) [2020-12-23 09:30:21,104 INFO L189 CegarLoopUtils]: For program point L229-1(lines 228 241) no Hoare annotation was computed. [2020-12-23 09:30:21,105 INFO L185 CegarLoopUtils]: At program point L411-1(lines 281 433) the Hoare annotation is: (let ((.cse11 (= ~p_dw_st~0 0))) (let ((.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse21 (= ~c_num_read~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse14 (= ~p_dw_pc~0 1)) (.cse17 (= ~q_free~0 0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse18 (not .cse11)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse15 (not (= ~q_write_ev~0 0))) (.cse19 (= ~q_req_up~0 0)) (.cse6 (= ~q_free~0 1)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse10 .cse1 .cse18 .cse13 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9) (and .cse18 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse3 .cse19 .cse4 (= ~p_num_write~0 0) .cse5 .cse20 .cse6 .cse8 .cse21 (= ~p_dw_pc~0 0) .cse11 .cse13 (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) (and .cse1 .cse18 .cse3 .cse19 .cse4 .cse5 .cse20 .cse8 .cse21 .cse17 .cse10 .cse13 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse16) (let ((.cse22 (+ ~c_num_read~0 1))) (and (<= .cse22 ~p_num_write~0) (<= ~p_num_write~0 .cse22) .cse14 (or (and .cse17 .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse16 .cse8 .cse9) (and .cse0 .cse1 .cse18 .cse13 .cse2 .cse15 .cse19 .cse6 .cse16 .cse8 .cse9))))))) [2020-12-23 09:30:21,105 INFO L189 CegarLoopUtils]: For program point L345(lines 345 352) no Hoare annotation was computed. [2020-12-23 09:30:21,105 INFO L189 CegarLoopUtils]: For program point L428(lines 428 432) no Hoare annotation was computed. [2020-12-23 09:30:21,105 INFO L189 CegarLoopUtils]: For program point L164(lines 164 168) no Hoare annotation was computed. [2020-12-23 09:30:21,105 INFO L185 CegarLoopUtils]: At program point L131-1(lines 119 154) the Hoare annotation is: (let ((.cse8 (= ~q_req_up~0 1)) (.cse19 (<= ~p_num_write~0 1)) (.cse20 (<= 1 ~p_num_write~0)) (.cse6 (= ~q_free~0 0)) (.cse11 (not (= ~q_write_ev~0 0))) (.cse12 (not (= ~q_write_ev~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse22 (= ~q_req_up~0 0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (= ~p_num_write~0 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse24 (= ~q_free~0 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse18 (= ~c_num_read~0 0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (let ((.cse7 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 ~p_num_write~0) .cse8 .cse9 (<= ~p_num_write~0 .cse7) .cse10 (= ~p_dw_pc~0 1) .cse11 .cse12 .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse6 .cse8 .cse10 .cse19 .cse20 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse19 .cse20 .cse12 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse22 .cse15 .cse23 .cse16 .cse17 .cse24 .cse4 .cse18 .cse10 .cse21 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse22 .cse15 .cse23 .cse16 .cse24 .cse4 .cse18 .cse5 .cse9 .cse10 .cse21 .cse13))) [2020-12-23 09:30:21,105 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L189 CegarLoopUtils]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L189 CegarLoopUtils]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L189 CegarLoopUtils]: For program point L412(line 412) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L189 CegarLoopUtils]: For program point L247(lines 247 257) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L189 CegarLoopUtils]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L189 CegarLoopUtils]: For program point L247-1(lines 247 257) no Hoare annotation was computed. [2020-12-23 09:30:21,106 INFO L185 CegarLoopUtils]: At program point L214-1(lines 229 233) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_req_up~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,107 INFO L189 CegarLoopUtils]: For program point L214-2(lines 214 220) no Hoare annotation was computed. [2020-12-23 09:30:21,107 INFO L185 CegarLoopUtils]: At program point L214-3(lines 210 224) the Hoare annotation is: (let ((.cse8 (not (= ~q_write_ev~0 0))) (.cse10 (= ~q_free~0 1)) (.cse4 (= ~q_free~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse2 (= ~q_req_up~0 0)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse3 (= ~p_dw_i~0 1)) (.cse9 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse7) (and .cse4 .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse7 .cse3 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse8 .cse2 .cse10 .cse7 .cse3 .cse9) (and .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse1 .cse11 .cse8 .cse2 .cse10 .cse7 .cse3 (<= ~c_num_read~0 ~p_num_write~0) .cse9) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse4 (<= .cse12 ~p_num_write~0) .cse5 .cse0 (<= ~p_num_write~0 .cse12) .cse1 .cse6 .cse11 .cse2 .cse7 .cse3 .cse9)))) [2020-12-23 09:30:21,107 INFO L185 CegarLoopUtils]: At program point L165(lines 160 208) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) (not (= ~p_dw_st~0 0)) (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0)) (= ~p_dw_i~0 1) (= ~c_dr_pc~0 1) (<= .cse0 ~p_num_write~0) (not (= ~c_dr_st~0 0)) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 0)) (not (= ~q_write_ev~0 1)) (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) [2020-12-23 09:30:21,107 INFO L189 CegarLoopUtils]: For program point L132(lines 131 149) no Hoare annotation was computed. [2020-12-23 09:30:21,107 INFO L185 CegarLoopUtils]: At program point L133(lines 119 154) the Hoare annotation is: (let ((.cse5 (= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse8 (not (= ~q_write_ev~0 1))) (.cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse1 (= ~q_read_ev~0 2)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse15 (= ~c_num_read~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp___1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 0)) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~c_dr_pc~0 0) .cse4 .cse15 .cse7 .cse16 .cse9))) [2020-12-23 09:30:21,108 INFO L189 CegarLoopUtils]: For program point L315(lines 315 319) no Hoare annotation was computed. [2020-12-23 09:30:21,108 INFO L185 CegarLoopUtils]: At program point L315-2(lines 285 289) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_num_write~0 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,108 INFO L189 CegarLoopUtils]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2020-12-23 09:30:21,108 INFO L185 CegarLoopUtils]: At program point L315-5(lines 285 289) the Hoare annotation is: (let ((.cse22 (= ~p_dw_st~0 0))) (let ((.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse16 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 1)) (.cse21 (= ~q_read_ev~0 1)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse0 (= ~q_read_ev~0 2)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (not .cse22)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse6 (= ~p_dw_i~0 1)) (.cse8 (= ~q_free~0 0)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (not (= ~q_write_ev~0 0)))) (or (let ((.cse9 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse9 ~p_num_write~0) (<= ~p_num_write~0 .cse9) .cse10 .cse11 .cse12)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse15 .cse5 .cse16 .cse6 .cse7 .cse17 .cse10 .cse12 .cse18) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse12) (and .cse2 .cse13 .cse3 .cse14 .cse15 .cse16 .cse19 .cse6 .cse7 .cse17 .cse20 .cse10 .cse11 .cse12 .cse18) (and .cse13 .cse14 .cse15 .cse16 .cse19 .cse6 .cse7 .cse21 .cse17 .cse20 .cse22 .cse10 .cse11 .cse12 .cse18) (and .cse2 .cse13 .cse3 .cse14 .cse15 .cse16 .cse6 .cse7 .cse21 .cse17 .cse10 .cse12 .cse18) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse15 (= ~c_dr_pc~0 0) .cse6 (= ~c_num_read~0 0) .cse8 .cse17 .cse10 .cse12 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))))) [2020-12-23 09:30:21,108 INFO L189 CegarLoopUtils]: For program point L332(line 332) no Hoare annotation was computed. [2020-12-23 09:30:21,108 INFO L185 CegarLoopUtils]: At program point L68(lines 56 70) the Hoare annotation is: (and (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 ~q_read_ev~0)) [2020-12-23 09:30:21,109 INFO L185 CegarLoopUtils]: At program point L68-1(lines 56 70) the Hoare annotation is: (let ((.cse5 (<= ~c_num_read~0 ~p_num_write~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~q_free~0 0)) (.cse16 (= ~q_read_ev~0 1)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse11 (not (= ~q_write_ev~0 0))) (.cse1 (= ~q_req_up~0 0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (= ~q_free~0 1)) (.cse12 (not (= ~q_write_ev~0 1))) (.cse4 (= ~p_dw_i~0 1)) (.cse6 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse15 (+ ~c_num_read~0 1))) (and .cse13 .cse0 .cse1 .cse2 .cse4 .cse6 .cse14 (<= .cse15 ~p_num_write~0) .cse7 (<= ~p_num_write~0 .cse15) .cse9 .cse10 .cse11)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse13 .cse0 .cse9 .cse11 .cse1 .cse2 .cse3 .cse12 .cse4 .cse6) (and .cse14 .cse7 .cse13 .cse0 .cse9 .cse11 .cse1 .cse2 .cse12 .cse4 .cse6) (and .cse13 .cse0 .cse1 .cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~c_dr_pc~0 0) .cse4 (= ~c_num_read~0 0) .cse14 .cse7 .cse9 .cse11 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0)) (and .cse16 .cse7 .cse9 .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse4 .cse6))) [2020-12-23 09:30:21,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:30:21 BoogieIcfgContainer [2020-12-23 09:30:21,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:30:21,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:30:21,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:30:21,233 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:30:21,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:57" (3/4) ... [2020-12-23 09:30:21,237 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 09:30:21,261 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-23 09:30:21,262 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 09:30:21,262 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:30:21,263 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:30:21,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((q_read_ev == 2 && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-12-23 09:30:21,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-12-23 09:30:21,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-12-23 09:30:21,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((q_read_ev == 2 && tmp == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev [2020-12-23 09:30:21,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) [2020-12-23 09:30:21,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_dw_pc == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-12-23 09:30:21,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-12-23 09:30:21,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) [2020-12-23 09:30:21,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1) [2020-12-23 09:30:21,298 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && ((((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) [2020-12-23 09:30:21,298 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-12-23 09:30:21,298 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(tmp___1 == 0)) && q_write_ev == q_read_ev) || ((((((((((((!(p_dw_st == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) || ((((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && ((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0)) [2020-12-23 09:30:21,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) [2020-12-23 09:30:21,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) || (((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_free == 0 && q_read_ev == 2) && !(c_dr_st == 0)) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) [2020-12-23 09:30:21,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-12-23 09:30:21,300 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-12-23 09:30:21,300 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) [2020-12-23 09:30:21,300 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0) [2020-12-23 09:30:21,300 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) || ((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((__retres1 == 0 && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (__retres1 == 0 && (((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)))) [2020-12-23 09:30:21,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) || ((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((((__retres1 == 0 && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((__retres1 == 0 && \result == 0) && (((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))))) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) [2020-12-23 09:30:21,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) || (((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && \result == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0))) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) [2020-12-23 09:30:21,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && tmp___0 == 0)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-12-23 09:30:21,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && ((((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-12-23 09:30:21,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) [2020-12-23 09:30:21,305 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) [2020-12-23 09:30:21,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) [2020-12-23 09:30:21,373 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/pc_sfifo_2.cil-1.c-witness.graphml [2020-12-23 09:30:21,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:30:21,375 INFO L168 Benchmark]: Toolchain (without parser) took 24929.83 ms. Allocated memory was 152.0 MB in the beginning and 464.5 MB in the end (delta: 312.5 MB). Free memory was 126.3 MB in the beginning and 319.1 MB in the end (delta: -192.8 MB). Peak memory consumption was 120.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:30:21,375 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 152.0 MB. Free memory is still 134.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:30:21,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.13 ms. Allocated memory is still 152.0 MB. Free memory was 126.2 MB in the beginning and 112.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:30:21,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.84 ms. Allocated memory is still 152.0 MB. Free memory was 112.8 MB in the beginning and 110.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:30:21,377 INFO L168 Benchmark]: Boogie Preprocessor took 72.35 ms. Allocated memory is still 152.0 MB. Free memory was 110.6 MB in the beginning and 108.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:30:21,377 INFO L168 Benchmark]: RCFGBuilder took 639.28 ms. Allocated memory is still 152.0 MB. Free memory was 108.8 MB in the beginning and 108.2 MB in the end (delta: 577.8 kB). Peak memory consumption was 6.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:30:21,378 INFO L168 Benchmark]: TraceAbstraction took 23681.39 ms. Allocated memory was 152.0 MB in the beginning and 464.5 MB in the end (delta: 312.5 MB). Free memory was 107.8 MB in the beginning and 327.0 MB in the end (delta: -219.1 MB). Peak memory consumption was 262.0 MB. Max. memory is 8.0 GB. [2020-12-23 09:30:21,378 INFO L168 Benchmark]: Witness Printer took 140.82 ms. Allocated memory is still 464.5 MB. Free memory was 326.4 MB in the beginning and 319.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-12-23 09:30:21,382 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 152.0 MB. Free memory is still 134.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 329.13 ms. Allocated memory is still 152.0 MB. Free memory was 126.2 MB in the beginning and 112.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 56.84 ms. Allocated memory is still 152.0 MB. Free memory was 112.8 MB in the beginning and 110.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.35 ms. Allocated memory is still 152.0 MB. Free memory was 110.6 MB in the beginning and 108.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 639.28 ms. Allocated memory is still 152.0 MB. Free memory was 108.8 MB in the beginning and 108.2 MB in the end (delta: 577.8 kB). Peak memory consumption was 6.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23681.39 ms. Allocated memory was 152.0 MB in the beginning and 464.5 MB in the end (delta: 312.5 MB). Free memory was 107.8 MB in the beginning and 327.0 MB in the end (delta: -219.1 MB). Peak memory consumption was 262.0 MB. Max. memory is 8.0 GB. * Witness Printer took 140.82 ms. Allocated memory is still 464.5 MB. Free memory was 326.4 MB in the beginning and 319.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_dw_pc == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((q_read_ev == 2 && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(tmp___1 == 0)) && q_write_ev == q_read_ev) || ((((((((((((!(p_dw_st == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) || ((((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && ((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1) || (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && !(tmp___1 == 0)) && c_dr_pc == 1)))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0)) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)))) || (((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && tmp___0 == 0)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) || ((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((__retres1 == 0 && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (__retres1 == 0 && (((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)))) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: (((((((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && ((((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((!(c_dr_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_req_up == 0) && p_dw_i == 1) && c_dr_pc == 1) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && ((((((((((q_free == 0 && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || (((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) && p_num_write <= c_num_read + 1) && p_dw_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((q_read_ev == 2 && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) || (((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_free == 0 && q_read_ev == 2) && !(c_dr_st == 0)) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((q_read_ev == 2 && tmp == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && p_dw_i == 1) && c_dr_pc == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) || (((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && \result == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0))) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((((((!(\result == 0) && !(p_dw_st == 0)) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && q_req_up == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(tmp___1 == 0)) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && !(tmp___1 == 0))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) || ((((((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || (((((((((((((__retres1 == 0 && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((__retres1 == 0 && \result == 0) && (((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((q_read_ev == 2 && tmp == 0) && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && 0 == \result) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(q_write_ev == 1))))) || (((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && q_req_up == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && q_write_ev == q_read_ev - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((q_read_ev == 2 && tmp == 0) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && p_num_write == 0) && \result == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_dw_st == 0) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0))) || ((((((((((((!(p_dw_st == 0) && q_req_up == 0) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && q_req_up == 0) && __retres1 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write)) || ((((((((((q_read_ev == 1 && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_dw_st == 0) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1)) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((c_num_read + 1 <= p_num_write && p_num_write <= c_num_read + 1) && p_dw_pc == 1) && (((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && !(q_write_ev == 0)) && q_req_up == 0) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1))) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((q_read_ev == 2 && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_free == 0 && !(\result == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1) || ((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_dw_pc == 1) || (((((((((q_free == 0 && !(c_dr_st == 0)) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_req_up == 0) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((((!(p_dw_st == 0) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && q_free == 1) && c_num_read <= p_num_write) && p_dw_i == 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || (((((((((!(c_dr_st == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_req_up == 0) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_dr_pc == 1)) || ((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && p_dw_i == 1) && c_dr_pc == 1) && q_free == 0) && q_req_up == 1) && c_num_read + 1 <= p_num_write) && !(c_dr_st == 0)) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 0)) && !(q_write_ev == 1))) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && tmp___0 == 0) && !(__retres1 == 0)) && q_req_up == 0) && __retres1 == 0) && \result == 0) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_dw_pc == 0) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev)) || ((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(p_dw_st == 0)) && tmp___0 == 0) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((q_req_up == 1 && !(c_dr_st == 0)) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(p_dw_st == 0)) && p_dw_pc == 1) && !(q_write_ev == 0)) && q_free == 1) && !(q_write_ev == 1)) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && q_req_up == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && q_write_ev == q_read_ev)) || (((((((((((((((q_read_ev == 2 && !(p_dw_st == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0) && q_free == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || (((((((((((((((((!(\result == 0) && q_read_ev == 2) && !(__retres1 == 0)) && tmp___0 == 0) && q_req_up == 0) && __retres1 == 0) && p_num_write == 0) && \result == 0) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc == 0) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_write_ev == q_read_ev) && !(tmp___1 == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.9s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3203 SDtfs, 3766 SDslu, 5037 SDs, 0 SdLazy, 469 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4335occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 2545 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 405 NumberOfFragments, 7911 HoareAnnotationTreeSize, 33 FomulaSimplifications, 393775 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 33 FomulaSimplificationsInter, 53036 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1819 NumberOfCodeBlocks, 1819 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1796 ConstructedInterpolants, 0 QuantifiedInterpolants, 560866 SizeOfPredicates, 4 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 535/705 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...