/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 04:45:38,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 04:45:38,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 04:45:38,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 04:45:38,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 04:45:38,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 04:45:38,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 04:45:38,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 04:45:38,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 04:45:38,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 04:45:38,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 04:45:38,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 04:45:38,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 04:45:38,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 04:45:38,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 04:45:38,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 04:45:38,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 04:45:38,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 04:45:38,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 04:45:38,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 04:45:38,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 04:45:38,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 04:45:38,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 04:45:38,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 04:45:38,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 04:45:38,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 04:45:38,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 04:45:38,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 04:45:38,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 04:45:38,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 04:45:38,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 04:45:38,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 04:45:38,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 04:45:38,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 04:45:38,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 04:45:38,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 04:45:38,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 04:45:38,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 04:45:38,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 04:45:38,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 04:45:38,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 04:45:38,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 04:45:38,815 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 04:45:38,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 04:45:38,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 04:45:38,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 04:45:38,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 04:45:38,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 04:45:38,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 04:45:38,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 04:45:38,818 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 04:45:38,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 04:45:38,819 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 04:45:38,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 04:45:38,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 04:45:38,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 04:45:38,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 04:45:38,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:45:38,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 04:45:38,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 04:45:38,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 04:45:38,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 04:45:38,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 04:45:38,822 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 04:45:38,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 04:45:38,822 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 04:45:38,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 04:45:38,823 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 04:45:38,823 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-04-02 04:45:39,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 04:45:39,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 04:45:39,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 04:45:39,124 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 04:45:39,125 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 04:45:39,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2023-04-02 04:45:40,312 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 04:45:40,515 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 04:45:40,516 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2023-04-02 04:45:40,531 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/905dca33a/7a38ed44bb494ec3aee954736f721069/FLAGf28754f13 [2023-04-02 04:45:40,543 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/905dca33a/7a38ed44bb494ec3aee954736f721069 [2023-04-02 04:45:40,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 04:45:40,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 04:45:40,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 04:45:40,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 04:45:40,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 04:45:40,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3bd301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40, skipping insertion in model container [2023-04-02 04:45:40,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 04:45:40,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 04:45:40,730 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2023-04-02 04:45:40,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:45:40,823 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 04:45:40,832 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2023-04-02 04:45:40,868 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:45:40,890 INFO L208 MainTranslator]: Completed translation [2023-04-02 04:45:40,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40 WrapperNode [2023-04-02 04:45:40,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 04:45:40,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 04:45:40,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 04:45:40,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 04:45:40,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,951 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 04:45:40,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 04:45:40,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 04:45:40,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 04:45:40,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (1/1) ... [2023-04-02 04:45:40,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:45:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:45:41,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 04:45:41,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 04:45:41,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 04:45:41,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 04:45:41,048 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 04:45:41,048 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-04-02 04:45:41,048 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2023-04-02 04:45:41,048 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-04-02 04:45:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-04-02 04:45:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-04-02 04:45:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2023-04-02 04:45:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2023-04-02 04:45:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-04-02 04:45:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2023-04-02 04:45:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2023-04-02 04:45:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-04-02 04:45:41,051 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2023-04-02 04:45:41,052 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 04:45:41,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 04:45:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 04:45:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 04:45:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 04:45:41,167 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 04:45:41,169 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 04:45:41,508 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := ~a~0; [2023-04-02 04:45:41,508 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !(1 == ~q_free~0); [2023-04-02 04:45:41,529 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 04:45:41,537 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 04:45:41,538 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-04-02 04:45:41,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:45:41 BoogieIcfgContainer [2023-04-02 04:45:41,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 04:45:41,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 04:45:41,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 04:45:41,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 04:45:41,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 04:45:40" (1/3) ... [2023-04-02 04:45:41,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1a9001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:45:41, skipping insertion in model container [2023-04-02 04:45:41,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:45:40" (2/3) ... [2023-04-02 04:45:41,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1a9001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:45:41, skipping insertion in model container [2023-04-02 04:45:41,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:45:41" (3/3) ... [2023-04-02 04:45:41,548 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2023-04-02 04:45:41,562 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 04:45:41,563 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 04:45:41,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 04:45:41,615 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c6e1f50, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 04:45:41,615 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 04:45:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 104 states have (on average 1.4903846153846154) internal successors, (155), 112 states have internal predecessors, (155), 29 states have call successors, (29), 20 states have call predecessors, (29), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-04-02 04:45:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-04-02 04:45:41,641 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:45:41,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:45:41,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:45:41,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:45:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1931231778, now seen corresponding path program 1 times [2023-04-02 04:45:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:45:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890697009] [2023-04-02 04:45:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:45:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:45:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:45:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:45:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:45:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:45:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:45:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:45:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:45:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:45:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:45:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-02 04:45:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:45:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:45:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890697009] [2023-04-02 04:45:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890697009] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:45:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:45:42,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:45:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342186351] [2023-04-02 04:45:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:45:42,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:45:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:45:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:45:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:45:42,547 INFO L87 Difference]: Start difference. First operand has 156 states, 104 states have (on average 1.4903846153846154) internal successors, (155), 112 states have internal predecessors, (155), 29 states have call successors, (29), 20 states have call predecessors, (29), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:45:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:45:44,608 INFO L93 Difference]: Finished difference Result 630 states and 1050 transitions. [2023-04-02 04:45:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-02 04:45:44,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2023-04-02 04:45:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:45:44,634 INFO L225 Difference]: With dead ends: 630 [2023-04-02 04:45:44,635 INFO L226 Difference]: Without dead ends: 476 [2023-04-02 04:45:44,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2023-04-02 04:45:44,657 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1165 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:45:44,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 165 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 04:45:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-04-02 04:45:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 271. [2023-04-02 04:45:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 186 states have (on average 1.4086021505376345) internal successors, (262), 198 states have internal predecessors, (262), 49 states have call successors, (49), 35 states have call predecessors, (49), 35 states have return successors, (52), 47 states have call predecessors, (52), 45 states have call successors, (52) [2023-04-02 04:45:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 363 transitions. [2023-04-02 04:45:44,814 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 363 transitions. Word has length 78 [2023-04-02 04:45:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:45:44,814 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 363 transitions. [2023-04-02 04:45:44,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:45:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 363 transitions. [2023-04-02 04:45:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-04-02 04:45:44,818 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:45:44,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:45:44,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 04:45:44,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:45:44,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:45:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -504353634, now seen corresponding path program 1 times [2023-04-02 04:45:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:45:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639941648] [2023-04-02 04:45:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:45:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:45:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:45:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:45:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:45:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:45:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:45:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:45:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:45:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:45:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:45:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-02 04:45:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:45:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:45:45,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639941648] [2023-04-02 04:45:45,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639941648] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:45:45,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:45:45,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 04:45:45,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492225805] [2023-04-02 04:45:45,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:45:45,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 04:45:45,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:45:45,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 04:45:45,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-04-02 04:45:45,194 INFO L87 Difference]: Start difference. First operand 271 states and 363 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:45:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:45:47,277 INFO L93 Difference]: Finished difference Result 924 states and 1361 transitions. [2023-04-02 04:45:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-02 04:45:47,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 78 [2023-04-02 04:45:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:45:47,284 INFO L225 Difference]: With dead ends: 924 [2023-04-02 04:45:47,285 INFO L226 Difference]: Without dead ends: 680 [2023-04-02 04:45:47,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2023-04-02 04:45:47,292 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 914 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:45:47,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 136 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 04:45:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-04-02 04:45:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 416. [2023-04-02 04:45:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.4006968641114983) internal successors, (402), 307 states have internal predecessors, (402), 71 states have call successors, (71), 52 states have call predecessors, (71), 57 states have return successors, (89), 72 states have call predecessors, (89), 67 states have call successors, (89) [2023-04-02 04:45:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 562 transitions. [2023-04-02 04:45:47,396 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 562 transitions. Word has length 78 [2023-04-02 04:45:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:45:47,396 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 562 transitions. [2023-04-02 04:45:47,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-02 04:45:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 562 transitions. [2023-04-02 04:45:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-04-02 04:45:47,403 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:45:47,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:45:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 04:45:47,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:45:47,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:45:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash 882431776, now seen corresponding path program 1 times [2023-04-02 04:45:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:45:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636874411] [2023-04-02 04:45:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:45:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:45:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:45:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:45:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:45:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:45:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:45:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:45:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:45:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-04-02 04:45:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-04-02 04:45:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-02 04:45:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:45:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:45:47,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636874411] [2023-04-02 04:45:47,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636874411] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:45:47,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:45:47,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-02 04:45:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173659761] [2023-04-02 04:45:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:45:47,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 04:45:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:45:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 04:45:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-04-02 04:45:47,663 INFO L87 Difference]: Start difference. First operand 416 states and 562 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (15), 8 states have call predecessors, (15), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:45:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:45:49,859 INFO L93 Difference]: Finished difference Result 1475 states and 2146 transitions. [2023-04-02 04:45:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 04:45:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (15), 8 states have call predecessors, (15), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 78 [2023-04-02 04:45:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:45:49,866 INFO L225 Difference]: With dead ends: 1475 [2023-04-02 04:45:49,866 INFO L226 Difference]: Without dead ends: 1102 [2023-04-02 04:45:49,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2023-04-02 04:45:49,869 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 723 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:45:49,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 184 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-02 04:45:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2023-04-02 04:45:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 794. [2023-04-02 04:45:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 558 states have (on average 1.3781362007168458) internal successors, (769), 598 states have internal predecessors, (769), 125 states have call successors, (125), 94 states have call predecessors, (125), 110 states have return successors, (167), 126 states have call predecessors, (167), 121 states have call successors, (167) [2023-04-02 04:45:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1061 transitions. [2023-04-02 04:45:50,028 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1061 transitions. Word has length 78 [2023-04-02 04:45:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:45:50,029 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1061 transitions. [2023-04-02 04:45:50,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (15), 8 states have call predecessors, (15), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:45:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1061 transitions. [2023-04-02 04:45:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-04-02 04:45:50,031 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:45:50,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:45:50,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 04:45:50,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:45:50,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:45:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1367886637, now seen corresponding path program 1 times [2023-04-02 04:45:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:45:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856939682] [2023-04-02 04:45:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:45:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:45:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:45:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:45:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:45:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:45:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:45:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:45:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:45:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:45:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 04:45:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-04-02 04:45:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:45:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:45:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856939682] [2023-04-02 04:45:50,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856939682] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:45:50,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:45:50,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:45:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148113644] [2023-04-02 04:45:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:45:50,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:45:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:45:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:45:50,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:45:50,353 INFO L87 Difference]: Start difference. First operand 794 states and 1061 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (15), 8 states have call predecessors, (15), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:45:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:45:55,574 INFO L93 Difference]: Finished difference Result 4241 states and 6452 transitions. [2023-04-02 04:45:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-04-02 04:45:55,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (15), 8 states have call predecessors, (15), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2023-04-02 04:45:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:45:55,584 INFO L225 Difference]: With dead ends: 4241 [2023-04-02 04:45:55,584 INFO L226 Difference]: Without dead ends: 1452 [2023-04-02 04:45:55,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=586, Invalid=2720, Unknown=0, NotChecked=0, Total=3306 [2023-04-02 04:45:55,597 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 1478 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 3490 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 3490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-04-02 04:45:55,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 438 Invalid, 4164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 3490 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-04-02 04:45:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2023-04-02 04:45:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1060. [2023-04-02 04:45:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 734 states have (on average 1.3542234332425067) internal successors, (994), 785 states have internal predecessors, (994), 171 states have call successors, (171), 128 states have call predecessors, (171), 154 states have return successors, (254), 174 states have call predecessors, (254), 166 states have call successors, (254) [2023-04-02 04:45:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1419 transitions. [2023-04-02 04:45:55,782 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1419 transitions. Word has length 79 [2023-04-02 04:45:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:45:55,782 INFO L495 AbstractCegarLoop]: Abstraction has 1060 states and 1419 transitions. [2023-04-02 04:45:55,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (15), 8 states have call predecessors, (15), 5 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:45:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1419 transitions. [2023-04-02 04:45:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-04-02 04:45:55,784 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:45:55,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:45:55,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 04:45:55,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:45:55,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:45:55,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1376638364, now seen corresponding path program 1 times [2023-04-02 04:45:55,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:45:55,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456143842] [2023-04-02 04:45:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:45:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:45:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:45:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:55,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:45:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:45:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:45:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-04-02 04:45:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-04-02 04:45:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:45:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:45:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-04-02 04:45:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:45:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:45:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:45:56,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:45:56,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456143842] [2023-04-02 04:45:56,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456143842] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:45:56,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:45:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:45:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668266359] [2023-04-02 04:45:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:45:56,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:45:56,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:45:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:45:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:45:56,081 INFO L87 Difference]: Start difference. First operand 1060 states and 1419 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:45:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:45:57,854 INFO L93 Difference]: Finished difference Result 2760 states and 3917 transitions. [2023-04-02 04:45:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-02 04:45:57,854 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 80 [2023-04-02 04:45:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:45:57,856 INFO L225 Difference]: With dead ends: 2760 [2023-04-02 04:45:57,856 INFO L226 Difference]: Without dead ends: 0 [2023-04-02 04:45:57,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2023-04-02 04:45:57,866 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1050 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 04:45:57,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 110 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-02 04:45:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-02 04:45:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-02 04:45:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-02 04:45:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-02 04:45:57,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2023-04-02 04:45:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:45:57,869 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-02 04:45:57,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (15), 8 states have call predecessors, (15), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-04-02 04:45:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-02 04:45:57,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-02 04:45:57,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 04:45:57,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 04:45:57,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-02 04:48:19,768 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2023-04-02 04:48:19,768 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 11) no Hoare annotation was computed. [2023-04-02 04:48:19,769 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 11) no Hoare annotation was computed. [2023-04-02 04:48:19,769 INFO L899 garLoopResultBuilder]: For program point L560(line 560) no Hoare annotation was computed. [2023-04-02 04:48:19,769 INFO L895 garLoopResultBuilder]: At program point L559(line 559) the Hoare annotation is: (or (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~p_dw_pc~0 0) (= ~q_ev~0 |old(~q_ev~0)|) (= |old(~q_free~0)| ~q_free~0) (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_dr_pc~0 0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~t~0 |old(~t~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0))) [2023-04-02 04:48:19,769 INFO L895 garLoopResultBuilder]: At program point L559-1(line 559) the Hoare annotation is: (or (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~p_dw_pc~0 0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 2) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0))) [2023-04-02 04:48:19,770 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 554 565) no Hoare annotation was computed. [2023-04-02 04:48:19,770 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 554 565) the Hoare annotation is: (or (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~p_dw_pc~0 0) (= ~q_ev~0 |old(~q_ev~0)|) (= |old(~q_free~0)| ~q_free~0) (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~c_dr_pc~0 0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~t~0 |old(~t~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| 0))) [2023-04-02 04:48:19,770 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 554 565) no Hoare annotation was computed. [2023-04-02 04:48:19,770 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-04-02 04:48:19,770 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-04-02 04:48:19,770 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-04-02 04:48:19,770 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2023-04-02 04:48:19,770 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2023-04-02 04:48:19,770 INFO L902 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: true [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 457 475) the Hoare annotation is: true [2023-04-02 04:48:19,771 INFO L902 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: true [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point stop_simulationEXIT(lines 457 475) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point stop_simulationFINAL(lines 457 475) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L902 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: true [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2023-04-02 04:48:19,771 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 91 119) the Hoare annotation is: true [2023-04-02 04:48:19,771 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 324) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse1 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)) (or (= ~c_dr_pc~0 2) .cse1 (< ~p_dw_pc~0 1)))) [2023-04-02 04:48:19,772 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 361 378) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L899 garLoopResultBuilder]: For program point reset_time_eventsEXIT(lines 361 378) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L899 garLoopResultBuilder]: For program point L365-1(lines 364 377) no Hoare annotation was computed. [2023-04-02 04:48:19,772 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 361 378) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse1 (and (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0)))) (and (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)) (or (= ~c_dr_pc~0 2) (< ~p_dw_pc~0 1) .cse1) (or .cse0 (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse1))) [2023-04-02 04:48:19,773 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse0 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)))) [2023-04-02 04:48:19,773 INFO L902 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: true [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2023-04-02 04:48:19,773 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or (= ~c_dr_pc~0 2) .cse0 (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)))) [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2023-04-02 04:48:19,773 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2023-04-02 04:48:19,773 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 287 306) the Hoare annotation is: true [2023-04-02 04:48:19,773 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point update_fifo_qEXIT(lines 32 51) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point update_fifo_qFINAL(lines 32 51) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 32 51) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or .cse0 (= ~c_dr_pc~0 2) (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)))) [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 50) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2023-04-02 04:48:19,774 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 325 342) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0))) (.cse1 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)) (or (= ~c_dr_pc~0 2) .cse1 (< ~p_dw_pc~0 1)))) [2023-04-02 04:48:19,775 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2023-04-02 04:48:19,775 INFO L899 garLoopResultBuilder]: For program point L273-1(lines 272 285) no Hoare annotation was computed. [2023-04-02 04:48:19,775 INFO L899 garLoopResultBuilder]: For program point init_threadsEXIT(lines 269 286) no Hoare annotation was computed. [2023-04-02 04:48:19,775 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 269 286) the Hoare annotation is: (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (not (= ~p_dw_pc~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0))) [2023-04-02 04:48:19,775 INFO L899 garLoopResultBuilder]: For program point L278-1(lines 269 286) no Hoare annotation was computed. [2023-04-02 04:48:19,775 INFO L895 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (let ((.cse5 (< |old(~p_dw_pc~0)| 1)) (.cse6 (<= 1 ~p_dw_pc~0)) (.cse1 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse2 (not (= |old(~p_dw_pc~0)| 0))) (.cse0 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (< 1 ~c_dr_pc~0)) (.cse4 (< ~c_dr_pc~0 1))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse3 .cse5 .cse4) (or (= ~c_dr_pc~0 2) .cse6 .cse5) (or (and .cse6 .cse1) (not (= ~c_dr_pc~0 |old(~p_dw_pc~0)|)) .cse2) (or .cse0 (<= |old(~p_dw_pc~0)| 1) .cse3 .cse4))) [2023-04-02 04:48:19,775 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2023-04-02 04:48:19,775 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 145 193) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse3 (= |old(~q_free~0)| ~q_free~0)) (.cse4 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse5 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse6 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse7 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse0 (not (= |old(~p_dw_pc~0)| 0))) (.cse1 (and .cse2 (= ~p_dw_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7))) (and (or (not (= ~c_dr_pc~0 |old(~p_dw_pc~0)|)) .cse0 .cse1) (or .cse0 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1) .cse1) (or (= ~c_dr_pc~0 2) (and .cse2 .cse3 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse4 .cse5 .cse6 .cse7) (< |old(~p_dw_pc~0)| 1))))) [2023-04-02 04:48:19,776 INFO L895 garLoopResultBuilder]: At program point $Ultimate##13(lines 171 179) the Hoare annotation is: (let ((.cse0 (not (= |old(~p_dw_pc~0)| 0))) (.cse1 (= ~c_dr_pc~0 2))) (and (or .cse0 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)) (or (not (= ~c_dr_pc~0 |old(~p_dw_pc~0)|)) .cse0) (or .cse1 (<= |old(~p_dw_pc~0)| 1)) (or .cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= |old(~q_free~0)| ~q_free~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (< |old(~p_dw_pc~0)| 1)))) [2023-04-02 04:48:19,776 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 164 187) the Hoare annotation is: (let ((.cse5 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse1 (not (= |old(~p_dw_pc~0)| 0))) (.cse2 (and .cse5 (= |old(~q_free~0)| ~q_free~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|))) (.cse0 (not (= ~c_dr_pc~0 |old(~p_dw_pc~0)|))) (.cse3 (< 1 ~c_dr_pc~0)) (.cse4 (< ~c_dr_pc~0 1))) (and (or .cse0 .cse1 .cse2) (or (< 1 ~p_dw_pc~0) (<= |old(~p_dw_pc~0)| 1) .cse3 .cse4) (or (= ~c_dr_pc~0 2) (and .cse5 (<= 1 ~p_dw_pc~0)) (< |old(~p_dw_pc~0)| 1)) (or .cse1 .cse2 .cse3 .cse4) (or .cse0 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse3 .cse4)))) [2023-04-02 04:48:19,776 INFO L899 garLoopResultBuilder]: For program point do_write_pEXIT(lines 145 193) no Hoare annotation was computed. [2023-04-02 04:48:19,776 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2023-04-02 04:48:19,776 INFO L895 garLoopResultBuilder]: At program point L171(lines 171 179) the Hoare annotation is: (let ((.cse0 (not (= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)) (or (not (= ~c_dr_pc~0 |old(~p_dw_pc~0)|)) .cse0) (or (= ~c_dr_pc~0 2) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= |old(~q_free~0)| ~q_free~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (< |old(~p_dw_pc~0)| 1)))) [2023-04-02 04:48:19,776 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 132) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L128-2(lines 128 132) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L126-1(line 126) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 120 144) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 120 144) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L136-2(lines 120 144) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point fire_time_eventsEXIT(lines 345 360) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point L349-1(lines 345 360) no Hoare annotation was computed. [2023-04-02 04:48:19,777 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 345 360) the Hoare annotation is: (let ((.cse0 (and (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0) (= ~t~0 |old(~t~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)) (or .cse0 (= ~c_dr_pc~0 2) (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))))) [2023-04-02 04:48:19,777 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2023-04-02 04:48:19,778 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~q_ev~0 |old(~q_ev~0)|) (= |old(~q_free~0)| ~q_free~0) (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~t~0 |old(~t~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-02 04:48:19,778 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-02 04:48:19,778 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-04-02 04:48:19,778 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2023-04-02 04:48:19,778 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2023-04-02 04:48:19,778 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse18 (<= 1 ~p_dw_pc~0))) (let ((.cse11 (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|))) (.cse0 (= ~c_dr_pc~0 0)) (.cse1 (and .cse9 .cse10 .cse18)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse13 (and (not (= ~c_dr_pc~0 2)) .cse18)) (.cse12 (not (= |old(~p_dw_pc~0)| 0))) (.cse4 (= ~p_dw_pc~0 0)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse6 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse7 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse8 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse14 (and .cse9 .cse10 (< 1 ~p_dw_pc~0))) (.cse15 (< 1 |old(~c_dr_pc~0)|)) (.cse16 (< |old(~c_dr_pc~0)| 1)) (.cse3 (< |old(~p_dw_pc~0)| 1)) (.cse17 (and .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse18))) (and (or (not (= |old(~c_dr_pc~0)| 0)) .cse0 .cse1 .cse2 .cse3) (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse4 .cse5 (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) .cse6 .cse0 .cse7 (= ~a_t~0 |old(~a_t~0)|) .cse8) (and .cse4 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse4 .cse11 .cse12 .cse0 .cse1 .cse2) (or .cse13 (= 2 |old(~c_dr_pc~0)|) .cse3) (or .cse14 .cse15 .cse16 .cse12 (and .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) .cse8) .cse17) (or .cse14 .cse15 .cse16 .cse3 .cse17)))) [2023-04-02 04:48:19,779 INFO L895 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (let ((.cse17 (<= 1 ~c_dr_pc~0)) (.cse18 (<= ~c_dr_pc~0 1)) (.cse20 (= ~q_read_ev~0 2)) (.cse19 (<= 1 ~p_dw_pc~0))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|))) (.cse2 (not (= |old(~p_dw_pc~0)| 0))) (.cse11 (= |old(~q_free~0)| ~q_free~0)) (.cse12 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse13 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse15 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse6 (and (not (= ~c_dr_pc~0 2)) .cse19)) (.cse3 (= ~c_dr_pc~0 0)) (.cse4 (and .cse17 .cse18 .cse19 .cse20)) (.cse5 (not .cse20)) (.cse8 (and .cse17 .cse18 (< 1 ~p_dw_pc~0))) (.cse9 (< 1 |old(~c_dr_pc~0)|)) (.cse10 (< |old(~c_dr_pc~0)| 1)) (.cse7 (< |old(~p_dw_pc~0)| 1)) (.cse16 (and .cse18 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse19))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (= 2 |old(~c_dr_pc~0)|) .cse7) (or .cse8 .cse9 .cse10 .cse2 (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16) (or (and .cse0 .cse17 .cse18) .cse1 .cse2 (and .cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse12 .cse13 .cse14 .cse15) .cse6) (or (not (= |old(~c_dr_pc~0)| 0)) .cse3 .cse4 .cse5 .cse7) (or .cse8 .cse9 .cse10 .cse7 .cse16)))) [2023-04-02 04:48:19,779 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 404 456) the Hoare annotation is: (let ((.cse1 (= ~p_dw_pc~0 0)) (.cse11 (not (= |old(~p_dw_pc~0)| 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse2 (= |old(~q_free~0)| ~q_free~0)) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse4 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse5 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse6 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse7 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse8 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= ~a_t~0 |old(~a_t~0)|)) (.cse12 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse10 (= ~c_num_read~0 |old(~c_num_read~0)|))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 .cse10) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) .cse11) (or (< 1 |old(~c_dr_pc~0)|) (< |old(~c_dr_pc~0)| 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10) .cse11) (or (and .cse0 .cse2 .cse3 (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10) (= 2 |old(~c_dr_pc~0)|) (< |old(~p_dw_pc~0)| 1)))) [2023-04-02 04:48:19,779 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2023-04-02 04:48:19,779 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2023-04-02 04:48:19,780 INFO L895 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse18 (<= 1 ~p_dw_pc~0))) (let ((.cse11 (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|))) (.cse0 (= ~c_dr_pc~0 0)) (.cse1 (and .cse9 .cse10 .cse18)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse13 (and (not (= ~c_dr_pc~0 2)) .cse18)) (.cse12 (not (= |old(~p_dw_pc~0)| 0))) (.cse4 (= ~p_dw_pc~0 0)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse6 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse7 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse8 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse14 (and .cse9 .cse10 (< 1 ~p_dw_pc~0))) (.cse15 (< 1 |old(~c_dr_pc~0)|)) (.cse16 (< |old(~c_dr_pc~0)| 1)) (.cse3 (< |old(~p_dw_pc~0)| 1)) (.cse17 (and .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse18))) (and (or (not (= |old(~c_dr_pc~0)| 0)) .cse0 .cse1 .cse2 .cse3) (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse4 .cse5 (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) .cse6 .cse0 .cse7 (= ~a_t~0 |old(~a_t~0)|) .cse8) (and .cse4 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse4 .cse11 .cse12 .cse0 .cse1 .cse2) (or .cse13 (= 2 |old(~c_dr_pc~0)|) .cse3) (or .cse14 .cse15 .cse16 .cse12 (and .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) .cse8) .cse17) (or .cse14 .cse15 .cse16 .cse3 .cse17)))) [2023-04-02 04:48:19,780 INFO L899 garLoopResultBuilder]: For program point evalEXIT(lines 404 456) no Hoare annotation was computed. [2023-04-02 04:48:19,780 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2023-04-02 04:48:19,780 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse18 (<= 1 ~p_dw_pc~0))) (let ((.cse11 (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|))) (.cse0 (= ~c_dr_pc~0 0)) (.cse1 (and .cse9 .cse10 .cse18)) (.cse2 (not (= ~q_read_ev~0 2))) (.cse13 (and (not (= ~c_dr_pc~0 2)) .cse18)) (.cse12 (not (= |old(~p_dw_pc~0)| 0))) (.cse4 (= ~p_dw_pc~0 0)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse6 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse7 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse8 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse14 (and .cse9 .cse10 (< 1 ~p_dw_pc~0))) (.cse15 (< 1 |old(~c_dr_pc~0)|)) (.cse16 (< |old(~c_dr_pc~0)| 1)) (.cse3 (< |old(~p_dw_pc~0)| 1)) (.cse17 (and .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse18))) (and (or (not (= |old(~c_dr_pc~0)| 0)) .cse0 .cse1 .cse2 .cse3) (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse4 .cse5 (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) .cse6 .cse0 .cse7 (= ~a_t~0 |old(~a_t~0)|) .cse8) (and .cse4 .cse9 .cse10) .cse11 .cse12 .cse13) (or .cse4 .cse11 .cse12 .cse0 .cse1 .cse2) (or .cse13 (= 2 |old(~c_dr_pc~0)|) .cse3) (or .cse14 .cse15 .cse16 .cse12 (and .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) .cse8) .cse17) (or .cse14 .cse15 .cse16 .cse3 .cse17)))) [2023-04-02 04:48:19,780 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse6 (<= 1 ~c_dr_pc~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse19 (= ~q_read_ev~0 2)) (.cse18 (<= 1 ~p_dw_pc~0))) (let ((.cse1 (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|))) (.cse12 (and (not (= ~c_dr_pc~0 2)) .cse18)) (.cse2 (not (= |old(~p_dw_pc~0)| 0))) (.cse0 (= ~p_dw_pc~0 0)) (.cse8 (= |old(~q_free~0)| ~q_free~0)) (.cse9 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse3 (= ~c_dr_pc~0 0)) (.cse4 (and .cse6 .cse7 .cse18 .cse19)) (.cse5 (not .cse19)) (.cse14 (and .cse6 .cse7 (< 1 ~p_dw_pc~0))) (.cse15 (< 1 |old(~c_dr_pc~0)|)) (.cse16 (< |old(~c_dr_pc~0)| 1)) (.cse13 (< |old(~p_dw_pc~0)| 1)) (.cse17 (and .cse7 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse18))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (and .cse0 .cse6 .cse7) .cse1 (and .cse0 .cse8 .cse9 .cse3 .cse10 .cse11) .cse2 .cse12) (or .cse12 (= 2 |old(~c_dr_pc~0)|) .cse13) (or .cse14 .cse15 .cse16 .cse2 (and .cse0 .cse8 .cse9 .cse10 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) .cse11) .cse17) (or (not (= |old(~c_dr_pc~0)| 0)) .cse3 .cse4 .cse5 .cse13) (or .cse14 .cse15 .cse16 .cse13 .cse17)))) [2023-04-02 04:48:19,781 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2023-04-02 04:48:19,781 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or .cse0 (= ~c_dr_pc~0 2) (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)))) [2023-04-02 04:48:19,781 INFO L895 garLoopResultBuilder]: At program point L260(line 260) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse1 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (or .cse0 (= ~c_dr_pc~0 2) (< ~p_dw_pc~0 1)) (or .cse0 .cse1 (< 1 ~c_dr_pc~0) (< ~c_dr_pc~0 1)))) [2023-04-02 04:48:19,781 INFO L899 garLoopResultBuilder]: For program point L258(lines 254 268) no Hoare annotation was computed. [2023-04-02 04:48:19,781 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2023-04-02 04:48:19,781 INFO L895 garLoopResultBuilder]: At program point L510-1(lines 510 519) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,781 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2023-04-02 04:48:19,781 INFO L899 garLoopResultBuilder]: For program point start_simulationEXIT(lines 476 534) no Hoare annotation was computed. [2023-04-02 04:48:19,782 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,782 INFO L902 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2023-04-02 04:48:19,782 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2023-04-02 04:48:19,782 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-04-02 04:48:19,782 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 476 534) the Hoare annotation is: (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~p_dw_pc~0 0) (= ~q_ev~0 |old(~q_ev~0)|) (= |old(~q_free~0)| ~q_free~0) (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_write_ev~0 2) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~t~0 |old(~t~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| 2))) [2023-04-02 04:48:19,782 INFO L899 garLoopResultBuilder]: For program point L521(line 521) no Hoare annotation was computed. [2023-04-02 04:48:19,782 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (or (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2))) [2023-04-02 04:48:19,783 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~p_dw_pc~0 0) (= ~q_ev~0 |old(~q_ev~0)|) (= |old(~q_free~0)| ~q_free~0) (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~q_write_ev~0 2) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~t~0 |old(~t~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| 2))) [2023-04-02 04:48:19,783 INFO L895 garLoopResultBuilder]: At program point L484-1(line 484) the Hoare annotation is: (or (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= |old(~q_read_ev~0)| 2)) (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~p_dw_pc~0 0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~c_dr_pc~0 0))) [2023-04-02 04:48:19,783 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,783 INFO L895 garLoopResultBuilder]: At program point L513-1(line 513) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,783 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,783 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,784 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,784 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,784 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2023-04-02 04:48:19,784 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,784 INFO L899 garLoopResultBuilder]: For program point L495-1(line 495) no Hoare annotation was computed. [2023-04-02 04:48:19,784 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 491 528) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,784 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (or (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2))) [2023-04-02 04:48:19,785 INFO L895 garLoopResultBuilder]: At program point L485(line 485) the Hoare annotation is: (or (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and (= ~p_dw_pc~0 0) (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2))) [2023-04-02 04:48:19,785 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0))) (or (and .cse0 (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (and .cse0 (= ~c_dr_pc~0 0)) (not (= |old(~q_read_ev~0)| 2)) (and (not (= ~c_dr_pc~0 2)) (<= 1 ~p_dw_pc~0)))) [2023-04-02 04:48:19,785 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-02 04:48:19,785 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 0)) [2023-04-02 04:48:19,785 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-02 04:48:19,785 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-02 04:48:19,785 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2023-04-02 04:48:19,785 INFO L902 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: true [2023-04-02 04:48:19,785 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2023-04-02 04:48:19,785 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2023-04-02 04:48:19,785 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2023-04-02 04:48:19,786 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2023-04-02 04:48:19,786 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 62 90) the Hoare annotation is: true [2023-04-02 04:48:19,786 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2023-04-02 04:48:19,786 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2023-04-02 04:48:19,786 INFO L899 garLoopResultBuilder]: For program point do_read_cEXIT(lines 195 253) no Hoare annotation was computed. [2023-04-02 04:48:19,786 INFO L895 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (let ((.cse1 (< ~p_dw_pc~0 1)) (.cse2 (= |old(~q_free~0)| ~q_free~0)) (.cse3 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse4 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse5 (< 1 |old(~c_dr_pc~0)|)) (.cse6 (< |old(~c_dr_pc~0)| 1)) (.cse0 (not (= ~p_dw_pc~0 0)))) (and (or (and (or .cse0 (not (= ~p_dw_pc~0 |old(~c_dr_pc~0)|))) .cse1) (and (<= 1 ~c_dr_pc~0) (<= ~c_dr_pc~0 1) (<= 1 ~p_dw_pc~0)) (= 2 |old(~c_dr_pc~0)|)) (or (and .cse2 .cse3 .cse4) .cse5 .cse6 .cse1) (or (and .cse2 .cse3 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) .cse4) .cse5 .cse6 .cse0))) [2023-04-02 04:48:19,786 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0)))) (and (or (< 1 |old(~c_dr_pc~0)|) (< |old(~c_dr_pc~0)| 1) .cse0) (or (and (or .cse0 (not (= ~p_dw_pc~0 |old(~c_dr_pc~0)|))) (< ~p_dw_pc~0 1)) (= 2 |old(~c_dr_pc~0)|)))) [2023-04-02 04:48:19,786 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-04-02 04:48:19,786 INFO L895 garLoopResultBuilder]: At program point L244-1(lines 210 247) the Hoare annotation is: (let ((.cse2 (= |old(~q_free~0)| ~q_free~0)) (.cse3 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse4 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse5 (= ~a_t~0 |old(~a_t~0)|)) (.cse6 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse7 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse0 (< 1 |old(~c_dr_pc~0)|)) (.cse1 (< |old(~c_dr_pc~0)| 1)) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse8 (< ~p_dw_pc~0 1)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) (or (and .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7) .cse0 .cse1 .cse10) (or (and (or .cse10 (not (= ~p_dw_pc~0 |old(~c_dr_pc~0)|))) .cse8) (and .cse9 (<= 1 ~p_dw_pc~0)) (= 2 |old(~c_dr_pc~0)|)))) [2023-04-02 04:48:19,787 INFO L895 garLoopResultBuilder]: At program point DR_WAIT_WRITE(lines 198 252) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0)))) (and (or (< 1 |old(~c_dr_pc~0)|) (< |old(~c_dr_pc~0)| 1) .cse0) (or (and (or .cse0 (not (= ~p_dw_pc~0 |old(~c_dr_pc~0)|))) (< ~p_dw_pc~0 1)) (= 2 |old(~c_dr_pc~0)|)))) [2023-04-02 04:48:19,787 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2023-04-02 04:48:19,787 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 195 253) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_pc~0 0))) (.cse0 (and (= |old(~q_free~0)| ~q_free~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~q_req_up~0 |old(~q_req_up~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|)))) (and (or .cse0 (< 1 |old(~c_dr_pc~0)|) (< |old(~c_dr_pc~0)| 1) .cse1) (or (and (or .cse1 (not (= ~p_dw_pc~0 |old(~c_dr_pc~0)|))) (< ~p_dw_pc~0 1)) .cse0 (= 2 |old(~c_dr_pc~0)|)))) [2023-04-02 04:48:19,787 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2023-04-02 04:48:19,787 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2023-04-02 04:48:19,787 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_pc~0 0)))) (and (or (< 1 |old(~c_dr_pc~0)|) (< |old(~c_dr_pc~0)| 1) .cse0) (or (and (or .cse0 (not (= ~p_dw_pc~0 |old(~c_dr_pc~0)|))) (< ~p_dw_pc~0 1)) (= 2 |old(~c_dr_pc~0)|)))) [2023-04-02 04:48:19,787 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2023-04-02 04:48:19,787 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2023-04-02 04:48:19,787 INFO L899 garLoopResultBuilder]: For program point init_modelFINAL(lines 535 553) no Hoare annotation was computed. [2023-04-02 04:48:19,788 INFO L899 garLoopResultBuilder]: For program point init_modelEXIT(lines 535 553) no Hoare annotation was computed. [2023-04-02 04:48:19,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 535 553) the Hoare annotation is: (or (and (= ~p_dw_pc~0 0) (= |old(~q_free~0)| ~q_free~0) (= |old(~slow_clk_edge~0)| ~slow_clk_edge~0) (= |old(~fast_clk_edge~0)| ~fast_clk_edge~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_pc~0 0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|)) (not (= |old(~p_dw_pc~0)| |old(~c_dr_pc~0)|)) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0))) [2023-04-02 04:48:19,791 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-04-02 04:48:19,793 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 04:48:19,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 04:48:19 BoogieIcfgContainer [2023-04-02 04:48:19,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 04:48:19,819 INFO L158 Benchmark]: Toolchain (without parser) took 159271.58ms. Allocated memory was 327.2MB in the beginning and 828.4MB in the end (delta: 501.2MB). Free memory was 269.2MB in the beginning and 708.6MB in the end (delta: -439.5MB). Peak memory consumption was 494.0MB. Max. memory is 8.0GB. [2023-04-02 04:48:19,819 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory was 142.8MB in the beginning and 142.6MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 04:48:19,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.40ms. Allocated memory is still 327.2MB. Free memory was 268.9MB in the beginning and 255.4MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-04-02 04:48:19,819 INFO L158 Benchmark]: Boogie Preprocessor took 70.92ms. Allocated memory is still 327.2MB. Free memory was 255.4MB in the beginning and 253.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-02 04:48:19,819 INFO L158 Benchmark]: RCFGBuilder took 577.14ms. Allocated memory is still 327.2MB. Free memory was 253.2MB in the beginning and 283.7MB in the end (delta: -30.5MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2023-04-02 04:48:19,820 INFO L158 Benchmark]: TraceAbstraction took 158275.65ms. Allocated memory was 327.2MB in the beginning and 828.4MB in the end (delta: 501.2MB). Free memory was 283.2MB in the beginning and 708.6MB in the end (delta: -425.5MB). Peak memory consumption was 506.7MB. Max. memory is 8.0GB. [2023-04-02 04:48:19,821 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.17ms. Allocated memory is still 192.9MB. Free memory was 142.8MB in the beginning and 142.6MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 341.40ms. Allocated memory is still 327.2MB. Free memory was 268.9MB in the beginning and 255.4MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.92ms. Allocated memory is still 327.2MB. Free memory was 255.4MB in the beginning and 253.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 577.14ms. Allocated memory is still 327.2MB. Free memory was 253.2MB in the beginning and 283.7MB in the end (delta: -30.5MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * TraceAbstraction took 158275.65ms. Allocated memory was 327.2MB in the beginning and 828.4MB in the end (delta: 501.2MB). Free memory was 283.2MB in the beginning and 708.6MB in the end (delta: -425.5MB). Peak memory consumption was 506.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 161 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 158.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 141.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5460 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5330 mSDsluCounter, 1033 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 705 mSDsCounter, 2318 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9058 IncrementalHoareTripleChecker+Invalid, 11376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2318 mSolverCounterUnsat, 328 mSDtfsCounter, 9058 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1060occurred in iteration=4, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 5 MinimizatonAttempts, 1169 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 2631 PreInvPairs, 5384 NumberOfFragments, 3430 HoareAnnotationTreeSize, 2631 FomulaSimplifications, 3419014 FormulaSimplificationTreeSizeReduction, 132.0s HoareSimplificationTime, 63 FomulaSimplificationsInter, 142440 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((!(\old(p_dw_pc) == 0) || 1 < c_dr_pc) || c_dr_pc < 1) && (!(c_dr_pc == \old(p_dw_pc)) || !(\old(p_dw_pc) == 0))) && (c_dr_pc == 2 || \old(p_dw_pc) <= 1)) && ((c_dr_pc == 2 || ((((((\old(p_dw_st) == p_dw_st && \old(q_free) == q_free) && \old(p_dw_pc) == p_dw_pc) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && q_req_up == \old(q_req_up)) && p_num_write == \old(p_num_write))) || \old(p_dw_pc) < 1) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((!(c_dr_pc == \old(p_dw_pc)) || !(\old(p_dw_pc) == 0)) || ((((((\old(p_dw_st) == p_dw_st && \old(q_free) == q_free) && \old(p_dw_pc) == p_dw_pc) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && q_req_up == \old(q_req_up)) && p_num_write == \old(p_num_write))) && (((1 < p_dw_pc || \old(p_dw_pc) <= 1) || 1 < c_dr_pc) || c_dr_pc < 1)) && ((c_dr_pc == 2 || (\old(p_dw_st) == p_dw_st && 1 <= p_dw_pc)) || \old(p_dw_pc) < 1)) && (((!(\old(p_dw_pc) == 0) || ((((((\old(p_dw_st) == p_dw_st && \old(q_free) == q_free) && \old(p_dw_pc) == p_dw_pc) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && q_req_up == \old(q_req_up)) && p_num_write == \old(p_num_write))) || 1 < c_dr_pc) || c_dr_pc < 1)) && (((!(c_dr_pc == \old(p_dw_pc)) || c_dr_pc == p_dw_pc) || 1 < c_dr_pc) || c_dr_pc < 1) - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (((((((p_dw_pc == 0 && 1 <= c_dr_pc) && c_dr_pc <= 1) || !(\old(p_dw_pc) == \old(c_dr_pc))) || !(\old(q_read_ev) == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || (p_dw_pc == 0 && c_dr_pc == 0)) || !(\old(q_read_ev) == 2)) || (!(c_dr_pc == 2) && 1 <= p_dw_pc) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((!(\old(c_dr_pc) == 0) || c_dr_pc == 0) || ((1 <= c_dr_pc && c_dr_pc <= 1) && 1 <= p_dw_pc)) || !(q_read_ev == 2)) || \old(p_dw_pc) < 1) && (((((((((((((((\old(p_dw_st) == p_dw_st && p_dw_pc == 0) && \old(q_free) == q_free) && c_dr_st == \old(c_dr_st)) && q_buf_0 == \old(q_buf_0)) && c_last_read == \old(c_last_read)) && p_last_write == \old(p_last_write)) && q_req_up == \old(q_req_up)) && c_dr_pc == 0) && p_num_write == \old(p_num_write)) && a_t == \old(a_t)) && c_num_read == \old(c_num_read)) || ((p_dw_pc == 0 && 1 <= c_dr_pc) && c_dr_pc <= 1)) || !(\old(p_dw_pc) == \old(c_dr_pc))) || !(\old(p_dw_pc) == 0)) || (!(c_dr_pc == 2) && 1 <= p_dw_pc))) && (((((p_dw_pc == 0 || !(\old(p_dw_pc) == \old(c_dr_pc))) || !(\old(p_dw_pc) == 0)) || c_dr_pc == 0) || ((1 <= c_dr_pc && c_dr_pc <= 1) && 1 <= p_dw_pc)) || !(q_read_ev == 2))) && (((!(c_dr_pc == 2) && 1 <= p_dw_pc) || 2 == \old(c_dr_pc)) || \old(p_dw_pc) < 1)) && (((((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 < p_dw_pc) || 1 < \old(c_dr_pc)) || \old(c_dr_pc) < 1) || !(\old(p_dw_pc) == 0)) || (((((p_dw_pc == 0 && \old(q_free) == q_free) && q_req_up == \old(q_req_up)) && p_num_write == \old(p_num_write)) && c_dr_pc == \old(c_dr_pc)) && c_num_read == \old(c_num_read))) || ((c_dr_pc <= 1 && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc))) && ((((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 < p_dw_pc) || 1 < \old(c_dr_pc)) || \old(c_dr_pc) < 1) || \old(p_dw_pc) < 1) || ((c_dr_pc <= 1 && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc)) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((!(\old(c_dr_pc) == 0) || c_dr_pc == 0) || ((1 <= c_dr_pc && c_dr_pc <= 1) && 1 <= p_dw_pc)) || !(q_read_ev == 2)) || \old(p_dw_pc) < 1) && (((((((((((((((\old(p_dw_st) == p_dw_st && p_dw_pc == 0) && \old(q_free) == q_free) && c_dr_st == \old(c_dr_st)) && q_buf_0 == \old(q_buf_0)) && c_last_read == \old(c_last_read)) && p_last_write == \old(p_last_write)) && q_req_up == \old(q_req_up)) && c_dr_pc == 0) && p_num_write == \old(p_num_write)) && a_t == \old(a_t)) && c_num_read == \old(c_num_read)) || ((p_dw_pc == 0 && 1 <= c_dr_pc) && c_dr_pc <= 1)) || !(\old(p_dw_pc) == \old(c_dr_pc))) || !(\old(p_dw_pc) == 0)) || (!(c_dr_pc == 2) && 1 <= p_dw_pc))) && (((((p_dw_pc == 0 || !(\old(p_dw_pc) == \old(c_dr_pc))) || !(\old(p_dw_pc) == 0)) || c_dr_pc == 0) || ((1 <= c_dr_pc && c_dr_pc <= 1) && 1 <= p_dw_pc)) || !(q_read_ev == 2))) && (((!(c_dr_pc == 2) && 1 <= p_dw_pc) || 2 == \old(c_dr_pc)) || \old(p_dw_pc) < 1)) && (((((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 < p_dw_pc) || 1 < \old(c_dr_pc)) || \old(c_dr_pc) < 1) || !(\old(p_dw_pc) == 0)) || (((((p_dw_pc == 0 && \old(q_free) == q_free) && q_req_up == \old(q_req_up)) && p_num_write == \old(p_num_write)) && c_dr_pc == \old(c_dr_pc)) && c_num_read == \old(c_num_read))) || ((c_dr_pc <= 1 && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc))) && ((((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 < p_dw_pc) || 1 < \old(c_dr_pc)) || \old(c_dr_pc) < 1) || \old(p_dw_pc) < 1) || ((c_dr_pc <= 1 && c_dr_pc == p_dw_pc) && 1 <= p_dw_pc)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((1 < \old(c_dr_pc) || \old(c_dr_pc) < 1) || (((((\old(q_free) == q_free && c_last_read == \old(c_last_read)) && q_req_up == \old(q_req_up)) && a_t == \old(a_t)) && c_dr_pc == \old(c_dr_pc)) && c_num_read == \old(c_num_read))) || p_dw_pc < 1) && (((((((((\old(q_free) == q_free && c_dr_st == \old(c_dr_st)) && c_last_read == \old(c_last_read)) && q_req_up == \old(q_req_up)) && a_t == \old(a_t)) && c_dr_pc == \old(c_dr_pc)) && c_num_read == \old(c_num_read)) || 1 < \old(c_dr_pc)) || \old(c_dr_pc) < 1) || !(p_dw_pc == 0))) && ((((!(p_dw_pc == 0) || !(p_dw_pc == \old(c_dr_pc))) && p_dw_pc < 1) || (c_dr_st == \old(c_dr_st) && 1 <= p_dw_pc)) || 2 == \old(c_dr_pc)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((1 < \old(c_dr_pc) || \old(c_dr_pc) < 1) || !(p_dw_pc == 0)) && (((!(p_dw_pc == 0) || !(p_dw_pc == \old(c_dr_pc))) && p_dw_pc < 1) || 2 == \old(c_dr_pc)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((!(p_dw_pc == 0) || !(p_dw_pc == \old(c_dr_pc))) && p_dw_pc < 1) || ((1 <= c_dr_pc && c_dr_pc <= 1) && 1 <= p_dw_pc)) || 2 == \old(c_dr_pc)) && (((((\old(q_free) == q_free && q_req_up == \old(q_req_up)) && c_num_read == \old(c_num_read)) || 1 < \old(c_dr_pc)) || \old(c_dr_pc) < 1) || p_dw_pc < 1)) && ((((((\old(q_free) == q_free && q_req_up == \old(q_req_up)) && c_dr_pc == \old(c_dr_pc)) && c_num_read == \old(c_num_read)) || 1 < \old(c_dr_pc)) || \old(c_dr_pc) < 1) || !(p_dw_pc == 0)) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((c_dr_pc == p_dw_pc && q_req_up == \old(q_req_up)) || !(\old(p_dw_pc) == 0)) || 1 < c_dr_pc) || c_dr_pc < 1) && ((((c_dr_pc == p_dw_pc || q_req_up == \old(q_req_up)) || 1 < c_dr_pc) || \old(p_dw_pc) < 1) || c_dr_pc < 1)) && ((c_dr_pc == 2 || 1 <= p_dw_pc) || \old(p_dw_pc) < 1)) && (((1 <= p_dw_pc && q_req_up == \old(q_req_up)) || !(c_dr_pc == \old(p_dw_pc))) || !(\old(p_dw_pc) == 0))) && (((c_dr_pc == p_dw_pc || \old(p_dw_pc) <= 1) || 1 < c_dr_pc) || c_dr_pc < 1) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((!(\old(p_dw_pc) == 0) || 1 < c_dr_pc) || c_dr_pc < 1) && (!(c_dr_pc == \old(p_dw_pc)) || !(\old(p_dw_pc) == 0))) && ((c_dr_pc == 2 || ((((((\old(p_dw_st) == p_dw_st && \old(q_free) == q_free) && \old(p_dw_pc) == p_dw_pc) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && q_req_up == \old(q_req_up)) && p_num_write == \old(p_num_write))) || \old(p_dw_pc) < 1) RESULT: Ultimate proved your program to be correct! [2023-04-02 04:48:19,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...