/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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:00:05,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:00:05,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:00:05,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:00:05,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:00:05,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:00:05,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:00:05,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:00:05,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:00:05,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:00:05,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:00:05,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:00:05,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:00:05,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:00:05,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:00:05,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:00:05,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:00:05,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:00:05,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:00:05,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:00:05,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:00:05,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:00:05,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:00:05,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:00:05,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:00:05,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:00:05,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:00:05,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:00:05,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:00:05,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:00:05,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:00:05,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:00:05,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:00:05,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:00:05,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:00:05,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:00:05,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:00:05,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:00:05,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:00:05,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:00:05,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:00:05,522 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 20:00:05,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:00:05,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:00:05,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:00:05,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:00:05,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:00:05,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:00:05,548 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:00:05,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:00:05,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:00:05,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:00:05,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:00:05,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:00:05,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:00:05,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:00:05,551 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:00:05,551 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 20:00:05,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:00:05,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:00:05,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:00:05,712 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:00:05,714 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:00:05,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 20:00:05,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e068c378b/c2acf5d5729c44628ce035607be47698/FLAGfe6c1d913 [2022-01-10 20:00:06,141 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:00:06,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-01-10 20:00:06,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e068c378b/c2acf5d5729c44628ce035607be47698/FLAGfe6c1d913 [2022-01-10 20:00:06,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e068c378b/c2acf5d5729c44628ce035607be47698 [2022-01-10 20:00:06,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:00:06,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:00:06,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:00:06,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:00:06,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:00:06,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d83ee28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06, skipping insertion in model container [2022-01-10 20:00:06,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:00:06,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:00:06,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-01-10 20:00:06,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-01-10 20:00:06,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:00:06,764 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:00:06,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-01-10 20:00:06,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-01-10 20:00:06,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:00:06,810 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:00:06,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06 WrapperNode [2022-01-10 20:00:06,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:00:06,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:00:06,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:00:06,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:00:06,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,854 INFO L137 Inliner]: procedures = 51, calls = 51, calls flagged for inlining = 46, calls inlined = 57, statements flattened = 658 [2022-01-10 20:00:06,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:00:06,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:00:06,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:00:06,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:00:06,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:00:06,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:00:06,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:00:06,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:00:06,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (1/1) ... [2022-01-10 20:00:06,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:00:06,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:00:06,919 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 20:00:06,926 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 20:00:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:00:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:00:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:00:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:00:07,031 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:00:07,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:00:07,533 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:00:07,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:00:07,543 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 20:00:07,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:00:07 BoogieIcfgContainer [2022-01-10 20:00:07,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:00:07,545 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:00:07,546 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:00:07,546 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:00:07,549 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:00:07" (1/1) ... [2022-01-10 20:00:07,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:00:07 BasicIcfg [2022-01-10 20:00:07,656 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:00:07,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:00:07,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:00:07,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:00:07,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:00:06" (1/4) ... [2022-01-10 20:00:07,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fc5b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:00:07, skipping insertion in model container [2022-01-10 20:00:07,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:00:06" (2/4) ... [2022-01-10 20:00:07,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fc5b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:00:07, skipping insertion in model container [2022-01-10 20:00:07,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:00:07" (3/4) ... [2022-01-10 20:00:07,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fc5b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:00:07, skipping insertion in model container [2022-01-10 20:00:07,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:00:07" (4/4) ... [2022-01-10 20:00:07,661 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.cTransformedIcfg [2022-01-10 20:00:07,665 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:00:07,665 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 20:00:07,695 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:00:07,700 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 20:00:07,700 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 20:00:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 228 states have (on average 1.543859649122807) internal successors, (352), 231 states have internal predecessors, (352), 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 20:00:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 20:00:07,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:07,719 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] [2022-01-10 20:00:07,719 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1663506464, now seen corresponding path program 1 times [2022-01-10 20:00:07,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:07,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757405929] [2022-01-10 20:00:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:07,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:07,909 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 20:00:07,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:07,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757405929] [2022-01-10 20:00:07,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757405929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:07,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:07,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:07,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577437152] [2022-01-10 20:00:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:07,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:07,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:07,943 INFO L87 Difference]: Start difference. First operand has 232 states, 228 states have (on average 1.543859649122807) internal successors, (352), 231 states have internal predecessors, (352), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 20:00:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:08,044 INFO L93 Difference]: Finished difference Result 495 states and 750 transitions. [2022-01-10 20:00:08,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:08,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-01-10 20:00:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:08,064 INFO L225 Difference]: With dead ends: 495 [2022-01-10 20:00:08,064 INFO L226 Difference]: Without dead ends: 287 [2022-01-10 20:00:08,068 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 20:00:08,072 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 301 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:08,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 434 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-01-10 20:00:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2022-01-10 20:00:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.4524714828897338) internal successors, (382), 265 states have internal predecessors, (382), 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 20:00:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 382 transitions. [2022-01-10 20:00:08,133 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 382 transitions. Word has length 36 [2022-01-10 20:00:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:08,133 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 382 transitions. [2022-01-10 20:00:08,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 20:00:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 382 transitions. [2022-01-10 20:00:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:00:08,137 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:08,137 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] [2022-01-10 20:00:08,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:00:08,138 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1412767873, now seen corresponding path program 1 times [2022-01-10 20:00:08,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:08,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969414280] [2022-01-10 20:00:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:08,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:08,237 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 20:00:08,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:08,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969414280] [2022-01-10 20:00:08,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969414280] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:08,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:08,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:08,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725429809] [2022-01-10 20:00:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:08,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:08,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:08,239 INFO L87 Difference]: Start difference. First operand 266 states and 382 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 20:00:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:08,285 INFO L93 Difference]: Finished difference Result 435 states and 617 transitions. [2022-01-10 20:00:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:08,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2022-01-10 20:00:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:08,289 INFO L225 Difference]: With dead ends: 435 [2022-01-10 20:00:08,289 INFO L226 Difference]: Without dead ends: 324 [2022-01-10 20:00:08,289 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 20:00:08,290 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 60 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:08,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 601 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-01-10 20:00:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2022-01-10 20:00:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 316 states have (on average 1.4398734177215189) internal successors, (455), 318 states have internal predecessors, (455), 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 20:00:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 455 transitions. [2022-01-10 20:00:08,306 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 455 transitions. Word has length 37 [2022-01-10 20:00:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:08,306 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 455 transitions. [2022-01-10 20:00:08,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 20:00:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 455 transitions. [2022-01-10 20:00:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 20:00:08,313 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:08,314 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] [2022-01-10 20:00:08,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:00:08,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:08,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1567064706, now seen corresponding path program 1 times [2022-01-10 20:00:08,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:08,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162135131] [2022-01-10 20:00:08,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:08,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:08,404 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 20:00:08,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:08,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162135131] [2022-01-10 20:00:08,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162135131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:08,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:08,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:08,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678849246] [2022-01-10 20:00:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:08,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:08,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:08,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:08,406 INFO L87 Difference]: Start difference. First operand 319 states and 455 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 20:00:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:08,426 INFO L93 Difference]: Finished difference Result 636 states and 891 transitions. [2022-01-10 20:00:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2022-01-10 20:00:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:08,433 INFO L225 Difference]: With dead ends: 636 [2022-01-10 20:00:08,433 INFO L226 Difference]: Without dead ends: 472 [2022-01-10 20:00:08,434 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 20:00:08,434 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 292 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:08,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 431 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-01-10 20:00:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 450. [2022-01-10 20:00:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 447 states have (on average 1.4116331096196868) internal successors, (631), 449 states have internal predecessors, (631), 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 20:00:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 631 transitions. [2022-01-10 20:00:08,465 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 631 transitions. Word has length 37 [2022-01-10 20:00:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:08,465 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 631 transitions. [2022-01-10 20:00:08,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 20:00:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 631 transitions. [2022-01-10 20:00:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:00:08,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:08,466 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 20:00:08,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:00:08,466 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:08,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1571034439, now seen corresponding path program 1 times [2022-01-10 20:00:08,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:08,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768155126] [2022-01-10 20:00:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:08,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:08,527 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 20:00:08,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:08,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768155126] [2022-01-10 20:00:08,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768155126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:08,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:08,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:08,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368758263] [2022-01-10 20:00:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:08,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:08,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:08,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:08,531 INFO L87 Difference]: Start difference. First operand 450 states and 631 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 20:00:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:08,545 INFO L93 Difference]: Finished difference Result 593 states and 842 transitions. [2022-01-10 20:00:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:08,549 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 20:00:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:08,551 INFO L225 Difference]: With dead ends: 593 [2022-01-10 20:00:08,551 INFO L226 Difference]: Without dead ends: 450 [2022-01-10 20:00:08,553 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 20:00:08,559 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 212 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:08,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 425 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-01-10 20:00:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2022-01-10 20:00:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 447 states have (on average 1.4093959731543624) internal successors, (630), 449 states have internal predecessors, (630), 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 20:00:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 630 transitions. [2022-01-10 20:00:08,575 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 630 transitions. Word has length 44 [2022-01-10 20:00:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:08,575 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 630 transitions. [2022-01-10 20:00:08,576 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 20:00:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 630 transitions. [2022-01-10 20:00:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:00:08,578 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:08,579 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 20:00:08,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:00:08,579 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash -648350856, now seen corresponding path program 1 times [2022-01-10 20:00:08,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:08,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912485971] [2022-01-10 20:00:08,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:08,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:08,625 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 20:00:08,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:08,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912485971] [2022-01-10 20:00:08,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912485971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:08,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:08,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:00:08,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372424846] [2022-01-10 20:00:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:08,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:08,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:08,626 INFO L87 Difference]: Start difference. First operand 450 states and 630 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:08,677 INFO L93 Difference]: Finished difference Result 691 states and 983 transitions. [2022-01-10 20:00:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:08,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:08,679 INFO L225 Difference]: With dead ends: 691 [2022-01-10 20:00:08,679 INFO L226 Difference]: Without dead ends: 551 [2022-01-10 20:00:08,680 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 20:00:08,680 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 285 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:08,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 478 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-01-10 20:00:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2022-01-10 20:00:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 1.413919413919414) internal successors, (772), 548 states have internal predecessors, (772), 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 20:00:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 772 transitions. [2022-01-10 20:00:08,704 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 772 transitions. Word has length 44 [2022-01-10 20:00:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:08,707 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 772 transitions. [2022-01-10 20:00:08,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 772 transitions. [2022-01-10 20:00:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:00:08,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:08,709 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 20:00:08,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:00:08,709 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash 457477528, now seen corresponding path program 1 times [2022-01-10 20:00:08,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:08,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016523859] [2022-01-10 20:00:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:08,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:08,757 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 20:00:08,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:08,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016523859] [2022-01-10 20:00:08,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016523859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:08,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:08,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:00:08,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076113552] [2022-01-10 20:00:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:08,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:08,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:08,758 INFO L87 Difference]: Start difference. First operand 549 states and 772 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:08,788 INFO L93 Difference]: Finished difference Result 787 states and 1119 transitions. [2022-01-10 20:00:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:08,791 INFO L225 Difference]: With dead ends: 787 [2022-01-10 20:00:08,791 INFO L226 Difference]: Without dead ends: 549 [2022-01-10 20:00:08,792 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 20:00:08,796 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:08,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 309 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-01-10 20:00:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2022-01-10 20:00:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 1.3992673992673992) internal successors, (764), 548 states have internal predecessors, (764), 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 20:00:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 764 transitions. [2022-01-10 20:00:08,838 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 764 transitions. Word has length 44 [2022-01-10 20:00:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:08,838 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 764 transitions. [2022-01-10 20:00:08,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 764 transitions. [2022-01-10 20:00:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:00:08,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:08,840 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 20:00:08,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:00:08,840 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:08,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1185886072, now seen corresponding path program 1 times [2022-01-10 20:00:08,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:08,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199271608] [2022-01-10 20:00:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:08,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:08,889 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 20:00:08,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:08,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199271608] [2022-01-10 20:00:08,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199271608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:08,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:08,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:00:08,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129522218] [2022-01-10 20:00:08,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:08,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:08,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:08,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:08,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:08,892 INFO L87 Difference]: Start difference. First operand 549 states and 764 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:08,933 INFO L93 Difference]: Finished difference Result 786 states and 1102 transitions. [2022-01-10 20:00:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:08,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:08,935 INFO L225 Difference]: With dead ends: 786 [2022-01-10 20:00:08,935 INFO L226 Difference]: Without dead ends: 549 [2022-01-10 20:00:08,935 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 20:00:08,936 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 273 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:08,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 314 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-01-10 20:00:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2022-01-10 20:00:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 1.3736263736263736) internal successors, (750), 548 states have internal predecessors, (750), 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 20:00:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 750 transitions. [2022-01-10 20:00:08,956 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 750 transitions. Word has length 44 [2022-01-10 20:00:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:08,956 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 750 transitions. [2022-01-10 20:00:08,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 750 transitions. [2022-01-10 20:00:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:00:08,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:08,957 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 20:00:08,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:00:08,958 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:08,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1710157034, now seen corresponding path program 1 times [2022-01-10 20:00:08,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:08,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813526764] [2022-01-10 20:00:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:08,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:08,990 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 20:00:08,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:08,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813526764] [2022-01-10 20:00:08,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813526764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:08,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:08,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:00:08,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858165818] [2022-01-10 20:00:08,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:08,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:08,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:08,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:08,992 INFO L87 Difference]: Start difference. First operand 549 states and 750 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:09,029 INFO L93 Difference]: Finished difference Result 785 states and 1073 transitions. [2022-01-10 20:00:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:09,031 INFO L225 Difference]: With dead ends: 785 [2022-01-10 20:00:09,031 INFO L226 Difference]: Without dead ends: 549 [2022-01-10 20:00:09,032 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 20:00:09,032 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 264 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:09,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 304 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-01-10 20:00:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2022-01-10 20:00:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 1.347985347985348) internal successors, (736), 548 states have internal predecessors, (736), 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 20:00:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 736 transitions. [2022-01-10 20:00:09,051 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 736 transitions. Word has length 44 [2022-01-10 20:00:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:09,051 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 736 transitions. [2022-01-10 20:00:09,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 736 transitions. [2022-01-10 20:00:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:00:09,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:09,052 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 20:00:09,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:00:09,052 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1974343605, now seen corresponding path program 1 times [2022-01-10 20:00:09,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:09,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777207831] [2022-01-10 20:00:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:09,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:09,110 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 20:00:09,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777207831] [2022-01-10 20:00:09,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777207831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:09,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:09,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:00:09,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246351931] [2022-01-10 20:00:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:09,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:00:09,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:00:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:00:09,112 INFO L87 Difference]: Start difference. First operand 549 states and 736 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 20:00:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:09,184 INFO L93 Difference]: Finished difference Result 940 states and 1257 transitions. [2022-01-10 20:00:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:00:09,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 20:00:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:09,186 INFO L225 Difference]: With dead ends: 940 [2022-01-10 20:00:09,186 INFO L226 Difference]: Without dead ends: 711 [2022-01-10 20:00:09,187 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 20:00:09,188 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 468 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:09,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 971 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-01-10 20:00:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 555. [2022-01-10 20:00:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 552 states have (on average 1.3333333333333333) internal successors, (736), 554 states have internal predecessors, (736), 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 20:00:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 736 transitions. [2022-01-10 20:00:09,213 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 736 transitions. Word has length 44 [2022-01-10 20:00:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:09,213 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 736 transitions. [2022-01-10 20:00:09,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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 20:00:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 736 transitions. [2022-01-10 20:00:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:00:09,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:09,213 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 20:00:09,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:00:09,214 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:09,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:09,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1359009674, now seen corresponding path program 1 times [2022-01-10 20:00:09,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:09,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343612989] [2022-01-10 20:00:09,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:09,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:09,251 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 20:00:09,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:09,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343612989] [2022-01-10 20:00:09,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343612989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:09,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:09,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:00:09,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318785754] [2022-01-10 20:00:09,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:09,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:09,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:09,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:09,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:09,253 INFO L87 Difference]: Start difference. First operand 555 states and 736 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:09,296 INFO L93 Difference]: Finished difference Result 995 states and 1301 transitions. [2022-01-10 20:00:09,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:09,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:09,300 INFO L225 Difference]: With dead ends: 995 [2022-01-10 20:00:09,300 INFO L226 Difference]: Without dead ends: 755 [2022-01-10 20:00:09,301 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 20:00:09,301 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 232 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:09,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 423 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-01-10 20:00:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 729. [2022-01-10 20:00:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 726 states have (on average 1.3112947658402203) internal successors, (952), 728 states have internal predecessors, (952), 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 20:00:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 952 transitions. [2022-01-10 20:00:09,332 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 952 transitions. Word has length 44 [2022-01-10 20:00:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:09,333 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 952 transitions. [2022-01-10 20:00:09,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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 20:00:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 952 transitions. [2022-01-10 20:00:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:00:09,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:09,334 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] [2022-01-10 20:00:09,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:00:09,334 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:09,334 INFO L85 PathProgramCache]: Analyzing trace with hash -922663069, now seen corresponding path program 1 times [2022-01-10 20:00:09,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:09,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61932772] [2022-01-10 20:00:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:09,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:09,361 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 20:00:09,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:09,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61932772] [2022-01-10 20:00:09,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61932772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:09,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:09,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:09,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57241594] [2022-01-10 20:00:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:09,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:09,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:09,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:09,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:09,363 INFO L87 Difference]: Start difference. First operand 729 states and 952 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 20:00:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:09,423 INFO L93 Difference]: Finished difference Result 1180 states and 1559 transitions. [2022-01-10 20:00:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 20:00:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:09,426 INFO L225 Difference]: With dead ends: 1180 [2022-01-10 20:00:09,426 INFO L226 Difference]: Without dead ends: 885 [2022-01-10 20:00:09,426 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 20:00:09,427 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 48 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:09,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 617 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-01-10 20:00:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2022-01-10 20:00:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 882 states have (on average 1.2925170068027212) internal successors, (1140), 884 states have internal predecessors, (1140), 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 20:00:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1140 transitions. [2022-01-10 20:00:09,463 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1140 transitions. Word has length 51 [2022-01-10 20:00:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:09,463 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1140 transitions. [2022-01-10 20:00:09,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 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 20:00:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1140 transitions. [2022-01-10 20:00:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 20:00:09,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:09,464 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, 1, 1, 1, 1, 1] [2022-01-10 20:00:09,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:00:09,465 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -558478630, now seen corresponding path program 1 times [2022-01-10 20:00:09,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:09,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574961616] [2022-01-10 20:00:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:09,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:09,490 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 20:00:09,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574961616] [2022-01-10 20:00:09,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574961616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:09,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:09,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:09,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819792255] [2022-01-10 20:00:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:09,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:09,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:09,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:09,491 INFO L87 Difference]: Start difference. First operand 885 states and 1140 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 20:00:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:09,534 INFO L93 Difference]: Finished difference Result 1358 states and 1756 transitions. [2022-01-10 20:00:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:09,534 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 20:00:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:09,537 INFO L225 Difference]: With dead ends: 1358 [2022-01-10 20:00:09,537 INFO L226 Difference]: Without dead ends: 993 [2022-01-10 20:00:09,538 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 20:00:09,538 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 234 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 376 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 20:00:09,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 376 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-01-10 20:00:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2022-01-10 20:00:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 990 states have (on average 1.2808080808080808) internal successors, (1268), 992 states have internal predecessors, (1268), 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 20:00:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1268 transitions. [2022-01-10 20:00:09,574 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1268 transitions. Word has length 55 [2022-01-10 20:00:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:09,574 INFO L470 AbstractCegarLoop]: Abstraction has 993 states and 1268 transitions. [2022-01-10 20:00:09,574 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 20:00:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1268 transitions. [2022-01-10 20:00:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:00:09,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:09,575 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, 1, 1, 1, 1] [2022-01-10 20:00:09,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:00:09,576 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1792920769, now seen corresponding path program 1 times [2022-01-10 20:00:09,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:09,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744991293] [2022-01-10 20:00:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:09,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:09,625 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 20:00:09,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:09,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744991293] [2022-01-10 20:00:09,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744991293] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:09,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:09,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:00:09,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390663388] [2022-01-10 20:00:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:09,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:00:09,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:00:09,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:00:09,626 INFO L87 Difference]: Start difference. First operand 993 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 20:00:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:09,724 INFO L93 Difference]: Finished difference Result 2076 states and 2672 transitions. [2022-01-10 20:00:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:00:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2022-01-10 20:00:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:09,729 INFO L225 Difference]: With dead ends: 2076 [2022-01-10 20:00:09,729 INFO L226 Difference]: Without dead ends: 1653 [2022-01-10 20:00:09,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 20:00:09,731 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 302 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:09,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 1362 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-01-10 20:00:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1017. [2022-01-10 20:00:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1014 states have (on average 1.2702169625246549) internal successors, (1288), 1016 states have internal predecessors, (1288), 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 20:00:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1288 transitions. [2022-01-10 20:00:09,812 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1288 transitions. Word has length 56 [2022-01-10 20:00:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:09,813 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 1288 transitions. [2022-01-10 20:00:09,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 20:00:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1288 transitions. [2022-01-10 20:00:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:00:09,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:09,814 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, 1, 1, 1, 1] [2022-01-10 20:00:09,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:00:09,814 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2143720706, now seen corresponding path program 1 times [2022-01-10 20:00:09,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255592547] [2022-01-10 20:00:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:09,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:09,854 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 20:00:09,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:09,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255592547] [2022-01-10 20:00:09,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255592547] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:09,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:09,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:00:09,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256771474] [2022-01-10 20:00:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:09,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:00:09,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:00:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:00:09,856 INFO L87 Difference]: Start difference. First operand 1017 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 20:00:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:09,954 INFO L93 Difference]: Finished difference Result 1806 states and 2298 transitions. [2022-01-10 20:00:09,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:00:09,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2022-01-10 20:00:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:09,958 INFO L225 Difference]: With dead ends: 1806 [2022-01-10 20:00:09,958 INFO L226 Difference]: Without dead ends: 1308 [2022-01-10 20:00:09,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:00:09,961 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 276 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:09,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 1308 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2022-01-10 20:00:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 915. [2022-01-10 20:00:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 912 states have (on average 1.268640350877193) internal successors, (1157), 914 states have internal predecessors, (1157), 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 20:00:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1157 transitions. [2022-01-10 20:00:10,007 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1157 transitions. Word has length 56 [2022-01-10 20:00:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:10,008 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1157 transitions. [2022-01-10 20:00:10,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 20:00:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1157 transitions. [2022-01-10 20:00:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:00:10,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:10,010 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, 1, 1, 1, 1] [2022-01-10 20:00:10,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:00:10,010 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash 66541154, now seen corresponding path program 1 times [2022-01-10 20:00:10,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:10,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345094417] [2022-01-10 20:00:10,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:10,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:10,079 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 20:00:10,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:10,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345094417] [2022-01-10 20:00:10,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345094417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:10,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:10,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:00:10,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442513782] [2022-01-10 20:00:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:10,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:00:10,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:10,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:00:10,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:00:10,080 INFO L87 Difference]: Start difference. First operand 915 states and 1157 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 20:00:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:10,178 INFO L93 Difference]: Finished difference Result 965 states and 1217 transitions. [2022-01-10 20:00:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:00:10,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-01-10 20:00:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:10,181 INFO L225 Difference]: With dead ends: 965 [2022-01-10 20:00:10,182 INFO L226 Difference]: Without dead ends: 963 [2022-01-10 20:00:10,183 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 20:00:10,184 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 544 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:10,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 357 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-01-10 20:00:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 913. [2022-01-10 20:00:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 911 states have (on average 1.2667398463227222) internal successors, (1154), 912 states have internal predecessors, (1154), 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 20:00:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1154 transitions. [2022-01-10 20:00:10,242 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1154 transitions. Word has length 56 [2022-01-10 20:00:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:10,242 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1154 transitions. [2022-01-10 20:00:10,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 20:00:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1154 transitions. [2022-01-10 20:00:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 20:00:10,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:10,243 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, 1, 1, 1, 1, 1] [2022-01-10 20:00:10,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:00:10,243 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2062775866, now seen corresponding path program 1 times [2022-01-10 20:00:10,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:10,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7975874] [2022-01-10 20:00:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:10,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:10,383 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 20:00:10,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:10,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7975874] [2022-01-10 20:00:10,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7975874] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:00:10,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514763474] [2022-01-10 20:00:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:10,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:00:10,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:00:10,396 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 20:00:10,415 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 20:00:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:10,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 20:00:10,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:00:10,756 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 20:00:10,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:00:10,992 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 20:00:10,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514763474] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:00:10,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:00:10,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 20:00:10,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010263406] [2022-01-10 20:00:10,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:00:10,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 20:00:10,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 20:00:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:00:10,994 INFO L87 Difference]: Start difference. First operand 913 states and 1154 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 20:00:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:11,236 INFO L93 Difference]: Finished difference Result 1799 states and 2282 transitions. [2022-01-10 20:00:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:00:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 57 [2022-01-10 20:00:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:11,241 INFO L225 Difference]: With dead ends: 1799 [2022-01-10 20:00:11,241 INFO L226 Difference]: Without dead ends: 1797 [2022-01-10 20:00:11,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 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 20:00:11,242 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 793 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:11,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [793 Valid, 1763 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2022-01-10 20:00:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1185. [2022-01-10 20:00:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1183 states have (on average 1.2738799661876585) internal successors, (1507), 1184 states have internal predecessors, (1507), 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 20:00:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1507 transitions. [2022-01-10 20:00:11,351 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1507 transitions. Word has length 57 [2022-01-10 20:00:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:11,351 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 1507 transitions. [2022-01-10 20:00:11,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 20:00:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1507 transitions. [2022-01-10 20:00:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 20:00:11,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:11,353 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 20:00:11,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 20:00:11,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-10 20:00:11,568 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash -982980473, now seen corresponding path program 1 times [2022-01-10 20:00:11,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:11,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049795659] [2022-01-10 20:00:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:11,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:00:11,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:11,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049795659] [2022-01-10 20:00:11,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049795659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:11,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:11,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:11,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433819485] [2022-01-10 20:00:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:11,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:11,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:11,594 INFO L87 Difference]: Start difference. First operand 1185 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 20:00:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:11,734 INFO L93 Difference]: Finished difference Result 1933 states and 2460 transitions. [2022-01-10 20:00:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-01-10 20:00:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:11,738 INFO L225 Difference]: With dead ends: 1933 [2022-01-10 20:00:11,738 INFO L226 Difference]: Without dead ends: 1525 [2022-01-10 20:00:11,739 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 20:00:11,739 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 230 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:11,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 417 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-01-10 20:00:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1491. [2022-01-10 20:00:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1489 states have (on average 1.2713230355943586) internal successors, (1893), 1490 states have internal predecessors, (1893), 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 20:00:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1893 transitions. [2022-01-10 20:00:11,845 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1893 transitions. Word has length 70 [2022-01-10 20:00:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:11,845 INFO L470 AbstractCegarLoop]: Abstraction has 1491 states and 1893 transitions. [2022-01-10 20:00:11,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 20:00:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1893 transitions. [2022-01-10 20:00:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 20:00:11,846 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:11,846 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 20:00:11,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:00:11,847 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:11,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1589278010, now seen corresponding path program 1 times [2022-01-10 20:00:11,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:11,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082009406] [2022-01-10 20:00:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:11,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:00:11,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:11,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082009406] [2022-01-10 20:00:11,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082009406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:11,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:11,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:11,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629301070] [2022-01-10 20:00:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:11,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:11,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:11,869 INFO L87 Difference]: Start difference. First operand 1491 states and 1893 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 20:00:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:12,042 INFO L93 Difference]: Finished difference Result 2834 states and 3581 transitions. [2022-01-10 20:00:12,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:12,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-01-10 20:00:12,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:12,047 INFO L225 Difference]: With dead ends: 2834 [2022-01-10 20:00:12,047 INFO L226 Difference]: Without dead ends: 2130 [2022-01-10 20:00:12,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 20:00:12,049 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 245 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:12,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 458 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2022-01-10 20:00:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2112. [2022-01-10 20:00:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 2110 states have (on average 1.2507109004739336) internal successors, (2639), 2111 states have internal predecessors, (2639), 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 20:00:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2639 transitions. [2022-01-10 20:00:12,191 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2639 transitions. Word has length 70 [2022-01-10 20:00:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:12,191 INFO L470 AbstractCegarLoop]: Abstraction has 2112 states and 2639 transitions. [2022-01-10 20:00:12,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 20:00:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2639 transitions. [2022-01-10 20:00:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 20:00:12,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:12,193 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 20:00:12,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:00:12,193 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -439708953, now seen corresponding path program 1 times [2022-01-10 20:00:12,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:12,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817959911] [2022-01-10 20:00:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:12,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:00:12,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817959911] [2022-01-10 20:00:12,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817959911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:12,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:12,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:12,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36965856] [2022-01-10 20:00:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:12,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:12,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:12,243 INFO L87 Difference]: Start difference. First operand 2112 states and 2639 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 20:00:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:12,390 INFO L93 Difference]: Finished difference Result 3420 states and 4260 transitions. [2022-01-10 20:00:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 70 [2022-01-10 20:00:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:12,395 INFO L225 Difference]: With dead ends: 3420 [2022-01-10 20:00:12,396 INFO L226 Difference]: Without dead ends: 2089 [2022-01-10 20:00:12,397 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 20:00:12,398 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 177 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:12,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 385 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-01-10 20:00:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2022-01-10 20:00:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2087 states have (on average 1.2525155725922377) internal successors, (2614), 2088 states have internal predecessors, (2614), 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 20:00:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2614 transitions. [2022-01-10 20:00:12,528 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2614 transitions. Word has length 70 [2022-01-10 20:00:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:12,528 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 2614 transitions. [2022-01-10 20:00:12,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 20:00:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2614 transitions. [2022-01-10 20:00:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 20:00:12,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:12,530 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 20:00:12,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:00:12,530 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1915329894, now seen corresponding path program 1 times [2022-01-10 20:00:12,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:12,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67757680] [2022-01-10 20:00:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:12,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:00:12,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:12,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67757680] [2022-01-10 20:00:12,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67757680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:12,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:12,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:12,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707968621] [2022-01-10 20:00:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:12,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:12,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:12,554 INFO L87 Difference]: Start difference. First operand 2089 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 20:00:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:12,722 INFO L93 Difference]: Finished difference Result 3395 states and 4243 transitions. [2022-01-10 20:00:12,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:12,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2022-01-10 20:00:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:12,729 INFO L225 Difference]: With dead ends: 3395 [2022-01-10 20:00:12,729 INFO L226 Difference]: Without dead ends: 2643 [2022-01-10 20:00:12,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 20:00:12,731 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:12,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 659 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2022-01-10 20:00:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2643. [2022-01-10 20:00:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2641 states have (on average 1.2381673608481636) internal successors, (3270), 2642 states have internal predecessors, (3270), 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 20:00:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3270 transitions. [2022-01-10 20:00:12,923 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3270 transitions. Word has length 71 [2022-01-10 20:00:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:12,924 INFO L470 AbstractCegarLoop]: Abstraction has 2643 states and 3270 transitions. [2022-01-10 20:00:12,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 20:00:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3270 transitions. [2022-01-10 20:00:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 20:00:12,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:12,925 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:00:12,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:00:12,925 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:12,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash -867563401, now seen corresponding path program 2 times [2022-01-10 20:00:12,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:12,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529860312] [2022-01-10 20:00:12,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:12,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:00:12,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:12,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529860312] [2022-01-10 20:00:12,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529860312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:12,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:12,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:12,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217750936] [2022-01-10 20:00:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:12,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:12,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:12,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:12,955 INFO L87 Difference]: Start difference. First operand 2643 states and 3270 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 20:00:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:13,102 INFO L93 Difference]: Finished difference Result 3150 states and 3930 transitions. [2022-01-10 20:00:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:13,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2022-01-10 20:00:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:13,108 INFO L225 Difference]: With dead ends: 3150 [2022-01-10 20:00:13,108 INFO L226 Difference]: Without dead ends: 2554 [2022-01-10 20:00:13,109 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 20:00:13,109 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 235 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:13,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 388 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-01-10 20:00:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2528. [2022-01-10 20:00:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2526 states have (on average 1.234362628661916) internal successors, (3118), 2527 states have internal predecessors, (3118), 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 20:00:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3118 transitions. [2022-01-10 20:00:13,278 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3118 transitions. Word has length 72 [2022-01-10 20:00:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:13,278 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 3118 transitions. [2022-01-10 20:00:13,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 20:00:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3118 transitions. [2022-01-10 20:00:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 20:00:13,279 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:13,279 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:00:13,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:00:13,280 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash -89301171, now seen corresponding path program 1 times [2022-01-10 20:00:13,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:13,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524869689] [2022-01-10 20:00:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:13,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:00:13,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:13,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524869689] [2022-01-10 20:00:13,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524869689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:13,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:13,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:13,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893140413] [2022-01-10 20:00:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:13,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:13,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:13,310 INFO L87 Difference]: Start difference. First operand 2528 states and 3118 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 20:00:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:13,467 INFO L93 Difference]: Finished difference Result 3182 states and 3945 transitions. [2022-01-10 20:00:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 84 [2022-01-10 20:00:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:13,473 INFO L225 Difference]: With dead ends: 3182 [2022-01-10 20:00:13,473 INFO L226 Difference]: Without dead ends: 2546 [2022-01-10 20:00:13,474 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 20:00:13,475 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 220 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:13,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 376 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-01-10 20:00:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2528. [2022-01-10 20:00:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2526 states have (on average 1.2264449722882027) internal successors, (3098), 2527 states have internal predecessors, (3098), 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 20:00:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3098 transitions. [2022-01-10 20:00:13,695 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3098 transitions. Word has length 84 [2022-01-10 20:00:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:13,696 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 3098 transitions. [2022-01-10 20:00:13,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 20:00:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3098 transitions. [2022-01-10 20:00:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 20:00:13,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:13,698 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:00:13,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:00:13,698 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1938050911, now seen corresponding path program 1 times [2022-01-10 20:00:13,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:13,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553066606] [2022-01-10 20:00:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:13,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:00:13,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:13,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553066606] [2022-01-10 20:00:13,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553066606] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:13,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:13,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:13,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577148797] [2022-01-10 20:00:13,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:13,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:13,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:13,724 INFO L87 Difference]: Start difference. First operand 2528 states and 3098 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 20:00:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:13,848 INFO L93 Difference]: Finished difference Result 2792 states and 3416 transitions. [2022-01-10 20:00:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 85 [2022-01-10 20:00:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:13,853 INFO L225 Difference]: With dead ends: 2792 [2022-01-10 20:00:13,853 INFO L226 Difference]: Without dead ends: 1886 [2022-01-10 20:00:13,855 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 20:00:13,855 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 56 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:13,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 568 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-01-10 20:00:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2022-01-10 20:00:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 1.2212201591511935) internal successors, (2302), 1885 states have internal predecessors, (2302), 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 20:00:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2302 transitions. [2022-01-10 20:00:13,945 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2302 transitions. Word has length 85 [2022-01-10 20:00:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:13,945 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 2302 transitions. [2022-01-10 20:00:13,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 20:00:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2302 transitions. [2022-01-10 20:00:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 20:00:13,946 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:13,946 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1] [2022-01-10 20:00:13,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:00:13,949 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:13,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1877891253, now seen corresponding path program 1 times [2022-01-10 20:00:13,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:13,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96894232] [2022-01-10 20:00:13,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:13,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 20:00:13,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:13,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96894232] [2022-01-10 20:00:13,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96894232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:13,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:13,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:13,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083683388] [2022-01-10 20:00:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:13,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:13,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:13,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:13,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:13,978 INFO L87 Difference]: Start difference. First operand 1886 states and 2302 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 20:00:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:14,088 INFO L93 Difference]: Finished difference Result 3694 states and 4501 transitions. [2022-01-10 20:00:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:14,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 103 [2022-01-10 20:00:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:14,092 INFO L225 Difference]: With dead ends: 3694 [2022-01-10 20:00:14,093 INFO L226 Difference]: Without dead ends: 1838 [2022-01-10 20:00:14,094 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 20:00:14,095 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 108 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:14,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 327 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-10 20:00:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2022-01-10 20:00:14,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1790963527490474) internal successors, (2166), 1837 states have internal predecessors, (2166), 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 20:00:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2166 transitions. [2022-01-10 20:00:14,179 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2166 transitions. Word has length 103 [2022-01-10 20:00:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:14,179 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2166 transitions. [2022-01-10 20:00:14,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 20:00:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2166 transitions. [2022-01-10 20:00:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 20:00:14,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:14,181 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:00:14,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:00:14,181 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1793609689, now seen corresponding path program 1 times [2022-01-10 20:00:14,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:14,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084835004] [2022-01-10 20:00:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:14,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 20:00:14,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:14,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084835004] [2022-01-10 20:00:14,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084835004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:14,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:14,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:14,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762623764] [2022-01-10 20:00:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:14,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:14,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:14,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:14,207 INFO L87 Difference]: Start difference. First operand 1838 states and 2166 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 20:00:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:14,306 INFO L93 Difference]: Finished difference Result 3648 states and 4302 transitions. [2022-01-10 20:00:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:14,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 104 [2022-01-10 20:00:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:14,309 INFO L225 Difference]: With dead ends: 3648 [2022-01-10 20:00:14,309 INFO L226 Difference]: Without dead ends: 1840 [2022-01-10 20:00:14,311 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 20:00:14,311 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 112 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:14,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 445 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-01-10 20:00:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1838. [2022-01-10 20:00:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.166031573217202) internal successors, (2142), 1837 states have internal predecessors, (2142), 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 20:00:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2142 transitions. [2022-01-10 20:00:14,413 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2142 transitions. Word has length 104 [2022-01-10 20:00:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:14,413 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2142 transitions. [2022-01-10 20:00:14,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 20:00:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2142 transitions. [2022-01-10 20:00:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 20:00:14,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:14,414 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 20:00:14,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:00:14,414 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:14,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 308078095, now seen corresponding path program 1 times [2022-01-10 20:00:14,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:14,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597474328] [2022-01-10 20:00:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:14,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:00:14,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:14,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597474328] [2022-01-10 20:00:14,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597474328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:14,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:14,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:00:14,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138349267] [2022-01-10 20:00:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:14,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:00:14,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:14,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:00:14,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:00:14,446 INFO L87 Difference]: Start difference. First operand 1838 states and 2142 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 20:00:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:14,523 INFO L93 Difference]: Finished difference Result 3109 states and 3631 transitions. [2022-01-10 20:00:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:00:14,524 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 104 [2022-01-10 20:00:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:14,525 INFO L225 Difference]: With dead ends: 3109 [2022-01-10 20:00:14,525 INFO L226 Difference]: Without dead ends: 1301 [2022-01-10 20:00:14,527 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 20:00:14,528 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 108 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:14,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 413 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2022-01-10 20:00:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1293. [2022-01-10 20:00:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.1393188854489165) internal successors, (1472), 1292 states have internal predecessors, (1472), 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 20:00:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1472 transitions. [2022-01-10 20:00:14,589 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1472 transitions. Word has length 104 [2022-01-10 20:00:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:14,589 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1472 transitions. [2022-01-10 20:00:14,589 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 20:00:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1472 transitions. [2022-01-10 20:00:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 20:00:14,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:14,590 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 20:00:14,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:00:14,590 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 779824567, now seen corresponding path program 1 times [2022-01-10 20:00:14,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:14,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931980977] [2022-01-10 20:00:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:14,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 20:00:14,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:14,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931980977] [2022-01-10 20:00:14,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931980977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:14,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:14,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:00:14,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127996559] [2022-01-10 20:00:14,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:14,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:00:14,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:00:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:00:14,631 INFO L87 Difference]: Start difference. First operand 1293 states and 1472 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 20:00:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:14,732 INFO L93 Difference]: Finished difference Result 2349 states and 2671 transitions. [2022-01-10 20:00:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:00:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 105 [2022-01-10 20:00:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:14,733 INFO L225 Difference]: With dead ends: 2349 [2022-01-10 20:00:14,733 INFO L226 Difference]: Without dead ends: 683 [2022-01-10 20:00:14,735 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 20:00:14,735 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 379 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:14,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 444 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-01-10 20:00:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 617. [2022-01-10 20:00:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.0974025974025974) internal successors, (676), 616 states have internal predecessors, (676), 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 20:00:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 676 transitions. [2022-01-10 20:00:14,769 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 676 transitions. Word has length 105 [2022-01-10 20:00:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:14,769 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 676 transitions. [2022-01-10 20:00:14,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 20:00:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 676 transitions. [2022-01-10 20:00:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 20:00:14,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:00:14,771 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 20:00:14,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 20:00:14,772 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:00:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:00:14,772 INFO L85 PathProgramCache]: Analyzing trace with hash 566131189, now seen corresponding path program 1 times [2022-01-10 20:00:14,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:00:14,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174505369] [2022-01-10 20:00:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:00:14,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:00:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:00:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 20:00:14,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:00:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174505369] [2022-01-10 20:00:14,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174505369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:00:14,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:00:14,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:00:14,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524526991] [2022-01-10 20:00:14,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:00:14,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:00:14,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:00:14,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:00:14,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:00:14,880 INFO L87 Difference]: Start difference. First operand 617 states and 676 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 20:00:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:00:14,954 INFO L93 Difference]: Finished difference Result 621 states and 680 transitions. [2022-01-10 20:00:14,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:00:14,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 105 [2022-01-10 20:00:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:00:14,955 INFO L225 Difference]: With dead ends: 621 [2022-01-10 20:00:14,955 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 20:00:14,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:00:14,956 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 200 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:00:14,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 491 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:00:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 20:00:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 20:00:14,957 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 20:00:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 20:00:14,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-01-10 20:00:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:00:14,957 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 20:00:14,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 20:00:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 20:00:14,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 20:00:14,959 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-10 20:00:14,959 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-10 20:00:14,959 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-10 20:00:14,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 20:00:14,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 20:00:41,143 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 20:00:41,144 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 20:00:41,144 INFO L858 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2022-01-10 20:00:41,144 INFO L854 garLoopResultBuilder]: At program point L364(lines 350 366) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (< ~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) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~q_free~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,144 INFO L854 garLoopResultBuilder]: At program point L761(lines 754 763) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,144 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2022-01-10 20:00:41,144 INFO L854 garLoopResultBuilder]: At program point L533(lines 528 535) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,144 INFO L858 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2022-01-10 20:00:41,144 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2022-01-10 20:00:41,144 INFO L854 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse2 (not (= ~t1_pc~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 (<= 2 ~E_1~0Int)) (.cse8 (<= 2 ~E_M~0Int)) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse10 (= 2 ~M_E~0Int)) (.cse11 (= ~q_free~0Int 1)) (.cse12 (= ~m_pc~0Int 0)) (.cse13 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse14 (<= 2 ~T1_E~0Int)) (.cse15 (= 0 ~t1_st~0Int)) (.cse16 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~p_dw_st~0Int) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (<= 2 ~c_dr_st~0Int) .cse14) (and .cse0 .cse1 (= 0 ~p_dw_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-01-10 20:00:41,144 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2022-01-10 20:00:41,144 INFO L854 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,144 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,144 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L629(lines 629 633) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L861 garLoopResultBuilder]: At program point L376(lines 367 378) the Hoare annotation is: true [2022-01-10 20:00:41,145 INFO L854 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 628 651) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L854 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L256(line 256) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L232-1(lines 232 242) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 20:00:41,145 INFO L854 garLoopResultBuilder]: At program point L244-1(lines 231 246) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,145 INFO L858 garLoopResultBuilder]: For program point L236-1(lines 236 241) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L854 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,146 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L854 garLoopResultBuilder]: At program point L644-1(lines 625 652) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,146 INFO L854 garLoopResultBuilder]: At program point L245-1(lines 228 247) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,146 INFO L854 garLoopResultBuilder]: At program point L245(lines 228 247) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,146 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L858 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L854 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,146 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-01-10 20:00:41,146 INFO L854 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (= ~c_num_read~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,146 INFO L854 garLoopResultBuilder]: At program point L318(lines 302 320) the Hoare annotation is: (let ((.cse26 (+ ~p_num_write~0Int 1))) (let ((.cse2 (< ~c_num_read~0Int .cse26)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse23 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse24 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse22 (= ~q_free~0Int 0)) (.cse20 (<= 2 ~p_dw_st~0Int)) (.cse14 (= 0 ~c_dr_pc~0Int)) (.cse15 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse16 (= ~c_dr_st~0Int 0)) (.cse17 (= ~c_num_read~0Int 0)) (.cse18 (= ~p_num_write~0Int 0)) (.cse19 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and .cse14 .cse15 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse19 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse22 .cse1 .cse3 .cse4 .cse23 .cse6 .cse24 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse23 .cse24 .cse7 .cse9 .cse10 .cse11) (let ((.cse25 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse22 .cse1 .cse16 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 (< .cse25 .cse26) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse25))) (and .cse14 .cse15 .cse0 .cse1 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L854 garLoopResultBuilder]: At program point L506(lines 490 508) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (= ~c_num_read~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0Int 0)) (.cse0 (= ~q_free~0Int 0)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse9 (+ ~p_num_write~0Int 1)) (.cse5 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse11 (= 0 ~t1_st~0Int)) (.cse12 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse14 (= ~p_dw_pc~0Int 0)) (.cse15 (= ~q_free~0Int 1)) (.cse13 (= 0 ~c_dr_pc~0Int)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse16 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse6 (= 2 ~M_E~0Int)) (.cse7 (= ~m_pc~0Int 0)) (.cse18 (<= 2 ~c_dr_st~0Int)) (.cse10 (<= 2 ~T1_E~0Int))) (or (let ((.cse8 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< .cse8 .cse9) .cse10 .cse11 .cse12 (<= ~p_num_write~0Int .cse8))) (and .cse13 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) .cse1 .cse2 (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 (<= ~p_last_write~0Int ~c_last_read~0Int) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse16 .cse5 .cse17 .cse6 .cse7 .cse18 .cse10 .cse11 .cse12) (and .cse1 (< ~c_num_read~0Int .cse9) .cse3 .cse4 (<= ~p_num_write~0Int ~c_num_read~0Int) .cse5 .cse6 .cse15 .cse7 .cse18 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse3 .cse4 .cse6 .cse15 .cse7 .cse18 .cse10) (and .cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse3 .cse4 .cse16 .cse17 .cse6 .cse7 .cse18 .cse10))) [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L854 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (let ((.cse4 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse10 (<= 2 ~c_dr_st~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse5 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (<= 2 ~p_dw_st~0Int)) (.cse8 (= 2 ~M_E~0Int)) (.cse9 (= ~m_pc~0Int 0)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_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) (and (= 0 ~c_dr_pc~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11) (let ((.cse14 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 (= ~c_dr_st~0Int 0) .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 (< .cse14 (+ ~p_num_write~0Int 1)) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse14))))) [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-01-10 20:00:41,147 INFO L854 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (let ((.cse6 (<= 2 ~c_dr_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse8 (not (= ~t1_pc~0Int 1))) (.cse1 (= ~p_dw_pc~0Int 0)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse9 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (= ~m_pc~0Int 0)) (.cse7 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1)) .cse2 .cse3 (<= ~p_num_write~0Int ~c_num_read~0Int) .cse9 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse2 .cse3 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse7 .cse10 .cse11))) [2022-01-10 20:00:41,147 INFO L854 garLoopResultBuilder]: At program point L190-1(lines 156 208) the Hoare annotation is: (let ((.cse16 (+ ~p_num_write~0Int 1))) (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse2 (< ~c_num_read~0Int .cse16)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (<= 2 ~p_dw_st~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse10 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_st~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse15 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) .cse1 .cse3 .cse4 .cse6 .cse14 .cse7 .cse9 (< .cse15 .cse16) .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse15))) (and .cse0 .cse1 (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-01-10 20:00:41,147 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L854 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse5 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse6 (= 2 ~M_E~0Int)) (.cse7 (= ~q_free~0Int 1)) (.cse8 (= ~m_pc~0Int 0)) (.cse9 (<= 2 ~c_dr_st~0Int)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (= 0 ~t1_st~0Int)) (.cse12 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and (= 0 ~p_dw_st~0Int) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~p_dw_st~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 208) the Hoare annotation is: (let ((.cse0 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and (= ~q_free~0Int 0) (not (= ~t1_pc~0Int 1)) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= 2 ~p_dw_st~0Int) (= 2 ~M_E~0Int) (= ~m_pc~0Int 0) (< .cse0 (+ ~p_num_write~0Int 1)) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int) (<= ~p_num_write~0Int .cse0))) [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L854 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1)) (= ~c_num_read~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,148 INFO L854 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0Int)) (.cse12 (= 0 ~c_dr_pc~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse14 (= ~p_dw_pc~0Int 0)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (= 2 ~M_E~0Int)) (.cse6 (= ~m_pc~0Int 0)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse7 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse7 (+ ~p_num_write~0Int 1)) .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0Int .cse7))) (and .cse12 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse2 .cse3 .cse5 .cse6 .cse8 .cse9) (and .cse12 .cse13 .cse14 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9) (and .cse12 .cse0 .cse1 .cse13 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~p_num_write~0Int 1) .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11))) [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L50-3(lines 50 59) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L854 garLoopResultBuilder]: At program point L525(lines 509 527) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1)) (= ~c_num_read~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,148 INFO L854 garLoopResultBuilder]: At program point L62(lines 46 64) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_#res#1Int| 0)) (.cse5 (= ~p_dw_pc~0Int 0)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (not (= ~t1_pc~0Int 1))) (.cse8 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse12 (= 0 ~t1_st~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse6 (<= 2 ~E_1~0Int)) (.cse7 (<= 2 ~E_M~0Int)) (.cse9 (= 2 ~M_E~0Int)) (.cse10 (= ~m_pc~0Int 0)) (.cse14 (<= 2 ~c_dr_st~0Int)) (.cse11 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) .cse4 (= ~p_num_write~0Int 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11) (let ((.cse15 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse15 (+ ~p_num_write~0Int 1)) .cse14 .cse11 .cse12 .cse13 (<= ~p_num_write~0Int .cse15))) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse6 .cse7 .cse9 .cse10 .cse14 .cse11))) [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L51-1(lines 51 56) no Hoare annotation was computed. [2022-01-10 20:00:41,148 INFO L858 garLoopResultBuilder]: For program point L50-5(lines 50 59) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L854 garLoopResultBuilder]: At program point L61-1(lines 49 63) the Hoare annotation is: (and (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (not (= ~t1_pc~0Int 1)) (< ~c_num_read~0Int (+ ~p_num_write~0Int 1)) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~p_num_write~0Int ~c_num_read~0Int) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= 2 ~p_dw_st~0Int) (= 2 ~M_E~0Int) (= ~q_free~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,149 INFO L854 garLoopResultBuilder]: At program point L697-2(lines 681 705) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1)) (= ~c_num_read~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1)) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L854 garLoopResultBuilder]: At program point L62-1(lines 46 64) the Hoare annotation is: (and (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (not (= ~t1_pc~0Int 1)) (< ~c_num_read~0Int (+ ~p_num_write~0Int 1)) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~p_num_write~0Int ~c_num_read~0Int) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= 2 ~p_dw_st~0Int) (= 2 ~M_E~0Int) (= ~q_free~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L657(lines 657 661) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L92-3(lines 92 96) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L657-2(lines 656 679) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L92-5(lines 92 96) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L854 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0Int)) (.cse12 (= 0 ~c_dr_pc~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (= 2 ~M_E~0Int)) (.cse6 (= ~m_pc~0Int 0)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse7 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse7 (+ ~p_num_write~0Int 1)) .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0Int .cse7))) (and .cse12 .cse13 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) (= ~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) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) (= ~p_dw_pc~0Int 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11))) [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L69-3(lines 69 78) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2022-01-10 20:00:41,149 INFO L854 garLoopResultBuilder]: At program point L81(lines 65 83) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0Int)) (.cse12 (= 0 ~c_dr_pc~0Int)) (.cse0 (= ~q_free~0Int 0)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse5 (= 2 ~M_E~0Int)) (.cse6 (= ~m_pc~0Int 0)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int)) (.cse11 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse7 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse7 (+ ~p_num_write~0Int 1)) .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0Int .cse7))) (and .cse12 .cse13 .cse14 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9) (and .cse0 .cse13 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1Int| 0) .cse14 (= ~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) (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) (= ~p_dw_pc~0Int 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11))) [2022-01-10 20:00:41,149 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 70 75) no Hoare annotation was computed. [2022-01-10 20:00:41,150 INFO L858 garLoopResultBuilder]: For program point L69-5(lines 69 78) no Hoare annotation was computed. [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L672-1(lines 653 680) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (= ~c_dr_st~0Int 0) (= (+ (- 1) ~m_i~0Int) 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1)) (= ~c_num_read~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) (= ~p_num_write~0Int 0) (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1)) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (= ~m_pc~0Int 0) (<= ~p_last_write~0Int ~c_last_read~0Int) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,150 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L80-1(lines 68 82) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse2 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse10 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_st~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0Int) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L798-2(lines 798 835) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L100-2(lines 84 108) the Hoare annotation is: (let ((.cse0 (= ~q_free~0Int 0)) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse4 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse9 (= 0 ~t1_st~0Int)) (.cse10 (<= ~p_last_write~0Int ~q_buf_0~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse11 (< 0 (+ 1 |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int|))) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1Int| 0)) (.cse5 (= 2 ~M_E~0Int)) (.cse6 (= ~m_pc~0Int 0)) (.cse13 (<= 2 ~c_dr_st~0Int)) (.cse8 (<= 2 ~T1_E~0Int))) (or (let ((.cse7 (mod (+ ~c_num_read~0Int 1) 4294967296))) (and .cse0 .cse1 (= ~c_dr_st~0Int 0) .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse7 (+ ~p_num_write~0Int 1)) .cse8 .cse9 .cse10 (<= ~p_num_write~0Int .cse7))) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse12 .cse5 .cse6 .cse13 .cse8 .cse9 .cse10) (and (= 0 ~c_dr_pc~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_is_do_read_c_triggered_#res#1Int| 0) .cse2 .cse3 .cse11 .cse12 .cse5 .cse6 .cse13 .cse8))) [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L81-1(lines 65 83) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse2 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse10 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_st~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0Int) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= 0 ~p_dw_st~0Int) [2022-01-10 20:00:41,150 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-01-10 20:00:41,150 INFO L858 garLoopResultBuilder]: For program point L100-3(lines 100 104) no Hoare annotation was computed. [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L851(lines 842 853) the Hoare annotation is: (= 0 ~p_dw_st~0Int) [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse26 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse26)) (.cse23 (= 0 ~t1_st~0Int)) (.cse25 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse27 (<= 2 ~t1_st~0Int)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= 0 ~m_st~0Int)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse29 (+ ~local~0Int 2)) .cse21 .cse22 .cse24))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24)))) [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L100-5(lines 84 108) the Hoare annotation is: (let ((.cse0 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse1 (not (= ~t1_pc~0Int 1))) (.cse2 (< ~c_num_read~0Int (+ ~p_num_write~0Int 1))) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= ~p_num_write~0Int ~c_num_read~0Int)) (.cse6 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse7 (= 2 ~M_E~0Int)) (.cse8 (= ~q_free~0Int 1)) (.cse9 (= ~m_pc~0Int 0)) (.cse10 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_st~0Int)) (.cse13 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 (= 0 ~p_dw_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 0) .cse2 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_immediate_notify_threads_~tmp~0#1Int| 1)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~p_dw_st~0Int) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-01-10 20:00:41,150 INFO L854 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (let ((.cse26 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse26)) (.cse23 (= 0 ~t1_st~0Int)) (.cse25 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse27 (<= 2 ~t1_st~0Int)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= 0 ~m_st~0Int)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse29 (+ ~local~0Int 2)) .cse21 .cse22 .cse24))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24)))) [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L854 garLoopResultBuilder]: At program point L533-1(lines 528 535) the Hoare annotation is: (let ((.cse26 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse26)) (.cse23 (= 0 ~t1_st~0Int)) (.cse25 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse27 (<= 2 ~t1_st~0Int)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= 0 ~m_st~0Int)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse29 (+ ~local~0Int 2)) .cse21 .cse22 .cse24))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24)))) [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L629-3(lines 629 633) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L854 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: (let ((.cse26 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse26)) (.cse23 (= 0 ~t1_st~0Int)) (.cse25 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse27 (<= 2 ~t1_st~0Int)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= 0 ~m_st~0Int)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse29 (+ ~local~0Int 2)) .cse21 .cse22 .cse24))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24)))) [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L854 garLoopResultBuilder]: At program point L28-1(lines 23 30) the Hoare annotation is: false [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point L629-5(lines 628 651) no Hoare annotation was computed. [2022-01-10 20:00:41,151 INFO L854 garLoopResultBuilder]: At program point L571(lines 554 573) the Hoare annotation is: (let ((.cse26 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse26)) (.cse23 (= 0 ~t1_st~0Int)) (.cse25 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse27 (<= 2 ~t1_st~0Int)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= 0 ~m_st~0Int)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse29 (+ ~local~0Int 2)) .cse21 .cse22 .cse24))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24)))) [2022-01-10 20:00:41,151 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L854 garLoopResultBuilder]: At program point L28(lines 23 30) the Hoare annotation is: false [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L634-3(lines 628 651) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L639-3(lines 628 651) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L854 garLoopResultBuilder]: At program point L644-3(lines 625 652) the Hoare annotation is: (let ((.cse26 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse26)) (.cse23 (= 0 ~t1_st~0Int)) (.cse25 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse27 (<= 2 ~t1_st~0Int)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= 0 ~m_st~0Int)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse24) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse29 (+ ~local~0Int 2)) .cse21 .cse22 .cse24))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24)))) [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L494-9(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L495-3(lines 495 500) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L494-11(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L854 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse4 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse5 (= 0 ~p_dw_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse7 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse11 (= ~t1_pc~0Int 1)) (.cse12 (= ~p_num_write~0Int 0)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse17 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse19 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse20 (= ~t1_i~0Int 1)) (.cse24 (= ~m_pc~0Int 0)) (.cse21 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse23 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse1 (+ ~local~0Int 1))) (let ((.cse2 (+ ~token~0Int (* (div .cse1 4294967296) 4294967296)))) (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< .cse2 (+ ~local~0Int 2)) .cse21 .cse22 .cse23))) (and .cse0 .cse3 .cse4 .cse5 (not .cse11) .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse21 .cse22 (= 0 ~t1_st~0Int) .cse23) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~local~0Int ~token~0Int) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse21 .cse22 .cse23))) [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2022-01-10 20:00:41,152 INFO L854 garLoopResultBuilder]: At program point L505-3(lines 493 507) the Hoare annotation is: (let ((.cse27 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse27)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse12 (= 0 ~m_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse19 (= ~m_pc~0Int 0)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse22 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse28 (= 2 ~m_st~0Int)) (.cse6 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse26 (<= 2 ~t1_st~0Int)) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse11 (= ~p_num_write~0Int 0)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse17 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (= ~t1_i~0Int 1)) (.cse20 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse21 (<= 2 ~T1_E~0Int)) (.cse23 (<= ~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 .cse22 .cse23) (let ((.cse24 (+ ~local~0Int 1))) (let ((.cse25 (+ ~token~0Int (* (div .cse24 4294967296) 4294967296)))) (and .cse0 (<= .cse24 .cse25) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse26 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse25 (+ ~local~0Int 2)) .cse20 .cse21 .cse23))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse6 .cse8 .cse9 .cse26 .cse27 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse20 .cse21 .cse23)))) [2022-01-10 20:00:41,152 INFO L854 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse9 (= ~t1_pc~0Int 1)) (.cse4 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse8 (= ~c_num_read~0Int 0)) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse11 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse24 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse17 (= ~t1_i~0Int 1)) (.cse18 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse20 (<= 2 ~T1_E~0Int)) (.cse21 (= 0 ~t1_st~0Int)) (.cse22 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~local~0Int ~token~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~t1_st~0Int) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse24 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 (not .cse9) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse16 .cse23 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L854 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (= 0 ~c_dr_pc~0Int) (<= .cse0 .cse1) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (= ~m_i~0Int 1) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (<= 2 ~t1_st~0Int) (= ~t1_pc~0Int 1) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) (<= ~q_buf_0~0Int ~p_last_write~0Int) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1)) (= ~t1_i~0Int 1) (< .cse1 (+ ~local~0Int 2)) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)))) [2022-01-10 20:00:41,153 INFO L854 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse11 (= 0 ~m_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse4 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse5 (= 0 ~p_dw_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse7 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse18 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse21 (<= 2 ~T1_E~0Int)) (.cse22 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse1 (+ ~local~0Int 1))) (let ((.cse2 (+ ~token~0Int (* (div .cse1 4294967296) 4294967296)))) (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~t1_pc~0Int 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse2 (+ ~local~0Int 2)) .cse20 .cse21 .cse22))) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~local~0Int ~token~0Int) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~m_pc~0Int 0) .cse20 .cse21 .cse22) (and .cse0 .cse3 .cse4 .cse5 .cse6 (= 2 ~m_st~0Int) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L854 garLoopResultBuilder]: At program point L506-3(lines 490 508) the Hoare annotation is: (let ((.cse24 (= ~t1_pc~0Int 1))) (let ((.cse6 (= 2 ~m_st~0Int)) (.cse25 (<= 2 ~t1_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (not .cse24)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse7 (= ~m_i~0Int 1)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse11 (= ~p_num_write~0Int 0)) (.cse26 (= 0 ~m_st~0Int)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse16 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse17 (= ~t1_i~0Int 1)) (.cse27 (= ~m_pc~0Int 0)) (.cse18 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse20 (<= 2 ~T1_E~0Int)) (.cse21 (= 0 ~t1_st~0Int)) (.cse22 (<= ~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 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse23 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse23 .cse8 .cse9 .cse25 .cse24 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse25 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse25 .cse24 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< .cse29 (+ ~local~0Int 2)) .cse18 .cse19 .cse20 .cse22))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L494-3(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L854 garLoopResultBuilder]: At program point L483(lines 454 489) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse5 (= ~m_i~0Int 1)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse8 (<= 2 ~t1_st~0Int)) (.cse9 (= ~t1_pc~0Int 1)) (.cse10 (= ~p_num_write~0Int 0)) (.cse24 (= 0 ~m_st~0Int)) (.cse11 (= ~p_dw_pc~0Int 0)) (.cse12 (<= 2 ~E_1~0Int)) (.cse13 (<= 2 ~E_M~0Int)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse15 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse17 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse18 (= ~t1_i~0Int 1)) (.cse19 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse20 (<= 2 ~T1_E~0Int)) (.cse21 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~m_st~0Int) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse22 (+ ~local~0Int 1))) (let ((.cse23 (+ ~token~0Int (* (div .cse22 4294967296) 4294967296)))) (and .cse0 (<= .cse22 .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse23 (+ ~local~0Int 2)) .cse19 .cse20 .cse21))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~local~0Int ~token~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~m_pc~0Int 0) .cse19 .cse20 .cse21))) [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L854 garLoopResultBuilder]: At program point L462(lines 457 488) the Hoare annotation is: (and (= 0 ~c_dr_pc~0Int) (= ~q_free~0Int 0) (< ~c_last_read~0Int (+ ~p_last_write~0Int 1)) (= 0 ~p_dw_st~0Int) (= 2 ~m_st~0Int) (= ~m_i~0Int 1) (= ~local~0Int ~token~0Int) (= ~c_dr_st~0Int 0) (= ~c_num_read~0Int 0) (= ~t1_pc~0Int 1) (= ~p_num_write~0Int 0) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~q_buf_0~0Int ~p_last_write~0Int) (= ~t1_i~0Int 1) (<= ~p_last_write~0Int ~c_last_read~0Int) (<= 2 ~T1_E~0Int) (<= ~p_last_write~0Int ~q_buf_0~0Int)) [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L689-9(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L495-1(lines 495 500) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L494-5(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L854 garLoopResultBuilder]: At program point L391(lines 386 393) the Hoare annotation is: false [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L494-6(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,153 INFO L858 garLoopResultBuilder]: For program point L689-11(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L854 garLoopResultBuilder]: At program point L505-1(lines 493 507) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse8 (= ~t1_pc~0Int 1)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse5 (= ~m_i~0Int 1)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= ~p_dw_pc~0Int 0)) (.cse12 (<= 2 ~E_M~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse14 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse15 (= ~t1_i~0Int 1)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (<= 2 ~T1_E~0Int)) (.cse18 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~local~0Int ~token~0Int) .cse6 .cse7 (<= 2 ~t1_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (not .cse8) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= 0 ~t1_st~0Int) .cse18))) [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L495-2(lines 495 500) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L494-8(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L513-9(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L854 garLoopResultBuilder]: At program point L506-1(lines 490 508) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse8 (= ~t1_pc~0Int 1)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse5 (= ~m_i~0Int 1)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= ~p_dw_pc~0Int 0)) (.cse12 (<= 2 ~E_M~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse14 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse15 (= ~t1_i~0Int 1)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse18 (<= 2 ~T1_E~0Int)) (.cse19 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~local~0Int ~token~0Int) .cse6 .cse7 (<= 2 ~t1_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 (not .cse8) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 0 ~t1_st~0Int) .cse19))) [2022-01-10 20:00:41,154 INFO L854 garLoopResultBuilder]: At program point L505-2(lines 493 507) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse4 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse5 (= 0 ~p_dw_st~0Int)) (.cse6 (= 2 ~m_st~0Int)) (.cse7 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= ~t1_pc~0Int 1)) (.cse11 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse15 (= ~t1_i~0Int 1)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (<= 2 ~T1_E~0Int)) (.cse18 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse1 (+ ~local~0Int 1))) (let ((.cse2 (+ ~token~0Int (* (div .cse1 4294967296) 4294967296)))) (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< .cse2 (+ ~local~0Int 2)) .cse16 .cse17 .cse18))) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L514-3(lines 514 519) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L513-11(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L689-3(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L854 garLoopResultBuilder]: At program point L506-2(lines 490 508) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse4 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse5 (= 0 ~p_dw_st~0Int)) (.cse6 (= 2 ~m_st~0Int)) (.cse7 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= ~t1_pc~0Int 1)) (.cse11 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse15 (= ~t1_i~0Int 1)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (<= 2 ~T1_E~0Int)) (.cse18 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse1 (+ ~local~0Int 1))) (let ((.cse2 (+ ~token~0Int (* (div .cse1 4294967296) 4294967296)))) (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< .cse2 (+ ~local~0Int 2)) .cse16 .cse17 .cse18))) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse17 .cse18))) [2022-01-10 20:00:41,154 INFO L854 garLoopResultBuilder]: At program point L524-3(lines 512 526) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0Int 1))) (let ((.cse5 (= 2 ~m_st~0Int)) (.cse26 (not .cse25)) (.cse22 (= 0 ~t1_st~0Int)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse28 (= ~m_pc~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse10 (= ~c_num_read~0Int 0)) (.cse24 (<= 2 ~t1_st~0Int)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse12 (= ~p_num_write~0Int 0)) (.cse27 (= 0 ~m_st~0Int)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse17 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (= ~t1_i~0Int 1)) (.cse19 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse21 (<= 2 ~T1_E~0Int)) (.cse23 (<= ~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 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse23) (let ((.cse29 (+ ~local~0Int 1))) (let ((.cse30 (+ ~token~0Int (* (div .cse29 4294967296) 4294967296)))) (and .cse0 (<= .cse29 .cse30) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse30 (+ ~local~0Int 2)) .cse19 .cse20 .cse21 .cse23)))))) [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L689-5(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L689-6(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L854 garLoopResultBuilder]: At program point L525-3(lines 509 527) the Hoare annotation is: (let ((.cse27 (= ~t1_pc~0Int 1))) (let ((.cse5 (= 2 ~m_st~0Int)) (.cse25 (not .cse27)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse29 (= ~m_pc~0Int 0)) (.cse23 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse10 (= ~c_num_read~0Int 0)) (.cse26 (<= 2 ~t1_st~0Int)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse12 (= ~p_num_write~0Int 0)) (.cse28 (= 0 ~m_st~0Int)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse18 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse21 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse27 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse30 (+ ~local~0Int 1))) (let ((.cse31 (+ ~token~0Int (* (div .cse30 4294967296) 4294967296)))) (and .cse0 (<= .cse30 .cse31) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse26 .cse27 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse31 (+ ~local~0Int 2)) .cse20 .cse21 .cse22 .cse24)))))) [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L513-3(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L689-8(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,154 INFO L858 garLoopResultBuilder]: For program point L697-9(lines 697 701) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L514-1(lines 514 519) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L513-5(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L513-6(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L854 garLoopResultBuilder]: At program point L697-11(lines 681 705) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,155 INFO L854 garLoopResultBuilder]: At program point L524-1(lines 512 526) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse21 (<= 2 ~t1_st~0Int)) (.cse4 (= ~t1_pc~0Int 1)) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse11 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_M~0Int)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse15 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (= ~t1_i~0Int 1)) (.cse17 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse19 (<= 2 ~T1_E~0Int)) (.cse20 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ~t1_st~0Int) .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse6 (= ~local~0Int ~token~0Int) .cse7 .cse8 .cse9 .cse21 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse4 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L513-8(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L657-3(lines 657 661) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L854 garLoopResultBuilder]: At program point L525-1(lines 509 527) the Hoare annotation is: (let ((.cse9 (<= 2 ~t1_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse10 (= ~t1_pc~0Int 1)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse5 (= ~m_i~0Int 1)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse8 (= ~c_num_read~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse12 (= ~p_num_write~0Int 0)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_M~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse17 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (= ~t1_i~0Int 1)) (.cse19 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse21 (<= 2 ~T1_E~0Int)) (.cse22 (<= ~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 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ~local~0Int ~token~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 (not .cse10) .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= 0 ~t1_st~0Int) .cse22))) [2022-01-10 20:00:41,155 INFO L854 garLoopResultBuilder]: At program point L524-2(lines 512 526) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse4 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse5 (= 0 ~p_dw_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse7 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= ~t1_pc~0Int 1)) (.cse11 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse15 (= ~t1_i~0Int 1)) (.cse16 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse17 (<= 2 ~T1_E~0Int)) (.cse18 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse1 (+ ~local~0Int 1))) (let ((.cse2 (+ ~token~0Int (* (div .cse1 4294967296) 4294967296)))) (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~m_st~0Int) .cse12 .cse13 .cse14 .cse15 (< .cse2 (+ ~local~0Int 2)) .cse16 .cse17 .cse18))) (and .cse0 .cse3 .cse4 .cse5 .cse6 (= 2 ~m_st~0Int) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L657-5(lines 656 679) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L697-3(lines 697 701) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L854 garLoopResultBuilder]: At program point L525-2(lines 509 527) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse5 (= ~m_i~0Int 1)) (.cse6 (= ~c_dr_st~0Int 0)) (.cse7 (= ~c_num_read~0Int 0)) (.cse8 (= ~t1_pc~0Int 1)) (.cse9 (= ~p_num_write~0Int 0)) (.cse10 (= ~p_dw_pc~0Int 0)) (.cse11 (<= 2 ~E_1~0Int)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse13 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse14 (= ~t1_i~0Int 1)) (.cse15 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse16 (<= 2 ~T1_E~0Int)) (.cse17 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~m_st~0Int) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ ~local~0Int 1))) (let ((.cse19 (+ ~token~0Int (* (div .cse18 4294967296) 4294967296)))) (and .cse0 (<= .cse18 .cse19) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~m_st~0Int) .cse10 .cse11 .cse12 .cse13 .cse14 (< .cse19 (+ ~local~0Int 2)) .cse15 .cse16 .cse17))))) [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L662-3(lines 656 679) no Hoare annotation was computed. [2022-01-10 20:00:41,155 INFO L854 garLoopResultBuilder]: At program point L697-5(lines 681 705) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse8 (= ~t1_pc~0Int 1)) (.cse4 (= ~m_i~0Int 1)) (.cse5 (= ~c_dr_st~0Int 0)) (.cse6 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse7 (= ~c_num_read~0Int 0)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= ~p_dw_pc~0Int 0)) (.cse12 (<= 2 ~E_M~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse14 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse17 (= ~t1_i~0Int 1)) (.cse18 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse20 (<= 2 ~T1_E~0Int)) (.cse22 (= 0 ~t1_st~0Int)) (.cse21 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t1_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~local~0Int ~token~0Int) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21) (and .cse0 .cse1 .cse2 .cse3 (not .cse8) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21))) [2022-01-10 20:00:41,155 INFO L858 garLoopResultBuilder]: For program point L697-6(lines 697 701) no Hoare annotation was computed. [2022-01-10 20:00:41,156 INFO L858 garLoopResultBuilder]: For program point L667-3(lines 656 679) no Hoare annotation was computed. [2022-01-10 20:00:41,156 INFO L854 garLoopResultBuilder]: At program point L714(lines 706 716) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse8 (= ~t1_pc~0Int 1)) (.cse4 (= ~m_i~0Int 1)) (.cse5 (= ~c_dr_st~0Int 0)) (.cse6 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse7 (= ~c_num_read~0Int 0)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse10 (= ~p_num_write~0Int 0)) (.cse11 (= ~p_dw_pc~0Int 0)) (.cse12 (<= 2 ~E_M~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse14 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse17 (= ~t1_i~0Int 1)) (.cse18 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse20 (<= 2 ~T1_E~0Int)) (.cse22 (= 0 ~t1_st~0Int)) (.cse21 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t1_st~0Int) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~local~0Int ~token~0Int) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21) (and .cse0 .cse1 .cse2 .cse3 (not .cse8) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21))) [2022-01-10 20:00:41,156 INFO L854 garLoopResultBuilder]: At program point L697-8(lines 681 705) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse4 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse5 (= 0 ~p_dw_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse7 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= ~t1_pc~0Int 1)) (.cse11 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse15 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse17 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse18 (= ~t1_i~0Int 1)) (.cse19 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse20 (<= 2 ~T1_E~0Int)) (.cse21 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse1 (+ ~local~0Int 1))) (let ((.cse2 (+ ~token~0Int (* (div .cse1 4294967296) 4294967296)))) (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~m_st~0Int) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse2 (+ ~local~0Int 2)) .cse19 .cse20 .cse21))) (and .cse0 .cse3 .cse4 .cse5 .cse6 (= 2 ~m_st~0Int) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2022-01-10 20:00:41,156 INFO L854 garLoopResultBuilder]: At program point L672-3(lines 653 680) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,156 INFO L854 garLoopResultBuilder]: At program point L714-1(lines 706 716) the Hoare annotation is: (let ((.cse0 (= 0 ~c_dr_pc~0Int)) (.cse3 (= ~q_free~0Int 0)) (.cse4 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse5 (= 0 ~p_dw_st~0Int)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse7 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= ~t1_pc~0Int 1)) (.cse11 (= ~p_num_write~0Int 0)) (.cse12 (= ~p_dw_pc~0Int 0)) (.cse13 (<= 2 ~E_1~0Int)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse15 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse17 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse18 (= ~t1_i~0Int 1)) (.cse19 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse20 (<= 2 ~T1_E~0Int)) (.cse21 (<= ~p_last_write~0Int ~q_buf_0~0Int))) (or (let ((.cse1 (+ ~local~0Int 1))) (let ((.cse2 (+ ~token~0Int (* (div .cse1 4294967296) 4294967296)))) (and .cse0 (<= .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~m_st~0Int) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse2 (+ ~local~0Int 2)) .cse19 .cse20 .cse21))) (and .cse0 .cse3 .cse4 .cse5 .cse6 (= 2 ~m_st~0Int) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2022-01-10 20:00:41,156 INFO L858 garLoopResultBuilder]: For program point L558-1(lines 558 568) no Hoare annotation was computed. [2022-01-10 20:00:41,156 INFO L854 garLoopResultBuilder]: At program point L570-1(lines 557 572) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,156 INFO L858 garLoopResultBuilder]: For program point L562-1(lines 562 567) no Hoare annotation was computed. [2022-01-10 20:00:41,156 INFO L854 garLoopResultBuilder]: At program point L571-1(lines 554 573) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,156 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2022-01-10 20:00:41,156 INFO L854 garLoopResultBuilder]: At program point L723(lines 717 725) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,156 INFO L858 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2022-01-10 20:00:41,156 INFO L858 garLoopResultBuilder]: For program point L494-12(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,156 INFO L858 garLoopResultBuilder]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2022-01-10 20:00:41,157 INFO L858 garLoopResultBuilder]: For program point L495-4(lines 495 500) no Hoare annotation was computed. [2022-01-10 20:00:41,157 INFO L858 garLoopResultBuilder]: For program point L494-14(lines 494 503) no Hoare annotation was computed. [2022-01-10 20:00:41,157 INFO L854 garLoopResultBuilder]: At program point L570-2(lines 557 572) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,157 INFO L858 garLoopResultBuilder]: For program point L562-2(lines 562 567) no Hoare annotation was computed. [2022-01-10 20:00:41,157 INFO L854 garLoopResultBuilder]: At program point L505-4(lines 493 507) the Hoare annotation is: (let ((.cse27 (= ~t1_pc~0Int 1))) (let ((.cse4 (not .cse27)) (.cse26 (<= 2 ~t1_st~0Int)) (.cse12 (= 0 ~m_st~0Int)) (.cse19 (= ~m_pc~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse28 (= 2 ~m_st~0Int)) (.cse6 (= ~m_i~0Int 1)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (= ~c_num_read~0Int 0)) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse11 (= ~p_num_write~0Int 0)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse17 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (= ~t1_i~0Int 1)) (.cse20 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse21 (<= 2 ~T1_E~0Int)) (.cse22 (= 0 ~t1_st~0Int)) (.cse23 (<= ~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 .cse22 .cse23) (let ((.cse24 (+ ~local~0Int 1))) (let ((.cse25 (+ ~token~0Int (* (div .cse24 4294967296) 4294967296)))) (and .cse0 (<= .cse24 .cse25) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse26 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse25 (+ ~local~0Int 2)) .cse20 .cse21 .cse23))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse28 .cse6 .cse8 .cse9 .cse26 .cse27 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23)))) [2022-01-10 20:00:41,157 INFO L854 garLoopResultBuilder]: At program point L571-2(lines 554 573) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,157 INFO L854 garLoopResultBuilder]: At program point L506-4(lines 490 508) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0Int 1))) (let ((.cse9 (<= 2 ~t1_st~0Int)) (.cse23 (not .cse10)) (.cse26 (= 0 ~m_st~0Int)) (.cse27 (= ~m_pc~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse5 (= 2 ~m_st~0Int)) (.cse6 (= ~m_i~0Int 1)) (.cse25 (= ~local~0Int ~token~0Int)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (= ~c_num_read~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse12 (= ~p_num_write~0Int 0)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse17 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (= ~t1_i~0Int 1)) (.cse19 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse21 (<= 2 ~T1_E~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse22 (<= ~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 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse22) (let ((.cse28 (+ ~local~0Int 1))) (let ((.cse29 (+ ~token~0Int (* (div .cse28 4294967296) 4294967296)))) (and .cse0 (<= .cse28 .cse29) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse29 (+ ~local~0Int 2)) .cse19 .cse20 .cse21 .cse22))) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse6 .cse25 .cse7 .cse8 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse24 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse22)))) [2022-01-10 20:00:41,157 INFO L858 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2022-01-10 20:00:41,157 INFO L858 garLoopResultBuilder]: For program point L689-12(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,157 INFO L854 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,157 INFO L858 garLoopResultBuilder]: For program point L689-14(lines 689 693) no Hoare annotation was computed. [2022-01-10 20:00:41,157 INFO L854 garLoopResultBuilder]: At program point L780(lines 764 782) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L513-12(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L514-4(lines 514 519) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L513-14(lines 513 522) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L854 garLoopResultBuilder]: At program point L524-4(lines 512 526) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0Int 1))) (let ((.cse5 (= 2 ~m_st~0Int)) (.cse26 (not .cse25)) (.cse22 (= 0 ~t1_st~0Int)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse28 (= ~m_pc~0Int 0)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse10 (= ~c_num_read~0Int 0)) (.cse24 (<= 2 ~t1_st~0Int)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse12 (= ~p_num_write~0Int 0)) (.cse27 (= 0 ~m_st~0Int)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse17 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse18 (= ~t1_i~0Int 1)) (.cse19 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse21 (<= 2 ~T1_E~0Int)) (.cse23 (<= ~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 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse21 .cse23) (let ((.cse29 (+ ~local~0Int 1))) (let ((.cse30 (+ ~token~0Int (* (div .cse29 4294967296) 4294967296)))) (and .cse0 (<= .cse29 .cse30) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse24 .cse25 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< .cse30 (+ ~local~0Int 2)) .cse19 .cse20 .cse21 .cse23)))))) [2022-01-10 20:00:41,158 INFO L854 garLoopResultBuilder]: At program point L525-4(lines 509 527) the Hoare annotation is: (let ((.cse27 (= ~t1_pc~0Int 1))) (let ((.cse5 (= 2 ~m_st~0Int)) (.cse25 (not .cse27)) (.cse7 (= ~local~0Int ~token~0Int)) (.cse29 (= ~m_pc~0Int 0)) (.cse23 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (= ~m_i~0Int 1)) (.cse8 (= ~c_dr_st~0Int 0)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse10 (= ~c_num_read~0Int 0)) (.cse26 (<= 2 ~t1_st~0Int)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse12 (= ~p_num_write~0Int 0)) (.cse28 (= 0 ~m_st~0Int)) (.cse13 (= ~p_dw_pc~0Int 0)) (.cse14 (<= 2 ~E_1~0Int)) (.cse15 (<= 2 ~E_M~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse17 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse18 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse19 (= ~t1_i~0Int 1)) (.cse20 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse21 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse22 (<= 2 ~T1_E~0Int)) (.cse24 (<= ~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 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse27 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse26 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse30 (+ ~local~0Int 1))) (let ((.cse31 (+ ~token~0Int (* (div .cse30 4294967296) 4294967296)))) (and .cse0 (<= .cse30 .cse31) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse26 .cse27 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< .cse31 (+ ~local~0Int 2)) .cse20 .cse21 .cse22 .cse24)))))) [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L697-12(lines 697 701) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L854 garLoopResultBuilder]: At program point L697-14(lines 681 705) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2022-01-10 20:00:41,158 INFO L854 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse24 (= ~m_pc~0Int 0)) (.cse10 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse6 (= ~local~0Int ~token~0Int)) (.cse0 (= 0 ~c_dr_pc~0Int)) (.cse1 (= ~q_free~0Int 0)) (.cse2 (< ~c_last_read~0Int (+ ~p_last_write~0Int 1))) (.cse3 (= 0 ~p_dw_st~0Int)) (.cse29 (not .cse11)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse31 (= 2 ~m_st~0Int)) (.cse5 (= ~m_i~0Int 1)) (.cse7 (= ~c_dr_st~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 1))) (.cse9 (= ~c_num_read~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse13 (= ~p_num_write~0Int 0)) (.cse15 (= ~p_dw_pc~0Int 0)) (.cse16 (<= 2 ~E_1~0Int)) (.cse17 (<= 2 ~E_M~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~5#1Int| 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse20 (<= ~q_buf_0~0Int ~p_last_write~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 0)) (.cse22 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~2#1Int| 1))) (.cse23 (= ~t1_i~0Int 1)) (.cse25 (<= ~p_last_write~0Int ~c_last_read~0Int)) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse27 (<= 2 ~T1_E~0Int)) (.cse30 (= 0 ~t1_st~0Int)) (.cse28 (<= ~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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28) (let ((.cse32 (+ ~local~0Int 1))) (let ((.cse33 (+ ~token~0Int (* (div .cse32 4294967296) 4294967296)))) (and .cse0 (<= .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (< .cse33 (+ ~local~0Int 2)) .cse25 .cse26 .cse27 .cse28))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse31 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse30 .cse28)))) [2022-01-10 20:00:41,161 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-10 20:00:41,162 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:00:41,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:00:41 BasicIcfg [2022-01-10 20:00:41,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:00:41,342 INFO L158 Benchmark]: Toolchain (without parser) took 34802.30ms. Allocated memory was 219.2MB in the beginning and 893.4MB in the end (delta: 674.2MB). Free memory was 163.4MB in the beginning and 357.5MB in the end (delta: -194.1MB). Peak memory consumption was 520.5MB. Max. memory is 8.0GB. [2022-01-10 20:00:41,342 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 219.2MB. Free memory is still 180.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:00:41,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.62ms. Allocated memory was 219.2MB in the beginning and 319.8MB in the end (delta: 100.7MB). Free memory was 163.1MB in the beginning and 286.9MB in the end (delta: -123.8MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-01-10 20:00:41,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.72ms. Allocated memory is still 319.8MB. Free memory was 286.9MB in the beginning and 283.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 20:00:41,344 INFO L158 Benchmark]: Boogie Preprocessor took 35.17ms. Allocated memory is still 319.8MB. Free memory was 283.8MB in the beginning and 281.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 20:00:41,344 INFO L158 Benchmark]: RCFGBuilder took 651.47ms. Allocated memory is still 319.8MB. Free memory was 281.1MB in the beginning and 253.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-10 20:00:41,345 INFO L158 Benchmark]: IcfgTransformer took 110.57ms. Allocated memory is still 319.8MB. Free memory was 253.3MB in the beginning and 240.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 20:00:41,345 INFO L158 Benchmark]: TraceAbstraction took 33684.05ms. Allocated memory was 319.8MB in the beginning and 893.4MB in the end (delta: 573.6MB). Free memory was 239.7MB in the beginning and 357.5MB in the end (delta: -117.7MB). Peak memory consumption was 494.6MB. Max. memory is 8.0GB. [2022-01-10 20:00:41,351 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 219.2MB. Free memory is still 180.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.62ms. Allocated memory was 219.2MB in the beginning and 319.8MB in the end (delta: 100.7MB). Free memory was 163.1MB in the beginning and 286.9MB in the end (delta: -123.8MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.72ms. Allocated memory is still 319.8MB. Free memory was 286.9MB in the beginning and 283.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.17ms. Allocated memory is still 319.8MB. Free memory was 283.8MB in the beginning and 281.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 651.47ms. Allocated memory is still 319.8MB. Free memory was 281.1MB in the beginning and 253.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * IcfgTransformer took 110.57ms. Allocated memory is still 319.8MB. Free memory was 253.3MB in the beginning and 240.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 33684.05ms. Allocated memory was 319.8MB in the beginning and 893.4MB in the end (delta: 573.6MB). Free memory was 239.7MB in the beginning and 357.5MB in the end (delta: -117.7MB). Peak memory consumption was 494.6MB. 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: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 390]: 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, 232 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7071 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7071 mSDsluCounter, 15844 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7402 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 8442 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2643occurred in iteration=20, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 2095 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 687 NumberOfFragments, 23362 HoareAnnotationTreeSize, 88 FomulaSimplifications, 992 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 88 FomulaSimplificationsInter, 114571 FormulaSimplificationTreeSizeReductionInter, 25.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1876 ConstructedInterpolants, 0 QuantifiedInterpolants, 6059 SizeOfPredicates, 2 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 30 InterpolantComputations, 27 PerfectInterpolantSequences, 282/288 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 3 specifications checked. All of them hold - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && p_dw_pc == 0bv32) || (((((((((((((((~bvule32(2bv32, E_M) && p_num_write == 1bv32) && c_num_read == 0bv32) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(tmp, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && ~bvule32(q_buf_0, p_last_write)) || (((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32)) || (((((((((((((((((((~bvule32(2bv32, E_M) && p_num_write == 1bv32) && ~bvule32(tmp, 0bv32)) && c_num_read == 0bv32) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: p_dw_st == 0bv32 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0bv32 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(tmp, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_num_read == 0bv32 && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(tmp, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(tmp, 0bv32)) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) || (((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((~bvule32(2bv32, E_M) && p_num_write == 1bv32) && ~bvule32(tmp, 0bv32)) && ~bvule32(\result, 0bv32)) && c_num_read == 0bv32) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvule32(\result, 0bv32)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(p_num_write, c_num_read)) && ~bvult64(~zero_extendFrom32To33(c_num_read), ~bvadd16(~zero_extendFrom32To33(p_num_write), 1bv33))) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && q_free == 1bv32) && ~bvule32(2bv32, p_dw_st)) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(2bv32, p_dw_st)) && c_dr_st == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvult64(0bv33, ~bvadd16(1bv33, ~zero_extendFrom32To33(tmp___0)))) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && c_dr_pc == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || (((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && q_free == 1bv32) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvule32(\result, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && p_dw_pc == 0bv32) || ((((((((((((((((~bvule32(2bv32, E_M) && p_num_write == 1bv32) && c_num_read == 0bv32) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && ~bvule32(\result, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(__retres1, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((~bvule32(2bv32, E_M) && ~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])) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(2bv32, T1_E)) && 0bv32 == m_pc) && ~bvule32(q_buf_0, p_last_write))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(\result, 0bv32)) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && ~bvule32(2bv32, c_dr_st)) && ~bvule32(2bv32, T1_E)) && ~bvule32(__retres1, 0bv32)) && 0bv32 == m_pc) && c_dr_pc == 0bv32) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(m_i)) && ~bvule32(2bv32, E_M)) && c_num_read == 0bv32) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && 1bv32 == t1_i) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && 0bv32 == m_pc) && c_dr_pc == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && local == token) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((~bvule32(2bv32, E_M) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && 2bv32 == m_st) && ~bvule32(tmp___0, 0bv32)) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write))) || ((((((((((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)))) && c_num_read == 0bv32) && p_num_write == 0bv32) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(p_last_write, c_last_read)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvult64(~zero_extendFrom32To33(c_last_read), ~bvadd16(~zero_extendFrom32To33(p_last_write), 1bv33))) && q_free == 0bv32) && ~bvule32(p_last_write, q_buf_0)) && 0bv32 == m_st) && ~bvule32(tmp, 0bv32)) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == m_i) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && c_dr_pc == 0bv32) && ~bvule32(2bv32, t1_st)) && ~bvule32(tmp___0, 0bv32)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && c_dr_st == 0bv32) && p_dw_pc == 0bv32) && ~bvule32(q_buf_0, p_last_write)) RESULT: Ultimate proved your program to be correct! [2022-01-10 20:00:41,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...