/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 18:26:53,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 18:26:53,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 18:26:53,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 18:26:53,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 18:26:53,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 18:26:53,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 18:26:53,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 18:26:53,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 18:26:53,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 18:26:53,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 18:26:53,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 18:26:53,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 18:26:53,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 18:26:53,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 18:26:53,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 18:26:53,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 18:26:53,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 18:26:53,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 18:26:53,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 18:26:53,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 18:26:53,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 18:26:53,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 18:26:53,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 18:26:53,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 18:26:53,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 18:26:53,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 18:26:53,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 18:26:53,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 18:26:53,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 18:26:53,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 18:26:53,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 18:26:53,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 18:26:53,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 18:26:53,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 18:26:53,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 18:26:53,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 18:26:53,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 18:26:53,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 18:26:53,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 18:26:53,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 18:26:53,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 18:26:53,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 18:26:53,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 18:26:53,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 18:26:53,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 18:26:53,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 18:26:53,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 18:26:53,134 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 18:26:53,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 18:26:53,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 18:26:53,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 18:26:53,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 18:26:53,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 18:26:53,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 18:26:53,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 18:26:53,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:26:53,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 18:26:53,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 18:26:53,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 18:26:53,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 18:26:53,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 18:26:53,137 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 18:26:53,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 18:26:53,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 18:26:53,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 18:26:53,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 18:26:53,138 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 18:26:53,139 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 18:26:53,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 18:26:53,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 18:26:53,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 18:26:53,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 18:26:53,377 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 18:26:53,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2022-01-10 18:26:53,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44d7e83a/ea6e3e5df74341a4bdefd97d6c31481e/FLAGb6007e161 [2022-01-10 18:26:53,774 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 18:26:53,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2022-01-10 18:26:53,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44d7e83a/ea6e3e5df74341a4bdefd97d6c31481e/FLAGb6007e161 [2022-01-10 18:26:54,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44d7e83a/ea6e3e5df74341a4bdefd97d6c31481e [2022-01-10 18:26:54,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 18:26:54,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 18:26:54,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 18:26:54,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 18:26:54,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 18:26:54,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81d7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54, skipping insertion in model container [2022-01-10 18:26:54,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 18:26:54,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 18:26:54,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-01-10 18:26:54,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:26:54,389 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 18:26:54,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-01-10 18:26:54,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:26:54,422 INFO L208 MainTranslator]: Completed translation [2022-01-10 18:26:54,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54 WrapperNode [2022-01-10 18:26:54,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 18:26:54,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 18:26:54,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 18:26:54,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 18:26:54,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,449 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 26, calls inlined = 27, statements flattened = 303 [2022-01-10 18:26:54,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 18:26:54,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 18:26:54,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 18:26:54,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 18:26:54,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 18:26:54,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 18:26:54,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 18:26:54,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 18:26:54,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:26:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:26:54,491 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) [2022-01-10 18:26:54,506 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 [2022-01-10 18:26:54,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 18:26:54,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 18:26:54,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 18:26:54,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 18:26:54,562 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 18:26:54,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 18:26:54,832 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 18:26:54,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 18:26:54,837 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 18:26:54,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:26:54 BoogieIcfgContainer [2022-01-10 18:26:54,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 18:26:54,839 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 18:26:54,839 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 18:26:54,851 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 18:26:54,853 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:26:54" (1/1) ... [2022-01-10 18:26:54,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:26:54 BasicIcfg [2022-01-10 18:26:54,925 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 18:26:54,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 18:26:54,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 18:26:54,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 18:26:54,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:26:54" (1/4) ... [2022-01-10 18:26:54,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb126ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:26:54, skipping insertion in model container [2022-01-10 18:26:54,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:26:54" (2/4) ... [2022-01-10 18:26:54,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb126ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:26:54, skipping insertion in model container [2022-01-10 18:26:54,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:26:54" (3/4) ... [2022-01-10 18:26:54,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb126ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:26:54, skipping insertion in model container [2022-01-10 18:26:54,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:26:54" (4/4) ... [2022-01-10 18:26:54,930 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.cTransformedIcfg [2022-01-10 18:26:54,933 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 18:26:54,933 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 18:26:54,970 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 18:26:54,991 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 18:26:54,991 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 18:26:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 104 states have internal predecessors, (159), 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) [2022-01-10 18:26:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 18:26:55,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:55,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:55,015 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1962611745, now seen corresponding path program 1 times [2022-01-10 18:26:55,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:55,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011036319] [2022-01-10 18:26:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:55,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:55,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:55,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011036319] [2022-01-10 18:26:55,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011036319] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:55,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:55,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:55,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492011301] [2022-01-10 18:26:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:55,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:55,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:55,322 INFO L87 Difference]: Start difference. First operand has 105 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 104 states have internal predecessors, (159), 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) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-10 18:26:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:55,450 INFO L93 Difference]: Finished difference Result 293 states and 447 transitions. [2022-01-10 18:26:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:55,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-01-10 18:26:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:55,460 INFO L225 Difference]: With dead ends: 293 [2022-01-10 18:26:55,460 INFO L226 Difference]: Without dead ends: 193 [2022-01-10 18:26:55,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:55,465 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 123 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:55,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 256 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 18:26:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-10 18:26:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2022-01-10 18:26:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 1.4171122994652405) internal successors, (265), 188 states have internal predecessors, (265), 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) [2022-01-10 18:26:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 265 transitions. [2022-01-10 18:26:55,532 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 265 transitions. Word has length 43 [2022-01-10 18:26:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:55,533 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 265 transitions. [2022-01-10 18:26:55,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-10 18:26:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 265 transitions. [2022-01-10 18:26:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 18:26:55,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:55,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:55,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 18:26:55,541 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1601870495, now seen corresponding path program 1 times [2022-01-10 18:26:55,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:55,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134223778] [2022-01-10 18:26:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:55,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:55,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:55,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134223778] [2022-01-10 18:26:55,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134223778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:55,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:55,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:55,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845730063] [2022-01-10 18:26:55,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:55,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:55,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:55,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:55,654 INFO L87 Difference]: Start difference. First operand 189 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-10 18:26:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:55,716 INFO L93 Difference]: Finished difference Result 475 states and 663 transitions. [2022-01-10 18:26:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:55,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2022-01-10 18:26:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:55,718 INFO L225 Difference]: With dead ends: 475 [2022-01-10 18:26:55,719 INFO L226 Difference]: Without dead ends: 345 [2022-01-10 18:26:55,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:55,720 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 103 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:55,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 258 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-01-10 18:26:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2022-01-10 18:26:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 339 states have (on average 1.3893805309734513) internal successors, (471), 340 states have internal predecessors, (471), 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) [2022-01-10 18:26:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 471 transitions. [2022-01-10 18:26:55,757 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 471 transitions. Word has length 43 [2022-01-10 18:26:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:55,757 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 471 transitions. [2022-01-10 18:26:55,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2022-01-10 18:26:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 471 transitions. [2022-01-10 18:26:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 18:26:55,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:55,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:55,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 18:26:55,760 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1501537699, now seen corresponding path program 1 times [2022-01-10 18:26:55,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:55,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800861425] [2022-01-10 18:26:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:55,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:55,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:55,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800861425] [2022-01-10 18:26:55,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800861425] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:55,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:55,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:55,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067667427] [2022-01-10 18:26:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:55,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:55,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:55,805 INFO L87 Difference]: Start difference. First operand 341 states and 471 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 18:26:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:55,876 INFO L93 Difference]: Finished difference Result 889 states and 1231 transitions. [2022-01-10 18:26:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:55,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2022-01-10 18:26:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:55,892 INFO L225 Difference]: With dead ends: 889 [2022-01-10 18:26:55,892 INFO L226 Difference]: Without dead ends: 554 [2022-01-10 18:26:55,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:55,894 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 94 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:55,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 214 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 18:26:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-01-10 18:26:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 540. [2022-01-10 18:26:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 538 states have (on average 1.3736059479553904) internal successors, (739), 539 states have internal predecessors, (739), 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) [2022-01-10 18:26:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 739 transitions. [2022-01-10 18:26:55,941 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 739 transitions. Word has length 44 [2022-01-10 18:26:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:55,941 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 739 transitions. [2022-01-10 18:26:55,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 18:26:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 739 transitions. [2022-01-10 18:26:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 18:26:55,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:55,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:55,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 18:26:55,948 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1531120162, now seen corresponding path program 1 times [2022-01-10 18:26:55,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:55,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701333136] [2022-01-10 18:26:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:55,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:56,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:56,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701333136] [2022-01-10 18:26:56,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701333136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:56,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:56,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:56,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699458731] [2022-01-10 18:26:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:56,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:56,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:56,029 INFO L87 Difference]: Start difference. First operand 540 states and 739 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 18:26:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:56,082 INFO L93 Difference]: Finished difference Result 1428 states and 1951 transitions. [2022-01-10 18:26:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2022-01-10 18:26:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:56,086 INFO L225 Difference]: With dead ends: 1428 [2022-01-10 18:26:56,086 INFO L226 Difference]: Without dead ends: 952 [2022-01-10 18:26:56,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:56,095 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 91 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:56,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 224 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-01-10 18:26:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 920. [2022-01-10 18:26:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 918 states have (on average 1.3496732026143792) internal successors, (1239), 919 states have internal predecessors, (1239), 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) [2022-01-10 18:26:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1239 transitions. [2022-01-10 18:26:56,136 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1239 transitions. Word has length 44 [2022-01-10 18:26:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:56,138 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1239 transitions. [2022-01-10 18:26:56,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 18:26:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1239 transitions. [2022-01-10 18:26:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 18:26:56,139 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:56,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:56,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 18:26:56,139 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1919833569, now seen corresponding path program 1 times [2022-01-10 18:26:56,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:56,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598411103] [2022-01-10 18:26:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:56,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:56,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:56,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598411103] [2022-01-10 18:26:56,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598411103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:56,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:56,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:56,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696787681] [2022-01-10 18:26:56,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:56,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:56,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:56,207 INFO L87 Difference]: Start difference. First operand 920 states and 1239 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2022-01-10 18:26:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:56,255 INFO L93 Difference]: Finished difference Result 2123 states and 2852 transitions. [2022-01-10 18:26:56,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:56,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) Word has length 50 [2022-01-10 18:26:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:56,259 INFO L225 Difference]: With dead ends: 2123 [2022-01-10 18:26:56,259 INFO L226 Difference]: Without dead ends: 1239 [2022-01-10 18:26:56,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:56,264 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 88 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:56,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 228 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-01-10 18:26:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1217. [2022-01-10 18:26:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1215 states have (on average 1.3366255144032921) internal successors, (1624), 1216 states have internal predecessors, (1624), 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) [2022-01-10 18:26:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1624 transitions. [2022-01-10 18:26:56,301 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1624 transitions. Word has length 50 [2022-01-10 18:26:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:56,302 INFO L470 AbstractCegarLoop]: Abstraction has 1217 states and 1624 transitions. [2022-01-10 18:26:56,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2022-01-10 18:26:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1624 transitions. [2022-01-10 18:26:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 18:26:56,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:56,309 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:56,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 18:26:56,310 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash 6605477, now seen corresponding path program 1 times [2022-01-10 18:26:56,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:56,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326025198] [2022-01-10 18:26:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:56,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 18:26:56,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326025198] [2022-01-10 18:26:56,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326025198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:56,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:56,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 18:26:56,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464215917] [2022-01-10 18:26:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:56,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:26:56,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:56,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:26:56,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:56,373 INFO L87 Difference]: Start difference. First operand 1217 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 18:26:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:56,497 INFO L93 Difference]: Finished difference Result 2843 states and 3828 transitions. [2022-01-10 18:26:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 18:26:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) Word has length 51 [2022-01-10 18:26:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:56,504 INFO L225 Difference]: With dead ends: 2843 [2022-01-10 18:26:56,504 INFO L226 Difference]: Without dead ends: 1892 [2022-01-10 18:26:56,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 18:26:56,505 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 395 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:56,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 621 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-01-10 18:26:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1241. [2022-01-10 18:26:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1239 states have (on average 1.3155770782889427) internal successors, (1630), 1240 states have internal predecessors, (1630), 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) [2022-01-10 18:26:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1630 transitions. [2022-01-10 18:26:56,561 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1630 transitions. Word has length 51 [2022-01-10 18:26:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:56,561 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1630 transitions. [2022-01-10 18:26:56,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 18:26:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1630 transitions. [2022-01-10 18:26:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 18:26:56,562 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:56,562 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:56,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 18:26:56,563 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1956905732, now seen corresponding path program 1 times [2022-01-10 18:26:56,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:56,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128928813] [2022-01-10 18:26:56,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:56,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 18:26:56,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:56,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128928813] [2022-01-10 18:26:56,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128928813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:56,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:56,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 18:26:56,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937770469] [2022-01-10 18:26:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:56,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:26:56,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:26:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:56,613 INFO L87 Difference]: Start difference. First operand 1241 states and 1630 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 18:26:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:56,754 INFO L93 Difference]: Finished difference Result 2996 states and 3979 transitions. [2022-01-10 18:26:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 18:26:56,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) Word has length 51 [2022-01-10 18:26:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:56,760 INFO L225 Difference]: With dead ends: 2996 [2022-01-10 18:26:56,760 INFO L226 Difference]: Without dead ends: 1831 [2022-01-10 18:26:56,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 18:26:56,762 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 354 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:56,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 637 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-01-10 18:26:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1259. [2022-01-10 18:26:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1257 states have (on average 1.2951471758154336) internal successors, (1628), 1258 states have internal predecessors, (1628), 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) [2022-01-10 18:26:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1628 transitions. [2022-01-10 18:26:56,833 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1628 transitions. Word has length 51 [2022-01-10 18:26:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:56,833 INFO L470 AbstractCegarLoop]: Abstraction has 1259 states and 1628 transitions. [2022-01-10 18:26:56,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 18:26:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1628 transitions. [2022-01-10 18:26:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 18:26:56,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:56,834 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:56,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 18:26:56,834 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1968221859, now seen corresponding path program 1 times [2022-01-10 18:26:56,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:56,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395271892] [2022-01-10 18:26:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:56,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:56,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:56,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395271892] [2022-01-10 18:26:56,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395271892] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:56,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:56,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:26:56,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288022562] [2022-01-10 18:26:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:56,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:26:56,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:56,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:26:56,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:26:56,908 INFO L87 Difference]: Start difference. First operand 1259 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-01-10 18:26:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:57,028 INFO L93 Difference]: Finished difference Result 1491 states and 1928 transitions. [2022-01-10 18:26:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:26:57,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) Word has length 51 [2022-01-10 18:26:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:57,032 INFO L225 Difference]: With dead ends: 1491 [2022-01-10 18:26:57,032 INFO L226 Difference]: Without dead ends: 1489 [2022-01-10 18:26:57,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:26:57,033 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 315 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:57,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-01-10 18:26:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1257. [2022-01-10 18:26:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1256 states have (on average 1.289012738853503) internal successors, (1619), 1256 states have internal predecessors, (1619), 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) [2022-01-10 18:26:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1619 transitions. [2022-01-10 18:26:57,116 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1619 transitions. Word has length 51 [2022-01-10 18:26:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:57,117 INFO L470 AbstractCegarLoop]: Abstraction has 1257 states and 1619 transitions. [2022-01-10 18:26:57,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2022-01-10 18:26:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1619 transitions. [2022-01-10 18:26:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 18:26:57,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:57,118 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:57,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 18:26:57,118 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash 885335038, now seen corresponding path program 1 times [2022-01-10 18:26:57,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:57,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883785620] [2022-01-10 18:26:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:57,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:57,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:57,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883785620] [2022-01-10 18:26:57,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883785620] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 18:26:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188432995] [2022-01-10 18:26:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:57,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:26:57,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:26:57,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 18:26:57,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 18:26:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:57,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 18:26:57,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 18:26:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:57,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 18:26:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:57,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188432995] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 18:26:57,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 18:26:57,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 18:26:57,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295424171] [2022-01-10 18:26:57,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 18:26:57,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 18:26:57,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 18:26:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 18:26:57,932 INFO L87 Difference]: Start difference. First operand 1257 states and 1619 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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) [2022-01-10 18:26:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:58,358 INFO L93 Difference]: Finished difference Result 3614 states and 4719 transitions. [2022-01-10 18:26:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 18:26:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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) Word has length 52 [2022-01-10 18:26:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:58,369 INFO L225 Difference]: With dead ends: 3614 [2022-01-10 18:26:58,369 INFO L226 Difference]: Without dead ends: 3612 [2022-01-10 18:26:58,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 18:26:58,370 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 890 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:58,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [890 Valid, 1256 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2022-01-10 18:26:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 2232. [2022-01-10 18:26:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2231 states have (on average 1.2998655311519498) internal successors, (2900), 2231 states have internal predecessors, (2900), 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) [2022-01-10 18:26:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 2900 transitions. [2022-01-10 18:26:58,617 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 2900 transitions. Word has length 52 [2022-01-10 18:26:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:58,617 INFO L470 AbstractCegarLoop]: Abstraction has 2232 states and 2900 transitions. [2022-01-10 18:26:58,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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) [2022-01-10 18:26:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 2900 transitions. [2022-01-10 18:26:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 18:26:58,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:58,618 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:58,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 18:26:58,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 18:26:58,835 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash 592698231, now seen corresponding path program 2 times [2022-01-10 18:26:58,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:58,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379113151] [2022-01-10 18:26:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:58,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:58,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:58,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379113151] [2022-01-10 18:26:58,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379113151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:58,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:58,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:58,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546631218] [2022-01-10 18:26:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:58,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:58,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:58,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:58,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:58,878 INFO L87 Difference]: Start difference. First operand 2232 states and 2900 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) [2022-01-10 18:26:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:59,028 INFO L93 Difference]: Finished difference Result 3326 states and 4345 transitions. [2022-01-10 18:26:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:59,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 55 [2022-01-10 18:26:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:59,033 INFO L225 Difference]: With dead ends: 3326 [2022-01-10 18:26:59,033 INFO L226 Difference]: Without dead ends: 1586 [2022-01-10 18:26:59,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:59,035 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 82 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:59,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 315 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2022-01-10 18:26:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1570. [2022-01-10 18:26:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1569 states have (on average 1.2721478648820905) internal successors, (1996), 1569 states have internal predecessors, (1996), 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) [2022-01-10 18:26:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1996 transitions. [2022-01-10 18:26:59,161 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1996 transitions. Word has length 55 [2022-01-10 18:26:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:59,161 INFO L470 AbstractCegarLoop]: Abstraction has 1570 states and 1996 transitions. [2022-01-10 18:26:59,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) [2022-01-10 18:26:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1996 transitions. [2022-01-10 18:26:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 18:26:59,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:59,163 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:59,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 18:26:59,163 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:59,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 262675101, now seen corresponding path program 1 times [2022-01-10 18:26:59,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:59,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62693367] [2022-01-10 18:26:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:59,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:26:59,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:59,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62693367] [2022-01-10 18:26:59,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62693367] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:59,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:59,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:59,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926944320] [2022-01-10 18:26:59,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:59,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:59,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:59,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:59,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:59,189 INFO L87 Difference]: Start difference. First operand 1570 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-01-10 18:26:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:59,401 INFO L93 Difference]: Finished difference Result 4057 states and 5144 transitions. [2022-01-10 18:26:59,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:59,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) Word has length 59 [2022-01-10 18:26:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:59,408 INFO L225 Difference]: With dead ends: 4057 [2022-01-10 18:26:59,408 INFO L226 Difference]: Without dead ends: 1955 [2022-01-10 18:26:59,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:59,411 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 89 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:59,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 340 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2022-01-10 18:26:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2022-01-10 18:26:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1954 states have (on average 1.2563971340839304) internal successors, (2455), 1954 states have internal predecessors, (2455), 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) [2022-01-10 18:26:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2455 transitions. [2022-01-10 18:26:59,542 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2455 transitions. Word has length 59 [2022-01-10 18:26:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:59,542 INFO L470 AbstractCegarLoop]: Abstraction has 1955 states and 2455 transitions. [2022-01-10 18:26:59,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-01-10 18:26:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2455 transitions. [2022-01-10 18:26:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 18:26:59,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:59,543 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:59,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 18:26:59,543 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash 987637842, now seen corresponding path program 1 times [2022-01-10 18:26:59,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:59,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374373473] [2022-01-10 18:26:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:59,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 18:26:59,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:59,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374373473] [2022-01-10 18:26:59,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374373473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:59,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:59,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:59,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598234712] [2022-01-10 18:26:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:59,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:59,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:59,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:59,584 INFO L87 Difference]: Start difference. First operand 1955 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2022-01-10 18:26:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:59,712 INFO L93 Difference]: Finished difference Result 3818 states and 4807 transitions. [2022-01-10 18:26:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:59,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) Word has length 67 [2022-01-10 18:26:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:59,718 INFO L225 Difference]: With dead ends: 3818 [2022-01-10 18:26:59,718 INFO L226 Difference]: Without dead ends: 1955 [2022-01-10 18:26:59,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:59,720 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 74 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:59,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2022-01-10 18:26:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2022-01-10 18:26:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1954 states have (on average 1.235926305015353) internal successors, (2415), 1954 states have internal predecessors, (2415), 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) [2022-01-10 18:26:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2415 transitions. [2022-01-10 18:26:59,831 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2415 transitions. Word has length 67 [2022-01-10 18:26:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:26:59,831 INFO L470 AbstractCegarLoop]: Abstraction has 1955 states and 2415 transitions. [2022-01-10 18:26:59,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2022-01-10 18:26:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2415 transitions. [2022-01-10 18:26:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 18:26:59,836 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:26:59,836 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:26:59,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 18:26:59,836 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:26:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:26:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1811953015, now seen corresponding path program 1 times [2022-01-10 18:26:59,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:26:59,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122233532] [2022-01-10 18:26:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:26:59,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:26:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:26:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 18:26:59,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:26:59,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122233532] [2022-01-10 18:26:59,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122233532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:26:59,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:26:59,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:26:59,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700665593] [2022-01-10 18:26:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:26:59,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:26:59,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:26:59,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:26:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:59,866 INFO L87 Difference]: Start difference. First operand 1955 states and 2415 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2022-01-10 18:26:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:26:59,978 INFO L93 Difference]: Finished difference Result 3254 states and 4049 transitions. [2022-01-10 18:26:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:26:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) Word has length 68 [2022-01-10 18:26:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:26:59,982 INFO L225 Difference]: With dead ends: 3254 [2022-01-10 18:26:59,983 INFO L226 Difference]: Without dead ends: 1629 [2022-01-10 18:26:59,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:26:59,985 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 99 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:26:59,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 327 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:26:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-01-10 18:27:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1627. [2022-01-10 18:27:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 1.2183271832718328) internal successors, (1981), 1626 states have internal predecessors, (1981), 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) [2022-01-10 18:27:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1981 transitions. [2022-01-10 18:27:00,079 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1981 transitions. Word has length 68 [2022-01-10 18:27:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:00,079 INFO L470 AbstractCegarLoop]: Abstraction has 1627 states and 1981 transitions. [2022-01-10 18:27:00,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2022-01-10 18:27:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1981 transitions. [2022-01-10 18:27:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 18:27:00,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:00,081 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:00,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 18:27:00,082 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1964864180, now seen corresponding path program 1 times [2022-01-10 18:27:00,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:00,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627180826] [2022-01-10 18:27:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:00,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 18:27:00,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:00,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627180826] [2022-01-10 18:27:00,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627180826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:00,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:00,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 18:27:00,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109770327] [2022-01-10 18:27:00,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:00,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:00,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:00,108 INFO L87 Difference]: Start difference. First operand 1627 states and 1981 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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) [2022-01-10 18:27:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:00,261 INFO L93 Difference]: Finished difference Result 3271 states and 4085 transitions. [2022-01-10 18:27:00,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:00,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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) Word has length 99 [2022-01-10 18:27:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:00,266 INFO L225 Difference]: With dead ends: 3271 [2022-01-10 18:27:00,266 INFO L226 Difference]: Without dead ends: 1903 [2022-01-10 18:27:00,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:00,268 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 106 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:00,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 213 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2022-01-10 18:27:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1864. [2022-01-10 18:27:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 1.2447665056360708) internal successors, (2319), 1863 states have internal predecessors, (2319), 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) [2022-01-10 18:27:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2319 transitions. [2022-01-10 18:27:00,386 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2319 transitions. Word has length 99 [2022-01-10 18:27:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:00,386 INFO L470 AbstractCegarLoop]: Abstraction has 1864 states and 2319 transitions. [2022-01-10 18:27:00,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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) [2022-01-10 18:27:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2319 transitions. [2022-01-10 18:27:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 18:27:00,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:00,387 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:00,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 18:27:00,388 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1403791632, now seen corresponding path program 1 times [2022-01-10 18:27:00,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:00,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490209791] [2022-01-10 18:27:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:00,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 18:27:00,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490209791] [2022-01-10 18:27:00,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490209791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:00,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:00,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:00,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953512691] [2022-01-10 18:27:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:00,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:00,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:00,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:00,420 INFO L87 Difference]: Start difference. First operand 1864 states and 2319 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 18:27:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:00,557 INFO L93 Difference]: Finished difference Result 3473 states and 4364 transitions. [2022-01-10 18:27:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:00,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) Word has length 109 [2022-01-10 18:27:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:00,562 INFO L225 Difference]: With dead ends: 3473 [2022-01-10 18:27:00,562 INFO L226 Difference]: Without dead ends: 1872 [2022-01-10 18:27:00,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:00,567 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:00,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 116 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2022-01-10 18:27:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1872. [2022-01-10 18:27:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.2298236237306253) internal successors, (2301), 1871 states have internal predecessors, (2301), 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) [2022-01-10 18:27:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2301 transitions. [2022-01-10 18:27:00,697 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2301 transitions. Word has length 109 [2022-01-10 18:27:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:00,697 INFO L470 AbstractCegarLoop]: Abstraction has 1872 states and 2301 transitions. [2022-01-10 18:27:00,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 18:27:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2301 transitions. [2022-01-10 18:27:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 18:27:00,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:00,698 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:00,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 18:27:00,699 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1644331761, now seen corresponding path program 1 times [2022-01-10 18:27:00,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:00,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4658207] [2022-01-10 18:27:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:00,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 18:27:00,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:00,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4658207] [2022-01-10 18:27:00,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4658207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:00,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:00,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:00,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511355779] [2022-01-10 18:27:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:00,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:00,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:00,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:00,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:00,741 INFO L87 Difference]: Start difference. First operand 1872 states and 2301 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 18:27:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:00,849 INFO L93 Difference]: Finished difference Result 2635 states and 3259 transitions. [2022-01-10 18:27:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:00,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) Word has length 109 [2022-01-10 18:27:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:00,852 INFO L225 Difference]: With dead ends: 2635 [2022-01-10 18:27:00,852 INFO L226 Difference]: Without dead ends: 1026 [2022-01-10 18:27:00,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:00,853 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:00,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 137 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2022-01-10 18:27:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2022-01-10 18:27:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.1882926829268292) internal successors, (1218), 1025 states have internal predecessors, (1218), 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) [2022-01-10 18:27:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1218 transitions. [2022-01-10 18:27:00,929 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1218 transitions. Word has length 109 [2022-01-10 18:27:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:00,930 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1218 transitions. [2022-01-10 18:27:00,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 18:27:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1218 transitions. [2022-01-10 18:27:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 18:27:00,932 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:00,932 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:00,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 18:27:00,932 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 963674917, now seen corresponding path program 1 times [2022-01-10 18:27:00,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:00,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504566103] [2022-01-10 18:27:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:00,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 18:27:00,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:00,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504566103] [2022-01-10 18:27:00,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504566103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:00,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:00,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:00,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360542867] [2022-01-10 18:27:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:00,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:00,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:00,969 INFO L87 Difference]: Start difference. First operand 1026 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-10 18:27:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:01,044 INFO L93 Difference]: Finished difference Result 1798 states and 2162 transitions. [2022-01-10 18:27:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:01,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) Word has length 112 [2022-01-10 18:27:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:01,047 INFO L225 Difference]: With dead ends: 1798 [2022-01-10 18:27:01,047 INFO L226 Difference]: Without dead ends: 1035 [2022-01-10 18:27:01,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:01,048 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:01,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 120 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2022-01-10 18:27:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2022-01-10 18:27:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1034 states have (on average 1.1731141199226305) internal successors, (1213), 1034 states have internal predecessors, (1213), 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) [2022-01-10 18:27:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1213 transitions. [2022-01-10 18:27:01,117 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1213 transitions. Word has length 112 [2022-01-10 18:27:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:01,118 INFO L470 AbstractCegarLoop]: Abstraction has 1035 states and 1213 transitions. [2022-01-10 18:27:01,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-10 18:27:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1213 transitions. [2022-01-10 18:27:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 18:27:01,119 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:27:01,119 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:01,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 18:27:01,119 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:27:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:27:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 514978278, now seen corresponding path program 1 times [2022-01-10 18:27:01,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:27:01,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373469833] [2022-01-10 18:27:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:27:01,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:27:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:27:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 18:27:01,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:27:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373469833] [2022-01-10 18:27:01,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373469833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:27:01,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:27:01,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:27:01,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218195102] [2022-01-10 18:27:01,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:27:01,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:27:01,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:27:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:27:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:01,166 INFO L87 Difference]: Start difference. First operand 1035 states and 1213 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-10 18:27:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:27:01,219 INFO L93 Difference]: Finished difference Result 1430 states and 1676 transitions. [2022-01-10 18:27:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:27:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) Word has length 112 [2022-01-10 18:27:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:27:01,220 INFO L225 Difference]: With dead ends: 1430 [2022-01-10 18:27:01,220 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 18:27:01,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:27:01,222 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 63 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:27:01,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:27:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 18:27:01,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 18:27:01,222 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) [2022-01-10 18:27:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 18:27:01,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2022-01-10 18:27:01,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:27:01,223 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 18:27:01,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) [2022-01-10 18:27:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 18:27:01,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 18:27:01,225 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 18:27:01,225 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 18:27:01,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 18:27:01,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 18:27:13,946 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 18:27:13,948 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 18:27:13,951 INFO L854 garLoopResultBuilder]: At program point L462(lines 448 464) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= ~q_free~0Int 1) (<= ~p_last_write~0Int ~c_last_read~0Int) (= ~q_write_ev~0Int ~q_read_ev~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= 2 ~q_write_ev~0Int)) [2022-01-10 18:27:13,952 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 228) no Hoare annotation was computed. [2022-01-10 18:27:13,952 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2022-01-10 18:27:13,952 INFO L854 garLoopResultBuilder]: At program point L222-2(lines 218 232) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= ~q_free~0Int 1) (<= ~p_last_write~0Int ~c_last_read~0Int) (= ~q_write_ev~0Int ~q_read_ev~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= 2 ~q_write_ev~0Int)) [2022-01-10 18:27:13,952 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2022-01-10 18:27:13,952 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2022-01-10 18:27:13,952 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2022-01-10 18:27:13,952 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2022-01-10 18:27:13,952 INFO L854 garLoopResultBuilder]: At program point L48(lines 31 50) the Hoare annotation is: false [2022-01-10 18:27:13,952 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= ~c_dr_st~0Int 0)) (.cse4 (= ~c_num_read~0Int 0)) (.cse5 (= ~p_num_write~0Int 0)) (.cse6 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse10 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse12 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0Int) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~c_dr_st~0Int) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~p_dw_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-10 18:27:13,953 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 279) no Hoare annotation was computed. [2022-01-10 18:27:13,953 INFO L858 garLoopResultBuilder]: For program point L275-2(lines 274 287) no Hoare annotation was computed. [2022-01-10 18:27:13,953 INFO L854 garLoopResultBuilder]: At program point L280-1(lines 271 288) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= ~c_dr_st~0Int 0)) (.cse4 (= ~c_num_read~0Int 0)) (.cse5 (= ~p_num_write~0Int 0)) (.cse6 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse10 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse12 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0Int) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~c_dr_st~0Int) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~p_dw_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-10 18:27:13,953 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2022-01-10 18:27:13,953 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2022-01-10 18:27:13,953 INFO L858 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2022-01-10 18:27:13,953 INFO L854 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse10 (<= ~q_req_up~0Int 0)) (.cse1 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse11 (= ~c_dr_st~0Int 0)) (.cse3 (= ~c_num_read~0Int 0)) (.cse4 (= ~p_num_write~0Int 0)) (.cse5 (= ~p_dw_pc~0Int 0)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= ~q_free~0Int 1)) (.cse8 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse12 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse13 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~c_dr_st~0Int) .cse9) (and .cse0 .cse10 .cse1 (= 0 ~p_dw_st~0Int) .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9 .cse13) (and .cse0 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0Int) .cse7 .cse8 .cse12 .cse9 .cse13))) [2022-01-10 18:27:13,953 INFO L854 garLoopResultBuilder]: At program point L77(lines 61 79) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse4 (= ~c_dr_st~0Int 0)) (.cse12 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse14 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse5 (= ~c_num_read~0Int 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse7 (= ~p_num_write~0Int 0)) (.cse8 (= ~p_dw_pc~0Int 0)) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (= ~q_free~0Int 1)) (.cse11 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (= 0 ~p_dw_st~0Int) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~p_dw_st~0Int) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 ~c_dr_st~0Int) .cse13))) [2022-01-10 18:27:13,953 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2022-01-10 18:27:13,953 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2022-01-10 18:27:13,954 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2022-01-10 18:27:13,954 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-01-10 18:27:13,954 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2022-01-10 18:27:13,955 INFO L854 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse15 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse17 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse9 (= ~p_num_write~0Int 0)) (.cse10 (= ~p_dw_pc~0Int 0)) (.cse11 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse12 (= ~q_free~0Int 1)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse14 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse16 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 2 ~p_dw_st~0Int) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ~c_dr_st~0Int) .cse16))) [2022-01-10 18:27:13,955 INFO L854 garLoopResultBuilder]: At program point L96(lines 80 98) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= ~p_dw_pc~0Int 0)) (.cse12 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse13 (= ~q_free~0Int 1)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse15 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse16 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse17 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse18 (<= 2 ~q_write_ev~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 ~p_dw_st~0Int) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 2 ~c_dr_st~0Int) .cse17) (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2022-01-10 18:27:13,959 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-01-10 18:27:13,959 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 307 331) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse17 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse20 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (= ~q_free~0Int 1)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse19 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~p_dw_st~0Int) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 2 ~c_dr_st~0Int) .cse18 .cse19))) [2022-01-10 18:27:13,971 INFO L858 garLoopResultBuilder]: For program point L293(lines 293 297) no Hoare annotation was computed. [2022-01-10 18:27:13,971 INFO L858 garLoopResultBuilder]: For program point L293-2(lines 292 305) no Hoare annotation was computed. [2022-01-10 18:27:13,971 INFO L854 garLoopResultBuilder]: At program point L298-1(lines 289 306) the Hoare annotation is: (let ((.cse1 (<= ~q_req_up~0Int 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse17 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse20 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (= ~q_free~0Int 1)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse19 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ~p_dw_st~0Int) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 2 ~c_dr_st~0Int) .cse18 .cse19))) [2022-01-10 18:27:13,971 INFO L854 garLoopResultBuilder]: At program point L419-2(lines 419 441) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,971 INFO L861 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: true [2022-01-10 18:27:13,971 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-10 18:27:13,971 INFO L861 garLoopResultBuilder]: At program point L474(lines 465 476) the Hoare annotation is: true [2022-01-10 18:27:13,971 INFO L854 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,971 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L854 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point L340(line 340) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 228) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L854 garLoopResultBuilder]: At program point L222-5(lines 218 232) the Hoare annotation is: (let ((.cse35 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse34 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse32 (< .cse35 .cse34)) (.cse33 (<= ~p_num_write~0Int .cse35)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse30 (= ~q_free~0Int 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse31 (= ~p_num_write~0Int 1)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse34)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse29 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse26 (not (= ~q_write_ev~0Int 0))) (.cse27 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse28 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse23 .cse24 .cse25 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse23 .cse24 .cse25 .cse29 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse29 .cse13 .cse14 .cse26 .cse27 .cse32 .cse20 .cse33) (and .cse30 .cse23 .cse29 .cse13 .cse14 .cse26 .cse27 .cse32 .cse28 .cse20 .cse33) (and .cse30 .cse1 .cse23 .cse29 .cse13 .cse14 .cse27 .cse32 .cse28 .cse20 .cse33) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse28 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse19 .cse20) (and .cse0 .cse30 .cse1 .cse3 .cse23 .cse6 .cse7 .cse8 .cse31 .cse11 .cse29 .cse13 .cse14 .cse27 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse29 .cse13 .cse26 .cse27 .cse15 .cse28 .cse20)))) [2022-01-10 18:27:13,972 INFO L854 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point L35-5(lines 34 49) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L858 garLoopResultBuilder]: For program point L275-3(lines 275 279) no Hoare annotation was computed. [2022-01-10 18:27:13,972 INFO L854 garLoopResultBuilder]: At program point L268(lines 251 270) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse20 .cse32) (and .cse30 .cse23 .cse26 .cse13 .cse14 .cse27 .cse28 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L40-3(lines 40 44) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L275-5(lines 274 287) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L854 garLoopResultBuilder]: At program point L48-1(lines 31 50) the Hoare annotation is: (let ((.cse2 (+ ~p_num_write~0Int 1)) (.cse6 (= ~q_free~0Int 1)) (.cse7 (<= 2 ~c_dr_st~0Int)) (.cse12 (= 0 ~c_dr_pc~0Int)) (.cse9 (= ~q_free~0Int 0)) (.cse0 (<= ~q_req_up~0Int 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse1 (not (= ~q_read_ev~0Int 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse10 (not (= ~q_read_ev~0Int 0))) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (<= 2 ~p_dw_st~0Int)) (.cse5 (not (= ~q_write_ev~0Int 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse8 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 (< ~c_num_read~0Int .cse2) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse3 .cse4 (not (= ~q_write_ev~0Int 0)) .cse5 .cse6 .cse7 .cse8) (let ((.cse11 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse9 .cse0 .cse1 .cse10 .cse3 .cse4 .cse5 (< .cse11 .cse2) .cse7 .cse8 (<= ~p_num_write~0Int .cse11))) (and .cse12 .cse9 .cse13 .cse14 .cse15 .cse3 .cse7 .cse16 .cse8) (and .cse12 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) .cse13 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse14 .cse17 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (= ~p_num_write~0Int 0) .cse15 (= ~p_dw_pc~0Int 0) .cse3 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (<= ~p_last_write~0Int ~c_last_read~0Int) .cse7 .cse16 .cse8) (and .cse12 .cse9 .cse0 .cse13 .cse1 .cse14 (= ~c_dr_st~0Int 0) .cse17 (= ~p_num_write~0Int 1) .cse15 .cse10 .cse3 .cse4 .cse5 .cse16 .cse8))) [2022-01-10 18:27:13,973 INFO L854 garLoopResultBuilder]: At program point L280-3(lines 271 288) the Hoare annotation is: (let ((.cse35 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse34 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse32 (< .cse35 .cse34)) (.cse33 (<= ~p_num_write~0Int .cse35)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse31 (= ~p_num_write~0Int 1)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse29 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse23 (< ~c_num_read~0Int .cse34)) (.cse24 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse25 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse26 (not (= ~q_write_ev~0Int 0))) (.cse27 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse28 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse23 .cse24 .cse25 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse29 .cse23 .cse24 .cse25 .cse13 .cse14 .cse26 .cse27 .cse15 .cse28 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse31 .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse29 .cse7 .cse25 .cse13 .cse14 .cse26 .cse27 .cse32 .cse20 .cse33) (and .cse30 .cse29 .cse25 .cse13 .cse14 .cse26 .cse27 .cse32 .cse28 .cse20 .cse33) (and .cse30 .cse1 .cse29 .cse25 .cse13 .cse14 .cse26 .cse32 .cse28 .cse20 .cse33) (and .cse0 .cse30 .cse1 .cse3 .cse29 .cse6 .cse7 .cse8 .cse31 .cse11 .cse25 .cse13 .cse14 .cse26 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse6 .cse11 .cse13 .cse28 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse19 .cse20) (and .cse1 .cse29 .cse22 .cse23 .cse24 .cse25 .cse13 .cse26 .cse27 .cse15 .cse28 .cse20)))) [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L65-3(lines 65 74) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L66-1(lines 66 71) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L65-5(lines 65 74) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2022-01-10 18:27:13,973 INFO L854 garLoopResultBuilder]: At program point L76-1(lines 64 78) the Hoare annotation is: (let ((.cse29 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse30 (+ ~p_num_write~0Int 1))) (let ((.cse4 (< ~c_num_read~0Int .cse30)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse19 (= ~p_num_write~0Int 1)) (.cse9 (not (= ~q_write_ev~0Int 1))) (.cse2 (= 0 ~p_dw_st~0Int)) (.cse17 (= ~c_dr_st~0Int 0)) (.cse23 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse24 (<= 2 ~q_write_ev~0Int)) (.cse14 (= ~q_free~0Int 0)) (.cse0 (<= ~q_req_up~0Int 0)) (.cse1 (not (= ~q_read_ev~0Int 1))) (.cse6 (not (= ~q_read_ev~0Int 0))) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse8 (not (= ~q_write_ev~0Int 0))) (.cse21 (< .cse29 .cse30)) (.cse22 (<= ~p_num_write~0Int .cse29)) (.cse13 (= 0 ~c_dr_pc~0Int)) (.cse25 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse18 (= ~c_num_read~0Int 0)) (.cse26 (= ~p_num_write~0Int 0)) (.cse27 (= ~p_dw_pc~0Int 0)) (.cse7 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (= ~q_free~0Int 1)) (.cse28 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~c_dr_st~0Int)) (.cse12 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse0 .cse15 .cse1 .cse3 .cse16 .cse17 .cse18 .cse19 .cse6 .cse7 .cse20 .cse8 .cse12) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse14 .cse0 .cse1 .cse3 .cse17 .cse6 .cse7 .cse20 .cse8 .cse9 .cse21 .cse12 .cse22) (and .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20 .cse23 .cse12 .cse24) (and .cse13 .cse14 .cse15 .cse16 .cse7 .cse11 .cse12) (and .cse14 .cse1 .cse3 .cse6 .cse7 .cse20 .cse8 .cse9 .cse21 .cse11 .cse12 .cse22) (and .cse13 .cse0 .cse25 .cse15 .cse3 .cse16 .cse17 .cse18 .cse26 .cse27 .cse7 .cse20 .cse10 .cse28 .cse23 .cse12 .cse24) (and .cse13 .cse0 .cse25 .cse15 .cse2 .cse3 .cse16 .cse17 .cse18 .cse26 .cse27 .cse7 .cse10 .cse28 .cse23 .cse12 .cse24) (and .cse14 .cse0 .cse1 .cse3 .cse6 .cse7 .cse20 .cse8 .cse21 .cse11 .cse12 .cse22) (and .cse13 .cse25 .cse15 .cse3 .cse16 .cse18 .cse26 .cse27 .cse7 .cse10 .cse28 .cse11 .cse12)))) [2022-01-10 18:27:13,974 INFO L854 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse1 (not (= ~q_read_ev~0Int 1))) (.cse7 (+ ~p_num_write~0Int 1)) (.cse2 (not (= ~q_read_ev~0Int 0))) (.cse4 (not (= ~q_write_ev~0Int 0))) (.cse5 (not (= ~q_write_ev~0Int 1))) (.cse8 (<= 2 ~c_dr_st~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse11 (= 0 ~c_dr_pc~0Int)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse20 (= ~c_dr_st~0Int 0)) (.cse16 (= ~c_num_read~0Int 0)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse17 (= ~p_num_write~0Int 0)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse3 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (= ~q_free~0Int 1)) (.cse22 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse23 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse15 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse24 (<= 2 ~q_write_ev~0Int))) (or (let ((.cse6 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse6 .cse7) .cse8 .cse9 (<= ~p_num_write~0Int .cse6))) (and .cse1 (< ~c_num_read~0Int .cse7) (<= ~p_num_write~0Int ~c_num_read~0Int) .cse2 .cse3 .cse4 .cse5 .cse10 .cse8 .cse9) (and .cse11 .cse0 .cse12 .cse13 .cse14 .cse3 .cse8 .cse15 .cse9) (and .cse11 .cse12 .cse13 .cse16 .cse17 .cse14 .cse3 .cse10 .cse8 .cse15 .cse9) (and .cse11 .cse0 .cse12 .cse18 .cse19 .cse13 .cse20 .cse16 .cse21 (= ~p_num_write~0Int 1) .cse14 .cse3 .cse22 .cse23 .cse15 .cse9 .cse24) (and .cse11 (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) .cse12 .cse18 .cse19 .cse13 .cse20 .cse16 .cse21 .cse17 .cse14 (= ~p_dw_pc~0Int 0) .cse3 .cse10 .cse22 (<= ~p_last_write~0Int ~c_last_read~0Int) .cse23 .cse15 .cse9 .cse24))) [2022-01-10 18:27:13,974 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2022-01-10 18:27:13,974 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2022-01-10 18:27:13,974 INFO L854 garLoopResultBuilder]: At program point L77-1(lines 61 79) the Hoare annotation is: (let ((.cse30 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse31 (+ ~p_num_write~0Int 1))) (let ((.cse29 (= 0 ~p_dw_st~0Int)) (.cse15 (< ~c_num_read~0Int .cse31)) (.cse16 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse1 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse7 (= ~p_num_write~0Int 0)) (.cse8 (= ~p_dw_pc~0Int 0)) (.cse10 (= ~q_free~0Int 1)) (.cse11 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse24 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse25 (<= 2 ~q_write_ev~0Int)) (.cse20 (not (= ~q_write_ev~0Int 1))) (.cse27 (< .cse30 .cse31)) (.cse12 (<= 2 ~c_dr_st~0Int)) (.cse28 (<= ~p_num_write~0Int .cse30)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse21 (= ~q_free~0Int 0)) (.cse14 (<= ~q_req_up~0Int 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse26 (not (= ~q_read_ev~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse22 (= ~c_dr_st~0Int 0)) (.cse5 (= ~c_num_read~0Int 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse23 (= ~p_num_write~0Int 1)) (.cse17 (not (= ~q_read_ev~0Int 0))) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (<= 2 ~p_dw_st~0Int)) (.cse19 (not (= ~q_write_ev~0Int 0))) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse10 .cse12 .cse13) (and .cse0 .cse21 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse23 .cse9 .cse18 .cse24 .cse13 .cse25) (and .cse21 .cse14 .cse26 .cse3 .cse22 .cse6 .cse17 .cse9 .cse18 .cse19 .cse20 .cse27 .cse13 .cse28) (and .cse14 .cse26 .cse29 .cse3 .cse6 .cse15 .cse16 .cse17 .cse9 .cse19 .cse20 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse29 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse25) (and .cse0 .cse21 .cse2 .cse4 .cse9 .cse12 .cse13) (and .cse26 .cse3 .cse6 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse24 .cse13 .cse25) (and .cse21 .cse14 .cse26 .cse3 .cse6 .cse17 .cse9 .cse18 .cse19 .cse27 .cse12 .cse13 .cse28) (and .cse21 .cse26 .cse3 .cse6 .cse17 .cse9 .cse18 .cse19 .cse20 .cse27 .cse12 .cse13 .cse28) (and .cse0 .cse21 .cse14 .cse2 .cse26 .cse3 .cse4 .cse22 .cse5 .cse6 .cse23 .cse17 .cse9 .cse18 .cse19 .cse13)))) [2022-01-10 18:27:13,974 INFO L854 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse6 (<= 2 ~p_dw_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse5 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse8 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse3 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (= ~p_num_write~0Int 1) .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (= ~q_write_ev~0Int ~q_read_ev~0Int) .cse7 .cse8 (<= 2 ~q_write_ev~0Int)) (let ((.cse9 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse1 (not (= ~q_read_ev~0Int 1)) (not (= ~q_read_ev~0Int 0)) .cse5 .cse6 (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) (< .cse9 (+ ~p_num_write~0Int 1)) .cse10 .cse8 (<= ~p_num_write~0Int .cse9))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse8))) [2022-01-10 18:27:13,974 INFO L858 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2022-01-10 18:27:13,974 INFO L854 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0Int)) (.cse3 (= 0 ~c_dr_pc~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse6 (= ~c_num_read~0Int 0)) (.cse7 (= ~p_num_write~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse0 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse2 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (not (= ~q_read_ev~0Int 1)) (< ~c_num_read~0Int (+ ~p_num_write~0Int 1)) (<= ~p_num_write~0Int ~c_num_read~0Int) (not (= ~q_read_ev~0Int 0)) .cse0 (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 .cse9 .cse2) (and .cse3 (= ~q_free~0Int 0) .cse4 .cse5 .cse8 .cse0 .cse1 .cse9 .cse2) (and .cse3 (<= ~q_req_up~0Int 0) .cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse5 (= ~c_dr_st~0Int 0) .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) .cse7 .cse8 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (= ~q_write_ev~0Int ~q_read_ev~0Int) .cse9 .cse2 (<= 2 ~q_write_ev~0Int)))) [2022-01-10 18:27:13,974 INFO L854 garLoopResultBuilder]: At program point L198-1(lines 168 216) the Hoare annotation is: (let ((.cse11 (+ ~p_num_write~0Int 1))) (let ((.cse1 (< ~c_num_read~0Int .cse11)) (.cse2 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse0 (not (= ~q_read_ev~0Int 1))) (.cse3 (not (= ~q_read_ev~0Int 0))) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (<= 2 ~p_dw_st~0Int)) (.cse6 (not (= ~q_write_ev~0Int 0))) (.cse7 (not (= ~q_write_ev~0Int 1))) (.cse9 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (= 0 ~p_dw_st~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0) .cse1 (= ~p_dw_pc~0Int 0) .cse2 .cse4 .cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (= ~q_write_ev~0Int ~q_read_ev~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1)) .cse9 (<= 2 ~q_write_ev~0Int)) (let ((.cse10 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse10 .cse11) .cse9 (<= ~p_num_write~0Int .cse10)))))) [2022-01-10 18:27:13,974 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2022-01-10 18:27:13,974 INFO L858 garLoopResultBuilder]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2022-01-10 18:27:13,974 INFO L854 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse0 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse1 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse2 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse3 (= ~q_free~0Int 1)) (.cse4 (<= 2 ~c_dr_st~0Int)) (.cse5 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (not (= ~q_read_ev~0Int 1)) .cse0 .cse1 (not (= ~q_read_ev~0Int 0)) .cse2 (<= 2 ~p_dw_st~0Int) (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) .cse3 .cse4 .cse5) (and (<= ~q_req_up~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (= 0 ~p_dw_st~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0) .cse0 (= ~p_dw_pc~0Int 0) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0) (<= ~p_last_write~0Int ~c_last_read~0Int) .cse4 (= ~q_write_ev~0Int ~q_read_ev~0Int) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1)) .cse5 (<= 2 ~q_write_ev~0Int)))) [2022-01-10 18:27:13,974 INFO L858 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2022-01-10 18:27:13,974 INFO L854 garLoopResultBuilder]: At program point L173(lines 168 216) the Hoare annotation is: (let ((.cse0 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) (not (= ~q_read_ev~0Int 1)) (not (= ~q_read_ev~0Int 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= 2 ~p_dw_st~0Int) (not (= ~q_write_ev~0Int 0)) (not (= ~q_write_ev~0Int 1)) (< .cse0 (+ ~p_num_write~0Int 1)) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= ~p_num_write~0Int .cse0))) [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L315-5(lines 315 319) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 84 93) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L84-5(lines 84 93) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L854 garLoopResultBuilder]: At program point L95-1(lines 83 97) the Hoare annotation is: (let ((.cse31 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse32 (+ ~p_num_write~0Int 1))) (let ((.cse12 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse14 (<= 2 ~q_write_ev~0Int)) (.cse8 (= ~p_num_write~0Int 1)) (.cse16 (< ~c_num_read~0Int .cse32)) (.cse17 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (<= ~q_req_up~0Int 0)) (.cse5 (= ~c_dr_st~0Int 0)) (.cse24 (= 0 ~p_dw_st~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse15 (not (= ~q_read_ev~0Int 1))) (.cse18 (not (= ~q_read_ev~0Int 0))) (.cse10 (<= 2 ~p_dw_st~0Int)) (.cse19 (not (= ~q_write_ev~0Int 0))) (.cse20 (not (= ~q_write_ev~0Int 1))) (.cse29 (< .cse31 .cse32)) (.cse30 (<= ~p_num_write~0Int .cse31)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse25 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (= ~c_num_read~0Int 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse26 (= ~p_num_write~0Int 0)) (.cse27 (= ~p_dw_pc~0Int 0)) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (= ~q_free~0Int 1)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse28 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~c_dr_st~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse15 .cse3 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse21 .cse11 .cse22 .cse13) (and .cse23 .cse2 .cse24 .cse16 .cse17 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse13) (and .cse0 .cse23 .cse25 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse9 .cse21 .cse11 .cse28 .cse12 .cse13 .cse14) (and .cse0 .cse23 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse26 .cse27 .cse9 .cse10 .cse21 .cse11 .cse28 .cse12 .cse13 .cse14) (and .cse1 .cse23 .cse15 .cse3 .cse18 .cse9 .cse10 .cse19 .cse11 .cse29 .cse22 .cse13 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse11 .cse22 .cse13) (and .cse0 .cse1 .cse23 .cse2 .cse15 .cse3 .cse5 .cse6 .cse8 .cse18 .cse9 .cse10 .cse19 .cse11 .cse13) (and .cse23 .cse2 .cse3 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse21 .cse11 .cse22 .cse13) (and .cse1 .cse23 .cse2 .cse15 .cse3 .cse5 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse29 .cse13 .cse30) (and .cse0 .cse1 .cse2 .cse24 .cse9 .cse22 .cse13) (and .cse1 .cse2 .cse15 .cse3 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse29 .cse22 .cse13 .cse30) (and .cse0 .cse25 .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse27 .cse9 .cse21 .cse11 .cse28 .cse22 .cse13)))) [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-01-10 18:27:13,975 INFO L854 garLoopResultBuilder]: At program point L21-1(lines 16 23) the Hoare annotation is: false [2022-01-10 18:27:13,975 INFO L854 garLoopResultBuilder]: At program point L96-1(lines 80 98) the Hoare annotation is: (let ((.cse33 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse32 (+ ~p_num_write~0Int 1))) (let ((.cse20 (< .cse33 .cse32)) (.cse22 (<= ~p_num_write~0Int .cse33)) (.cse9 (= ~p_num_write~0Int 1)) (.cse23 (<= ~q_req_up~0Int 0)) (.cse24 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse25 (= ~p_num_write~0Int 0)) (.cse26 (= ~p_dw_pc~0Int 0)) (.cse28 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse13 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse15 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse29 (= 0 ~p_dw_st~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse16 (not (= ~q_read_ev~0Int 1))) (.cse3 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse30 (< ~c_num_read~0Int .cse32)) (.cse31 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse17 (not (= ~q_read_ev~0Int 0))) (.cse10 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse11 (<= 2 ~p_dw_st~0Int)) (.cse18 (not (= ~q_write_ev~0Int 0))) (.cse19 (not (= ~q_write_ev~0Int 1))) (.cse27 (= ~q_free~0Int 1)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse21 (<= 2 ~c_dr_st~0Int)) (.cse14 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse16 .cse3 .cse5 .cse17 .cse10 .cse11 .cse18 .cse19 .cse12 .cse20 .cse21 .cse14 .cse22) (and .cse1 .cse23 .cse16 .cse3 .cse17 .cse10 .cse11 .cse18 .cse12 .cse20 .cse21 .cse14 .cse22) (and .cse1 .cse23 .cse2 .cse16 .cse3 .cse5 .cse6 .cse17 .cse10 .cse11 .cse18 .cse19 .cse12 .cse20 .cse14 .cse22) (and .cse0 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse26 .cse10 .cse11 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse12 .cse21 .cse14) (and .cse0 .cse24 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse25 .cse26 .cse10 .cse27 .cse12 .cse28 .cse21 .cse14) (and .cse23 .cse2 .cse29 .cse5 .cse30 .cse31 .cse17 .cse10 .cse18 .cse19 .cse27 .cse21 .cse14) (and .cse23 .cse2 .cse3 .cse5 .cse30 .cse31 .cse17 .cse10 .cse11 .cse18 .cse19 .cse27 .cse12 .cse21 .cse14) (and .cse0 .cse1 .cse23 .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse9 .cse17 .cse10 .cse11 .cse18 .cse12 .cse14) (and .cse0 .cse23 .cse24 .cse2 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse26 .cse10 .cse27 .cse12 .cse28 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse29 .cse5 .cse10 .cse21 .cse14) (and .cse2 .cse16 .cse3 .cse5 .cse30 .cse31 .cse17 .cse10 .cse11 .cse18 .cse19 .cse27 .cse12 .cse21 .cse14)))) [2022-01-10 18:27:13,975 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-01-10 18:27:13,976 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2022-01-10 18:27:13,976 INFO L858 garLoopResultBuilder]: For program point L323-3(lines 323 327) no Hoare annotation was computed. [2022-01-10 18:27:13,976 INFO L854 garLoopResultBuilder]: At program point L323-5(lines 307 331) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse22 (= 0 ~p_dw_st~0Int)) (.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse30 (= ~q_free~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse1 (<= ~q_req_up~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse1 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse16 .cse31 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse1 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20)))) [2022-01-10 18:27:13,976 INFO L858 garLoopResultBuilder]: For program point L293-3(lines 293 297) no Hoare annotation was computed. [2022-01-10 18:27:13,976 INFO L858 garLoopResultBuilder]: For program point L293-5(lines 292 305) no Hoare annotation was computed. [2022-01-10 18:27:13,976 INFO L854 garLoopResultBuilder]: At program point L298-3(lines 289 306) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,976 INFO L858 garLoopResultBuilder]: For program point L255-1(lines 255 265) no Hoare annotation was computed. [2022-01-10 18:27:13,976 INFO L854 garLoopResultBuilder]: At program point L267-1(lines 254 269) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,976 INFO L858 garLoopResultBuilder]: For program point L259-1(lines 259 264) no Hoare annotation was computed. [2022-01-10 18:27:13,976 INFO L854 garLoopResultBuilder]: At program point L268-1(lines 251 270) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,976 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2022-01-10 18:27:13,977 INFO L854 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,977 INFO L854 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse34 (mod (+ ~c_num_read~0Int 1) 4294967296)) (.cse33 (+ ~p_num_write~0Int 1))) (let ((.cse18 (= ~q_write_ev~0Int ~q_read_ev~0Int)) (.cse21 (<= 2 ~q_write_ev~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp___0~1#1Int| 1))) (.cse30 (= ~q_free~0Int 0)) (.cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 1))) (.cse7 (= ~c_dr_st~0Int 0)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads_~tmp~1#1Int| 0)) (.cse31 (< .cse34 .cse33)) (.cse32 (<= ~p_num_write~0Int .cse34)) (.cse1 (<= ~q_req_up~0Int 0)) (.cse23 (not (= ~q_read_ev~0Int 1))) (.cse22 (= 0 ~p_dw_st~0Int)) (.cse24 (< ~c_num_read~0Int .cse33)) (.cse25 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse26 (not (= ~q_read_ev~0Int 0))) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse27 (not (= ~q_write_ev~0Int 0))) (.cse28 (not (= ~q_write_ev~0Int 1))) (.cse15 (= ~q_free~0Int 1)) (.cse29 (<= 2 ~c_dr_st~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse23 .cse4 .cse24 .cse25 .cse26 .cse13 .cse14 .cse27 .cse28 .cse15 .cse16 .cse29 .cse20) (and .cse30 .cse23 .cse4 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse29 .cse20 .cse32) (and .cse0 .cse30 .cse3 .cse22 .cse6 .cse11 .cse13 .cse29 .cse19 .cse20) (and .cse0 .cse30 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0Int 1) .cse11 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse30 .cse3 .cse4 .cse6 .cse11 .cse13 .cse16 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse29 .cse19 .cse20) (and .cse30 .cse1 .cse23 .cse4 .cse7 .cse26 .cse13 .cse14 .cse27 .cse28 .cse16 .cse31 .cse20 .cse32) (and .cse1 .cse23 .cse22 .cse24 .cse25 .cse26 .cse13 .cse27 .cse28 .cse15 .cse29 .cse20)))) [2022-01-10 18:27:13,977 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-01-10 18:27:13,979 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:27:13,980 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 18:27:14,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:27:14 BasicIcfg [2022-01-10 18:27:14,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 18:27:14,132 INFO L158 Benchmark]: Toolchain (without parser) took 19926.66ms. Allocated memory was 176.2MB in the beginning and 666.9MB in the end (delta: 490.7MB). Free memory was 124.8MB in the beginning and 369.9MB in the end (delta: -245.2MB). Peak memory consumption was 374.4MB. Max. memory is 8.0GB. [2022-01-10 18:27:14,132 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 18:27:14,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.16ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 149.8MB in the end (delta: -25.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-01-10 18:27:14,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.59ms. Allocated memory is still 176.2MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 18:27:14,133 INFO L158 Benchmark]: Boogie Preprocessor took 17.15ms. Allocated memory is still 176.2MB. Free memory was 147.7MB in the beginning and 145.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 18:27:14,133 INFO L158 Benchmark]: RCFGBuilder took 371.56ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 129.8MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 18:27:14,133 INFO L158 Benchmark]: IcfgTransformer took 86.33ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 122.5MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 18:27:14,134 INFO L158 Benchmark]: TraceAbstraction took 19205.09ms. Allocated memory was 176.2MB in the beginning and 666.9MB in the end (delta: 490.7MB). Free memory was 122.0MB in the beginning and 369.9MB in the end (delta: -248.0MB). Peak memory consumption was 370.9MB. Max. memory is 8.0GB. [2022-01-10 18:27:14,137 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.09ms. Allocated memory is still 176.2MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.16ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 149.8MB in the end (delta: -25.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.59ms. Allocated memory is still 176.2MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.15ms. Allocated memory is still 176.2MB. Free memory was 147.7MB in the beginning and 145.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 371.56ms. Allocated memory is still 176.2MB. Free memory was 145.6MB in the beginning and 129.8MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 86.33ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 122.5MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 19205.09ms. Allocated memory was 176.2MB in the beginning and 666.9MB in the end (delta: 490.7MB). Free memory was 122.0MB in the beginning and 369.9MB in the end (delta: -248.0MB). Peak memory consumption was 370.9MB. 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: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 20]: 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 1 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3173 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3173 mSDsluCounter, 5831 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3114 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 254 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 2717 mSDtfsCounter, 254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2232occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 2968 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 617 NumberOfFragments, 11998 HoareAnnotationTreeSize, 39 FomulaSimplifications, 15719 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 39 FomulaSimplificationsInter, 63827 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1271 NumberOfCodeBlocks, 1271 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 5137 SizeOfPredicates, 2 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 216/222 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 2 specifications checked. All of them hold - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(\result, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) || (((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((p_num_write == 1bv32 && !(1bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || ((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((~bvule32(\result, 0bv32) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || (((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((~bvule32(\result, 0bv32) && ~bvule32(p_num_write, c_num_read)) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(1bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((p_num_write == 1bv32 && !(1bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) || (((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((p_num_write == 1bv32 && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((~bvule32(\result, 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((((((~bvule32(\result, 0bv32) && c_num_read == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(tmp___0, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((p_num_write == 1bv32 && !(0bv32 == q_write_ev)) && c_num_read == 0bv32) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((~bvule32(2bv32, c_dr_st) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || (((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((!(0bv32 == q_write_ev) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((p_num_write == 1bv32 && c_num_read == 0bv32) && ~bvule32(2bv32, q_write_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && q_read_ev == q_write_ev) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)))) || ((((((((((((((!(1bv32 == q_write_ev) && !(0bv32 == q_write_ev)) && ~bvult64(~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0]), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_num_write, ~bvadd16(~zero_extendFrom32To33(c_num_read), 1bv33)[31:0])) && !(1bv32 == q_read_ev)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && !(0bv32 == q_read_ev)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) || ((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((c_num_read == 0bv32 && ~bvule32(2bv32, q_write_ev)) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && q_free == 1bv32) && ~bvule32(q_req_up, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) && q_read_ev == q_write_ev) RESULT: Ultimate proved your program to be correct! [2022-01-10 18:27:14,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...