/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_SUM.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 07:42:02,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 07:42:02,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 07:42:02,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 07:42:02,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 07:42:02,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 07:42:02,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 07:42:02,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 07:42:02,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 07:42:02,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 07:42:02,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 07:42:02,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 07:42:02,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 07:42:02,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 07:42:02,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 07:42:02,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 07:42:02,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 07:42:02,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 07:42:02,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 07:42:02,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 07:42:02,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 07:42:02,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 07:42:02,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 07:42:02,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 07:42:02,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 07:42:02,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 07:42:02,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 07:42:02,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 07:42:02,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 07:42:02,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 07:42:02,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 07:42:02,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 07:42:02,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 07:42:02,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 07:42:02,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 07:42:02,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 07:42:02,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 07:42:02,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 07:42:02,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 07:42:02,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 07:42:02,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 07:42:02,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 07:42:02,321 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 07:42:02,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 07:42:02,322 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 07:42:02,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 07:42:02,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 07:42:02,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 07:42:02,323 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 07:42:02,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 07:42:02,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 07:42:02,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 07:42:02,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 07:42:02,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 07:42:02,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 07:42:02,323 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 07:42:02,324 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 07:42:02,324 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 07:42:02,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 07:42:02,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 07:42:02,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 07:42:02,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 07:42:02,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 07:42:02,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:42:02,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 07:42:02,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 07:42:02,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 07:42:02,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 07:42:02,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 07:42:02,325 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 07:42:02,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 07:42:02,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 07:42:02,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 07:42:02,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 07:42:02,326 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 07:42:02,326 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 07:42:02,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 07:42:02,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 07:42:02,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 07:42:02,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 07:42:02,520 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 07:42:02,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-01-11 07:42:02,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d741e1b1/2f3b593b015d44c0b1f4757110ed85e0/FLAG2c3e2c387 [2022-01-11 07:42:02,924 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 07:42:02,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-01-11 07:42:02,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d741e1b1/2f3b593b015d44c0b1f4757110ed85e0/FLAG2c3e2c387 [2022-01-11 07:42:02,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d741e1b1/2f3b593b015d44c0b1f4757110ed85e0 [2022-01-11 07:42:02,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 07:42:02,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 07:42:02,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 07:42:02,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 07:42:02,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 07:42:02,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:42:02" (1/1) ... [2022-01-11 07:42:02,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548b875e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:02, skipping insertion in model container [2022-01-11 07:42:02,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:42:02" (1/1) ... [2022-01-11 07:42:02,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 07:42:02,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 07:42:03,095 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_3.cil+token_ring.01.cil-1.c[911,924] [2022-01-11 07:42:03,142 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-01-11 07:42:03,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:42:03,173 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 07:42:03,181 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_3.cil+token_ring.01.cil-1.c[911,924] [2022-01-11 07:42:03,201 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_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-01-11 07:42:03,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:42:03,225 INFO L208 MainTranslator]: Completed translation [2022-01-11 07:42:03,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03 WrapperNode [2022-01-11 07:42:03,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 07:42:03,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 07:42:03,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 07:42:03,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 07:42:03,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,307 INFO L137 Inliner]: procedures = 58, calls = 64, calls flagged for inlining = 59, calls inlined = 71, statements flattened = 809 [2022-01-11 07:42:03,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 07:42:03,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 07:42:03,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 07:42:03,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 07:42:03,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 07:42:03,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 07:42:03,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 07:42:03,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 07:42:03,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:03,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:42:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:42:03,397 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-11 07:42:03,399 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-11 07:42:03,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 07:42:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 07:42:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 07:42:03,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 07:42:03,516 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 07:42:03,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 07:42:03,962 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume !(1bv32 == ~q_free~0); [2022-01-11 07:42:03,963 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2022-01-11 07:42:03,963 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 07:42:03,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 07:42:03,969 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-11 07:42:03,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:42:03 BoogieIcfgContainer [2022-01-11 07:42:03,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 07:42:03,971 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 07:42:03,971 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 07:42:03,972 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 07:42:03,974 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:42:03" (1/1) ... [2022-01-11 07:42:04,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:42:04 BasicIcfg [2022-01-11 07:42:04,085 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 07:42:04,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 07:42:04,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 07:42:04,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 07:42:04,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 07:42:02" (1/4) ... [2022-01-11 07:42:04,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741b3b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:42:04, skipping insertion in model container [2022-01-11 07:42:04,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:42:03" (2/4) ... [2022-01-11 07:42:04,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741b3b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:42:04, skipping insertion in model container [2022-01-11 07:42:04,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:42:03" (3/4) ... [2022-01-11 07:42:04,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741b3b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:42:04, skipping insertion in model container [2022-01-11 07:42:04,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:42:04" (4/4) ... [2022-01-11 07:42:04,090 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.cTransformedIcfg [2022-01-11 07:42:04,093 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 07:42:04,093 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 07:42:04,123 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 07:42:04,127 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-11 07:42:04,128 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 07:42:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 291 states have (on average 1.556701030927835) internal successors, (453), 294 states have internal predecessors, (453), 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-11 07:42:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:42:04,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:04,157 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-11 07:42:04,157 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash -199397213, now seen corresponding path program 1 times [2022-01-11 07:42:04,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:04,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563821803] [2022-01-11 07:42:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:04,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:04,343 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-11 07:42:04,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:04,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563821803] [2022-01-11 07:42:04,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563821803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:04,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:04,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:04,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374988107] [2022-01-11 07:42:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:04,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:04,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:04,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:04,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:04,372 INFO L87 Difference]: Start difference. First operand has 295 states, 291 states have (on average 1.556701030927835) internal successors, (453), 294 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.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-11 07:42:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:04,435 INFO L93 Difference]: Finished difference Result 549 states and 842 transitions. [2022-01-11 07:42:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:04,440 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-11 07:42:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:04,451 INFO L225 Difference]: With dead ends: 549 [2022-01-11 07:42:04,452 INFO L226 Difference]: Without dead ends: 285 [2022-01-11 07:42:04,455 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-11 07:42:04,457 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 216 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 642 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-11 07:42:04,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 642 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-01-11 07:42:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-01-11 07:42:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 282 states have (on average 1.49645390070922) internal successors, (422), 284 states have internal predecessors, (422), 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-11 07:42:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 422 transitions. [2022-01-11 07:42:04,506 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 422 transitions. Word has length 44 [2022-01-11 07:42:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:04,506 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 422 transitions. [2022-01-11 07:42:04,507 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-11 07:42:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 422 transitions. [2022-01-11 07:42:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:42:04,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:04,508 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-11 07:42:04,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 07:42:04,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1832201212, now seen corresponding path program 1 times [2022-01-11 07:42:04,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:04,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024938850] [2022-01-11 07:42:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:04,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:04,615 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-11 07:42:04,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024938850] [2022-01-11 07:42:04,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024938850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:04,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:04,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:42:04,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338860247] [2022-01-11 07:42:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:04,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:04,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:04,618 INFO L87 Difference]: Start difference. First operand 285 states and 422 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-11 07:42:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:04,661 INFO L93 Difference]: Finished difference Result 526 states and 775 transitions. [2022-01-11 07:42:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:04,661 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-11 07:42:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:04,663 INFO L225 Difference]: With dead ends: 526 [2022-01-11 07:42:04,663 INFO L226 Difference]: Without dead ends: 386 [2022-01-11 07:42:04,664 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-11 07:42:04,664 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 386 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 579 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-11 07:42:04,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 579 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-01-11 07:42:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2022-01-11 07:42:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 381 states have (on average 1.4803149606299213) internal successors, (564), 383 states have internal predecessors, (564), 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-11 07:42:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 564 transitions. [2022-01-11 07:42:04,686 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 564 transitions. Word has length 44 [2022-01-11 07:42:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:04,686 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 564 transitions. [2022-01-11 07:42:04,694 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-11 07:42:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 564 transitions. [2022-01-11 07:42:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:42:04,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:04,696 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-11 07:42:04,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 07:42:04,696 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -726372828, now seen corresponding path program 1 times [2022-01-11 07:42:04,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:04,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371631172] [2022-01-11 07:42:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:04,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:04,743 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-11 07:42:04,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:04,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371631172] [2022-01-11 07:42:04,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371631172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:04,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:04,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:42:04,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763424477] [2022-01-11 07:42:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:04,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:04,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:04,745 INFO L87 Difference]: Start difference. First operand 384 states and 564 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-11 07:42:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:04,762 INFO L93 Difference]: Finished difference Result 622 states and 911 transitions. [2022-01-11 07:42:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:04,763 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-11 07:42:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:04,764 INFO L225 Difference]: With dead ends: 622 [2022-01-11 07:42:04,764 INFO L226 Difference]: Without dead ends: 384 [2022-01-11 07:42:04,765 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-11 07:42:04,766 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 406 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 410 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-11 07:42:04,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 410 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-01-11 07:42:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-01-11 07:42:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 381 states have (on average 1.4593175853018372) internal successors, (556), 383 states have internal predecessors, (556), 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-11 07:42:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 556 transitions. [2022-01-11 07:42:04,823 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 556 transitions. Word has length 44 [2022-01-11 07:42:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:04,823 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 556 transitions. [2022-01-11 07:42:04,823 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-11 07:42:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 556 transitions. [2022-01-11 07:42:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:42:04,825 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:04,825 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-11 07:42:04,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 07:42:04,825 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2035716, now seen corresponding path program 1 times [2022-01-11 07:42:04,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:04,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121925867] [2022-01-11 07:42:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:04,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:04,873 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-11 07:42:04,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:04,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121925867] [2022-01-11 07:42:04,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121925867] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:04,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:04,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:42:04,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641432193] [2022-01-11 07:42:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:04,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:04,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:04,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:04,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:04,875 INFO L87 Difference]: Start difference. First operand 384 states and 556 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-11 07:42:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:04,912 INFO L93 Difference]: Finished difference Result 620 states and 892 transitions. [2022-01-11 07:42:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:04,913 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-11 07:42:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:04,914 INFO L225 Difference]: With dead ends: 620 [2022-01-11 07:42:04,914 INFO L226 Difference]: Without dead ends: 384 [2022-01-11 07:42:04,915 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-11 07:42:04,923 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 373 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 415 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-11 07:42:04,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 415 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-01-11 07:42:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-01-11 07:42:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 381 states have (on average 1.4225721784776904) internal successors, (542), 383 states have internal predecessors, (542), 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-11 07:42:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 542 transitions. [2022-01-11 07:42:04,942 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 542 transitions. Word has length 44 [2022-01-11 07:42:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:04,942 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 542 transitions. [2022-01-11 07:42:04,942 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-11 07:42:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 542 transitions. [2022-01-11 07:42:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:42:04,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:04,947 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-11 07:42:04,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 07:42:04,948 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash -608430941, now seen corresponding path program 1 times [2022-01-11 07:42:04,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:04,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238026205] [2022-01-11 07:42:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:04,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:04,991 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-11 07:42:04,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:04,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238026205] [2022-01-11 07:42:04,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238026205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:04,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:04,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:42:04,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108631962] [2022-01-11 07:42:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:04,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:04,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:04,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:04,993 INFO L87 Difference]: Start difference. First operand 384 states and 542 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-11 07:42:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:05,054 INFO L93 Difference]: Finished difference Result 818 states and 1132 transitions. [2022-01-11 07:42:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:05,055 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-11 07:42:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:05,057 INFO L225 Difference]: With dead ends: 818 [2022-01-11 07:42:05,057 INFO L226 Difference]: Without dead ends: 584 [2022-01-11 07:42:05,058 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-11 07:42:05,061 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 370 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 545 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-11 07:42:05,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 545 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-01-11 07:42:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 558. [2022-01-11 07:42:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 555 states have (on average 1.3837837837837839) internal successors, (768), 557 states have internal predecessors, (768), 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-11 07:42:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 768 transitions. [2022-01-11 07:42:05,083 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 768 transitions. Word has length 44 [2022-01-11 07:42:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:05,087 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 768 transitions. [2022-01-11 07:42:05,087 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-11 07:42:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 768 transitions. [2022-01-11 07:42:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:42:05,089 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:05,089 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-11 07:42:05,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 07:42:05,089 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash -740863447, now seen corresponding path program 1 times [2022-01-11 07:42:05,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:05,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33379325] [2022-01-11 07:42:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:05,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:05,155 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-11 07:42:05,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:05,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33379325] [2022-01-11 07:42:05,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33379325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:05,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:05,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:05,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126464328] [2022-01-11 07:42:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:05,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:05,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:05,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:05,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:05,158 INFO L87 Difference]: Start difference. First operand 558 states and 768 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-11 07:42:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:05,242 INFO L93 Difference]: Finished difference Result 816 states and 1154 transitions. [2022-01-11 07:42:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:05,244 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-11 07:42:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:05,245 INFO L225 Difference]: With dead ends: 816 [2022-01-11 07:42:05,246 INFO L226 Difference]: Without dead ends: 691 [2022-01-11 07:42:05,246 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-11 07:42:05,247 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 180 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:05,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 762 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:42:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-01-11 07:42:05,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 687. [2022-01-11 07:42:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 684 states have (on average 1.3903508771929824) internal successors, (951), 686 states have internal predecessors, (951), 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-11 07:42:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 951 transitions. [2022-01-11 07:42:05,272 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 951 transitions. Word has length 44 [2022-01-11 07:42:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:05,272 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 951 transitions. [2022-01-11 07:42:05,272 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-11 07:42:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 951 transitions. [2022-01-11 07:42:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:42:05,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:05,273 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-11 07:42:05,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 07:42:05,273 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash 756813353, now seen corresponding path program 1 times [2022-01-11 07:42:05,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:05,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280168915] [2022-01-11 07:42:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:05,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:05,307 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-11 07:42:05,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:05,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280168915] [2022-01-11 07:42:05,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280168915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:05,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:05,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:05,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843182100] [2022-01-11 07:42:05,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:05,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:05,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:05,310 INFO L87 Difference]: Start difference. First operand 687 states and 951 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-11 07:42:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:05,375 INFO L93 Difference]: Finished difference Result 1105 states and 1556 transitions. [2022-01-11 07:42:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:05,375 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-11 07:42:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:05,378 INFO L225 Difference]: With dead ends: 1105 [2022-01-11 07:42:05,378 INFO L226 Difference]: Without dead ends: 865 [2022-01-11 07:42:05,378 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-11 07:42:05,379 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 364 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:05,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 525 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-01-11 07:42:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 857. [2022-01-11 07:42:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 854 states have (on average 1.3887587822014051) internal successors, (1186), 856 states have internal predecessors, (1186), 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-11 07:42:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1186 transitions. [2022-01-11 07:42:05,416 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1186 transitions. Word has length 44 [2022-01-11 07:42:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:05,417 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1186 transitions. [2022-01-11 07:42:05,417 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-11 07:42:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1186 transitions. [2022-01-11 07:42:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 07:42:05,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:05,418 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] [2022-01-11 07:42:05,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 07:42:05,418 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash -578265863, now seen corresponding path program 1 times [2022-01-11 07:42:05,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:05,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81437945] [2022-01-11 07:42:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:05,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:05,469 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-11 07:42:05,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81437945] [2022-01-11 07:42:05,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81437945] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:05,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:05,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:05,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374964020] [2022-01-11 07:42:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:05,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:05,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:05,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:05,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:05,471 INFO L87 Difference]: Start difference. First operand 857 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11 07:42:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:05,574 INFO L93 Difference]: Finished difference Result 1579 states and 2220 transitions. [2022-01-11 07:42:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:05,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-01-11 07:42:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:05,578 INFO L225 Difference]: With dead ends: 1579 [2022-01-11 07:42:05,578 INFO L226 Difference]: Without dead ends: 1183 [2022-01-11 07:42:05,579 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-11 07:42:05,580 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 348 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:05,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 522 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-01-11 07:42:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1175. [2022-01-11 07:42:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1172 states have (on average 1.3813993174061434) internal successors, (1619), 1174 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:42:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1619 transitions. [2022-01-11 07:42:05,626 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1619 transitions. Word has length 45 [2022-01-11 07:42:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:05,626 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 1619 transitions. [2022-01-11 07:42:05,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11 07:42:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1619 transitions. [2022-01-11 07:42:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 07:42:05,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:05,627 INFO L514 BasicCegarLoop]: trace histogram [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-11 07:42:05,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 07:42:05,627 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1827521190, now seen corresponding path program 1 times [2022-01-11 07:42:05,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:05,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861295454] [2022-01-11 07:42:05,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:05,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 07:42:05,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:05,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861295454] [2022-01-11 07:42:05,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861295454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:05,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:05,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:05,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306817238] [2022-01-11 07:42:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:05,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:05,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:05,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:05,676 INFO L87 Difference]: Start difference. First operand 1175 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11 07:42:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:05,770 INFO L93 Difference]: Finished difference Result 2543 states and 3521 transitions. [2022-01-11 07:42:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-01-11 07:42:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:05,777 INFO L225 Difference]: With dead ends: 2543 [2022-01-11 07:42:05,778 INFO L226 Difference]: Without dead ends: 1847 [2022-01-11 07:42:05,779 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-11 07:42:05,781 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 343 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:05,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 552 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-01-11 07:42:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1843. [2022-01-11 07:42:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1840 states have (on average 1.361413043478261) internal successors, (2505), 1842 states have internal predecessors, (2505), 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-11 07:42:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2505 transitions. [2022-01-11 07:42:05,878 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2505 transitions. Word has length 59 [2022-01-11 07:42:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:05,882 INFO L470 AbstractCegarLoop]: Abstraction has 1843 states and 2505 transitions. [2022-01-11 07:42:05,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11 07:42:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2505 transitions. [2022-01-11 07:42:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-11 07:42:05,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:05,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:42:05,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 07:42:05,884 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:05,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:05,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1260880350, now seen corresponding path program 1 times [2022-01-11 07:42:05,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:05,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485817805] [2022-01-11 07:42:05,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:05,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:05,931 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-11 07:42:05,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:05,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485817805] [2022-01-11 07:42:05,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485817805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:05,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:05,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:05,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140285497] [2022-01-11 07:42:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:05,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:05,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:05,932 INFO L87 Difference]: Start difference. First operand 1843 states and 2505 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11 07:42:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:06,096 INFO L93 Difference]: Finished difference Result 4467 states and 6087 transitions. [2022-01-11 07:42:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:06,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-01-11 07:42:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:06,109 INFO L225 Difference]: With dead ends: 4467 [2022-01-11 07:42:06,109 INFO L226 Difference]: Without dead ends: 3147 [2022-01-11 07:42:06,114 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-11 07:42:06,115 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 146 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:06,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 912 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2022-01-11 07:42:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3147. [2022-01-11 07:42:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3147 states, 3144 states have (on average 1.3463740458015268) internal successors, (4233), 3146 states have internal predecessors, (4233), 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-11 07:42:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 3147 states and 4233 transitions. [2022-01-11 07:42:06,258 INFO L78 Accepts]: Start accepts. Automaton has 3147 states and 4233 transitions. Word has length 61 [2022-01-11 07:42:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:06,258 INFO L470 AbstractCegarLoop]: Abstraction has 3147 states and 4233 transitions. [2022-01-11 07:42:06,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11 07:42:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 4233 transitions. [2022-01-11 07:42:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 07:42:06,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:06,260 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-11 07:42:06,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 07:42:06,261 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:06,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1837939250, now seen corresponding path program 1 times [2022-01-11 07:42:06,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:06,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436271040] [2022-01-11 07:42:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:06,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:06,313 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-11 07:42:06,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:06,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436271040] [2022-01-11 07:42:06,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436271040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:06,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:06,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:42:06,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987588731] [2022-01-11 07:42:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:06,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:42:06,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:06,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:42:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:42:06,315 INFO L87 Difference]: Start difference. First operand 3147 states and 4233 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-11 07:42:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:06,527 INFO L93 Difference]: Finished difference Result 3928 states and 5279 transitions. [2022-01-11 07:42:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:42:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-11 07:42:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:06,538 INFO L225 Difference]: With dead ends: 3928 [2022-01-11 07:42:06,538 INFO L226 Difference]: Without dead ends: 3524 [2022-01-11 07:42:06,539 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-11 07:42:06,540 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 562 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:06,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1678 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:42:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2022-01-11 07:42:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3168. [2022-01-11 07:42:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 3165 states have (on average 1.34218009478673) internal successors, (4248), 3167 states have internal predecessors, (4248), 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-11 07:42:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4248 transitions. [2022-01-11 07:42:06,660 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4248 transitions. Word has length 70 [2022-01-11 07:42:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:06,660 INFO L470 AbstractCegarLoop]: Abstraction has 3168 states and 4248 transitions. [2022-01-11 07:42:06,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 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-11 07:42:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4248 transitions. [2022-01-11 07:42:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 07:42:06,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:06,664 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-11 07:42:06,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 07:42:06,664 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1157170420, now seen corresponding path program 1 times [2022-01-11 07:42:06,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:06,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431411537] [2022-01-11 07:42:06,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:06,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:06,688 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-11 07:42:06,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:06,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431411537] [2022-01-11 07:42:06,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431411537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:06,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:06,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:42:06,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276827763] [2022-01-11 07:42:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:06,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:06,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:06,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:06,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:06,690 INFO L87 Difference]: Start difference. First operand 3168 states and 4248 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-11 07:42:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:06,880 INFO L93 Difference]: Finished difference Result 3585 states and 4793 transitions. [2022-01-11 07:42:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:06,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-11 07:42:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:06,891 INFO L225 Difference]: With dead ends: 3585 [2022-01-11 07:42:06,891 INFO L226 Difference]: Without dead ends: 3153 [2022-01-11 07:42:06,893 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-11 07:42:06,893 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 331 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:06,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2022-01-11 07:42:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 3153. [2022-01-11 07:42:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3150 states have (on average 1.3361904761904762) internal successors, (4209), 3152 states have internal predecessors, (4209), 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-11 07:42:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 4209 transitions. [2022-01-11 07:42:07,056 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 4209 transitions. Word has length 70 [2022-01-11 07:42:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:07,056 INFO L470 AbstractCegarLoop]: Abstraction has 3153 states and 4209 transitions. [2022-01-11 07:42:07,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 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-11 07:42:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 4209 transitions. [2022-01-11 07:42:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 07:42:07,060 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:07,060 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-11 07:42:07,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 07:42:07,060 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash 708473781, now seen corresponding path program 1 times [2022-01-11 07:42:07,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:07,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144133082] [2022-01-11 07:42:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:07,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:07,087 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-11 07:42:07,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:07,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144133082] [2022-01-11 07:42:07,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144133082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:07,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:07,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:07,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753085581] [2022-01-11 07:42:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:07,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:07,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:07,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:07,089 INFO L87 Difference]: Start difference. First operand 3153 states and 4209 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-11 07:42:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:07,229 INFO L93 Difference]: Finished difference Result 3901 states and 5162 transitions. [2022-01-11 07:42:07,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:07,229 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-11 07:42:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:07,239 INFO L225 Difference]: With dead ends: 3901 [2022-01-11 07:42:07,239 INFO L226 Difference]: Without dead ends: 3493 [2022-01-11 07:42:07,240 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-11 07:42:07,241 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 322 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 509 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-11 07:42:07,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 509 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3493 states. [2022-01-11 07:42:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3493 to 3459. [2022-01-11 07:42:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3456 states have (on average 1.3295717592592593) internal successors, (4595), 3458 states have internal predecessors, (4595), 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-11 07:42:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4595 transitions. [2022-01-11 07:42:07,404 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4595 transitions. Word has length 70 [2022-01-11 07:42:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:07,405 INFO L470 AbstractCegarLoop]: Abstraction has 3459 states and 4595 transitions. [2022-01-11 07:42:07,405 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-11 07:42:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4595 transitions. [2022-01-11 07:42:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 07:42:07,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:07,408 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-11 07:42:07,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 07:42:07,408 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash 102176244, now seen corresponding path program 1 times [2022-01-11 07:42:07,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:07,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804449751] [2022-01-11 07:42:07,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:07,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:07,449 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-11 07:42:07,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:07,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804449751] [2022-01-11 07:42:07,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804449751] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:07,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:07,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:07,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101848114] [2022-01-11 07:42:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:07,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:07,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:07,450 INFO L87 Difference]: Start difference. First operand 3459 states and 4595 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-11 07:42:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:07,602 INFO L93 Difference]: Finished difference Result 4779 states and 6259 transitions. [2022-01-11 07:42:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:07,603 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-11 07:42:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:07,614 INFO L225 Difference]: With dead ends: 4779 [2022-01-11 07:42:07,614 INFO L226 Difference]: Without dead ends: 4075 [2022-01-11 07:42:07,616 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-11 07:42:07,616 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 338 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:07,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 517 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2022-01-11 07:42:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 4057. [2022-01-11 07:42:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4057 states, 4054 states have (on average 1.3115441539220523) internal successors, (5317), 4056 states have internal predecessors, (5317), 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-11 07:42:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 5317 transitions. [2022-01-11 07:42:07,786 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 5317 transitions. Word has length 70 [2022-01-11 07:42:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:07,786 INFO L470 AbstractCegarLoop]: Abstraction has 4057 states and 5317 transitions. [2022-01-11 07:42:07,786 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-11 07:42:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 5317 transitions. [2022-01-11 07:42:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-11 07:42:07,789 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:07,789 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-11 07:42:07,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 07:42:07,789 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash -761070684, now seen corresponding path program 1 times [2022-01-11 07:42:07,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:07,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545220651] [2022-01-11 07:42:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:07,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:07,823 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-11 07:42:07,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:07,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545220651] [2022-01-11 07:42:07,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545220651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:07,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:07,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:07,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141520005] [2022-01-11 07:42:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:07,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:07,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:07,825 INFO L87 Difference]: Start difference. First operand 4057 states and 5317 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-11 07:42:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:08,010 INFO L93 Difference]: Finished difference Result 6471 states and 8295 transitions. [2022-01-11 07:42:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:08,011 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-11 07:42:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:08,037 INFO L225 Difference]: With dead ends: 6471 [2022-01-11 07:42:08,037 INFO L226 Difference]: Without dead ends: 4611 [2022-01-11 07:42:08,041 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-11 07:42:08,041 INFO L933 BasicCegarLoop]: 507 mSDtfsCounter, 137 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:08,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 869 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2022-01-11 07:42:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4611. [2022-01-11 07:42:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4611 states, 4608 states have (on average 1.2960069444444444) internal successors, (5972), 4610 states have internal predecessors, (5972), 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-11 07:42:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4611 states to 4611 states and 5972 transitions. [2022-01-11 07:42:08,264 INFO L78 Accepts]: Start accepts. Automaton has 4611 states and 5972 transitions. Word has length 71 [2022-01-11 07:42:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:08,264 INFO L470 AbstractCegarLoop]: Abstraction has 4611 states and 5972 transitions. [2022-01-11 07:42:08,264 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-11 07:42:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4611 states and 5972 transitions. [2022-01-11 07:42:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 07:42:08,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:08,270 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-11 07:42:08,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 07:42:08,270 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1222286970, now seen corresponding path program 1 times [2022-01-11 07:42:08,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:08,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289797778] [2022-01-11 07:42:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:08,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:08,302 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-11 07:42:08,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:08,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289797778] [2022-01-11 07:42:08,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289797778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:08,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:08,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:08,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216780626] [2022-01-11 07:42:08,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:08,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:08,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:08,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:08,306 INFO L87 Difference]: Start difference. First operand 4611 states and 5972 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-11 07:42:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:08,502 INFO L93 Difference]: Finished difference Result 6419 states and 8171 transitions. [2022-01-11 07:42:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:08,503 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-11 07:42:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:08,510 INFO L225 Difference]: With dead ends: 6419 [2022-01-11 07:42:08,511 INFO L226 Difference]: Without dead ends: 4563 [2022-01-11 07:42:08,513 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-11 07:42:08,514 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 301 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 520 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-11 07:42:08,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 520 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2022-01-11 07:42:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 4563. [2022-01-11 07:42:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4563 states, 4560 states have (on average 1.2798245614035089) internal successors, (5836), 4562 states have internal predecessors, (5836), 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-11 07:42:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 5836 transitions. [2022-01-11 07:42:08,711 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 5836 transitions. Word has length 103 [2022-01-11 07:42:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:08,711 INFO L470 AbstractCegarLoop]: Abstraction has 4563 states and 5836 transitions. [2022-01-11 07:42:08,711 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-11 07:42:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 5836 transitions. [2022-01-11 07:42:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 07:42:08,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:08,716 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:42:08,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 07:42:08,717 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash -862100864, now seen corresponding path program 1 times [2022-01-11 07:42:08,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:08,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110587707] [2022-01-11 07:42:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:08,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 07:42:08,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:08,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110587707] [2022-01-11 07:42:08,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110587707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:08,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:08,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:08,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498913746] [2022-01-11 07:42:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:08,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:08,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:08,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:08,749 INFO L87 Difference]: Start difference. First operand 4563 states and 5836 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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-11 07:42:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:08,974 INFO L93 Difference]: Finished difference Result 9643 states and 12720 transitions. [2022-01-11 07:42:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:08,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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 103 [2022-01-11 07:42:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:08,988 INFO L225 Difference]: With dead ends: 9643 [2022-01-11 07:42:08,988 INFO L226 Difference]: Without dead ends: 7103 [2022-01-11 07:42:08,992 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-11 07:42:08,993 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 131 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 699 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-11 07:42:08,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 699 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7103 states. [2022-01-11 07:42:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7103 to 7099. [2022-01-11 07:42:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7099 states, 7096 states have (on average 1.2981961668545658) internal successors, (9212), 7098 states have internal predecessors, (9212), 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-11 07:42:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7099 states to 7099 states and 9212 transitions. [2022-01-11 07:42:09,232 INFO L78 Accepts]: Start accepts. Automaton has 7099 states and 9212 transitions. Word has length 103 [2022-01-11 07:42:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:09,232 INFO L470 AbstractCegarLoop]: Abstraction has 7099 states and 9212 transitions. [2022-01-11 07:42:09,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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-11 07:42:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7099 states and 9212 transitions. [2022-01-11 07:42:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 07:42:09,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:09,240 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-11 07:42:09,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 07:42:09,241 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash -65223065, now seen corresponding path program 1 times [2022-01-11 07:42:09,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:09,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252805077] [2022-01-11 07:42:09,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:09,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:09,273 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-11 07:42:09,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252805077] [2022-01-11 07:42:09,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252805077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:09,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:09,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:09,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214170704] [2022-01-11 07:42:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:09,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:09,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:09,276 INFO L87 Difference]: Start difference. First operand 7099 states and 9212 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-11 07:42:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:09,489 INFO L93 Difference]: Finished difference Result 8909 states and 11348 transitions. [2022-01-11 07:42:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:09,490 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-11 07:42:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:09,501 INFO L225 Difference]: With dead ends: 8909 [2022-01-11 07:42:09,501 INFO L226 Difference]: Without dead ends: 7101 [2022-01-11 07:42:09,505 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-11 07:42:09,506 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 112 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 831 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-11 07:42:09,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 831 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:09,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7101 states. [2022-01-11 07:42:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7101 to 7099. [2022-01-11 07:42:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7099 states, 7096 states have (on average 1.2948139797068772) internal successors, (9188), 7098 states have internal predecessors, (9188), 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-11 07:42:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7099 states to 7099 states and 9188 transitions. [2022-01-11 07:42:09,760 INFO L78 Accepts]: Start accepts. Automaton has 7099 states and 9188 transitions. Word has length 104 [2022-01-11 07:42:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:09,760 INFO L470 AbstractCegarLoop]: Abstraction has 7099 states and 9188 transitions. [2022-01-11 07:42:09,760 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-11 07:42:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 7099 states and 9188 transitions. [2022-01-11 07:42:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 07:42:09,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:09,767 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-11 07:42:09,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 07:42:09,767 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash -558888308, now seen corresponding path program 1 times [2022-01-11 07:42:09,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:09,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738809336] [2022-01-11 07:42:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:09,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:09,797 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-11 07:42:09,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:09,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738809336] [2022-01-11 07:42:09,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738809336] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:09,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:09,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:09,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356463024] [2022-01-11 07:42:09,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:09,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:09,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:09,798 INFO L87 Difference]: Start difference. First operand 7099 states and 9188 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-11 07:42:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:09,970 INFO L93 Difference]: Finished difference Result 8370 states and 10677 transitions. [2022-01-11 07:42:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:09,970 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-11 07:42:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:09,980 INFO L225 Difference]: With dead ends: 8370 [2022-01-11 07:42:09,980 INFO L226 Difference]: Without dead ends: 6562 [2022-01-11 07:42:09,983 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-11 07:42:09,983 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 108 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 799 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-11 07:42:09,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 799 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2022-01-11 07:42:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6554. [2022-01-11 07:42:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6554 states, 6551 states have (on average 1.300259502366051) internal successors, (8518), 6553 states have internal predecessors, (8518), 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-11 07:42:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 8518 transitions. [2022-01-11 07:42:10,373 INFO L78 Accepts]: Start accepts. Automaton has 6554 states and 8518 transitions. Word has length 104 [2022-01-11 07:42:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:10,374 INFO L470 AbstractCegarLoop]: Abstraction has 6554 states and 8518 transitions. [2022-01-11 07:42:10,374 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-11 07:42:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6554 states and 8518 transitions. [2022-01-11 07:42:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 07:42:10,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:10,381 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:42:10,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 07:42:10,381 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:10,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1024975507, now seen corresponding path program 1 times [2022-01-11 07:42:10,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:10,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522605730] [2022-01-11 07:42:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:10,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:42:10,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:10,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522605730] [2022-01-11 07:42:10,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522605730] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:10,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:10,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:10,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212364538] [2022-01-11 07:42:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:10,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:10,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:10,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:10,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:10,416 INFO L87 Difference]: Start difference. First operand 6554 states and 8518 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-11 07:42:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:10,625 INFO L93 Difference]: Finished difference Result 9122 states and 12022 transitions. [2022-01-11 07:42:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:10,626 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-11 07:42:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:10,628 INFO L225 Difference]: With dead ends: 9122 [2022-01-11 07:42:10,628 INFO L226 Difference]: Without dead ends: 1293 [2022-01-11 07:42:10,634 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-11 07:42:10,635 INFO L933 BasicCegarLoop]: 478 mSDtfsCounter, 112 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:10,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 819 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-01-11 07:42:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2022-01-11 07:42:10,680 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-11 07:42:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1472 transitions. [2022-01-11 07:42:10,681 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1472 transitions. Word has length 104 [2022-01-11 07:42:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:10,681 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1472 transitions. [2022-01-11 07:42:10,681 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-11 07:42:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1472 transitions. [2022-01-11 07:42:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 07:42:10,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:10,682 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-11 07:42:10,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 07:42:10,683 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1391693171, now seen corresponding path program 1 times [2022-01-11 07:42:10,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:10,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963047900] [2022-01-11 07:42:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:10,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:10,749 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-11 07:42:10,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:10,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963047900] [2022-01-11 07:42:10,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963047900] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:10,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:10,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:42:10,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185998662] [2022-01-11 07:42:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:10,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:42:10,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:10,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:42:10,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:42:10,751 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-11 07:42:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:10,850 INFO L93 Difference]: Finished difference Result 2349 states and 2671 transitions. [2022-01-11 07:42:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:42:10,851 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-11 07:42:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:10,852 INFO L225 Difference]: With dead ends: 2349 [2022-01-11 07:42:10,852 INFO L226 Difference]: Without dead ends: 683 [2022-01-11 07:42:10,853 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-11 07:42:10,854 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-11 07:42:10,854 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-11 07:42:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-01-11 07:42:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 617. [2022-01-11 07:42:10,911 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-11 07:42:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 676 transitions. [2022-01-11 07:42:10,911 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 676 transitions. Word has length 105 [2022-01-11 07:42:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:10,912 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 676 transitions. [2022-01-11 07:42:10,912 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-11 07:42:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 676 transitions. [2022-01-11 07:42:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 07:42:10,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:10,913 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-11 07:42:10,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 07:42:10,913 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:10,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1605386549, now seen corresponding path program 1 times [2022-01-11 07:42:10,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740920681] [2022-01-11 07:42:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:10,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:11,028 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-11 07:42:11,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:11,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740920681] [2022-01-11 07:42:11,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740920681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:11,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:11,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 07:42:11,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182155777] [2022-01-11 07:42:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:11,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 07:42:11,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 07:42:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 07:42:11,030 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-11 07:42:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:11,100 INFO L93 Difference]: Finished difference Result 621 states and 680 transitions. [2022-01-11 07:42:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 07:42:11,100 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-11 07:42:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:11,101 INFO L225 Difference]: With dead ends: 621 [2022-01-11 07:42:11,101 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 07:42:11,101 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-11 07:42:11,102 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-11 07:42:11,102 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-11 07:42:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 07:42:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 07:42:11,103 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-11 07:42:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 07:42:11,103 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-01-11 07:42:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:11,103 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 07:42:11,103 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-11 07:42:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 07:42:11,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 07:42:11,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-11 07:42:11,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-11 07:42:11,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-11 07:42:11,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 07:42:11,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 07:42:28,438 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 07:42:28,438 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 07:42:28,438 INFO L858 garLoopResultBuilder]: For program point L1065(lines 1065 1068) no Hoare annotation was computed. [2022-01-11 07:42:28,438 INFO L854 garLoopResultBuilder]: At program point L559(lines 543 561) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (not (= (+ (- 1) ~t1_pc~0Int) 0)) (<= ~c_dr_pc~0Int 0) (= (+ ~q_write_ev~0Int (* (- 1) ~q_read_ev~0Int)) 0) (= (+ (- 2) ~M_E~0Int) 0) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int) (<= 2 ~q_write_ev~0Int)) [2022-01-11 07:42:28,438 INFO L854 garLoopResultBuilder]: At program point L970(lines 963 972) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (= (+ (* (- 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)) (<= ~c_dr_pc~0Int 0) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,438 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 272) no Hoare annotation was computed. [2022-01-11 07:42:28,438 INFO L854 garLoopResultBuilder]: At program point L742(lines 737 744) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (= (+ (* (- 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)) (<= ~c_dr_pc~0Int 0) (= (+ (- 2) ~M_E~0Int) 0) (= ~t1_i~0Int 1) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L854 garLoopResultBuilder]: At program point L266-2(lines 262 276) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L749(lines 749 753) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 43 58) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L749-2(lines 748 761) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 280 293) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L854 garLoopResultBuilder]: At program point L754-1(lines 745 762) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= ~p_dw_pc~0Int 0)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse5 (<= ~c_dr_pc~0Int 0)) (.cse6 (= (+ (- 2) ~M_E~0Int) 0)) (.cse7 (= ~t1_i~0Int 1)) (.cse8 (<= ~m_pc~0Int 0)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int))) (or (and .cse0 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-01-11 07:42:28,439 INFO L854 garLoopResultBuilder]: At program point L57(lines 40 59) the Hoare annotation is: (and (= 0 ~p_dw_st~0Int) (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,439 INFO L854 garLoopResultBuilder]: At program point L286-1(lines 277 294) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L838(lines 838 842) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L838-2(lines 837 860) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 318 331) no Hoare annotation was computed. [2022-01-11 07:42:28,439 INFO L858 garLoopResultBuilder]: For program point L843-1(lines 837 860) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L854 garLoopResultBuilder]: At program point L324-1(lines 315 332) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L848-1(lines 837 860) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L854 garLoopResultBuilder]: At program point L853-1(lines 834 861) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= ~p_dw_pc~0Int 0)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse5 (<= ~c_dr_pc~0Int 0)) (.cse6 (= (+ (- 2) ~M_E~0Int) 0)) (.cse7 (= ~t1_i~0Int 1)) (.cse8 (<= ~m_pc~0Int 0)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse10 (= 0 ~t1_st~0Int))) (or (and .cse0 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L854 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L854 garLoopResultBuilder]: At program point L96(lines 70 98) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,440 INFO L854 garLoopResultBuilder]: At program point L714(lines 702 716) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (= (+ (- 2) ~M_E~0Int) 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= ~m_pc~0Int 0)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L854 garLoopResultBuilder]: At program point L715(lines 699 717) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (= (+ (- 2) ~M_E~0Int) 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= ~m_pc~0Int 0)) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse11 (<= 2 ~T1_E~0Int)) (.cse12 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L395-2(lines 395 399) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L898(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L898-2(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,440 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L854 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L854 garLoopResultBuilder]: At program point L125(lines 99 127) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,441 INFO L854 garLoopResultBuilder]: At program point L733(lines 721 735) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (= (+ (- 2) ~M_E~0Int) 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (= ~t1_i~0Int 1)) (.cse11 (<= ~m_pc~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse13 (<= 2 ~T1_E~0Int)) (.cse14 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse1 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L403(lines 403 407) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L854 garLoopResultBuilder]: At program point L734(lines 718 736) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (= (+ (- 2) ~M_E~0Int) 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (= ~t1_i~0Int 1)) (.cse11 (<= ~m_pc~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse13 (<= 2 ~T1_E~0Int)) (.cse14 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse1 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-11 07:42:28,441 INFO L854 garLoopResultBuilder]: At program point L403-2(lines 387 411) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L906(lines 906 910) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L337(lines 337 341) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L854 garLoopResultBuilder]: At program point L906-2(lines 890 914) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (= (+ (- 2) ~M_E~0Int) 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (= ~t1_i~0Int 1)) (.cse11 (<= ~m_pc~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse13 (<= 2 ~T1_E~0Int)) (.cse14 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0) .cse1 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L337-2(lines 336 349) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L858 garLoopResultBuilder]: For program point L866(lines 866 870) no Hoare annotation was computed. [2022-01-11 07:42:28,441 INFO L854 garLoopResultBuilder]: At program point L342-1(lines 333 350) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (<= 2 ~slow_clk_edge~0Int) (= 0 ~m_st~0Int) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L866-2(lines 865 888) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L854 garLoopResultBuilder]: At program point L499-2(lines 499 536) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L871-1(lines 865 888) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L861 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: true [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L876-1(lines 865 888) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L861 garLoopResultBuilder]: At program point L571(lines 562 573) the Hoare annotation is: true [2022-01-11 07:42:28,442 INFO L854 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,442 INFO L854 garLoopResultBuilder]: At program point L881-1(lines 862 889) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (not (= (+ (- 1) ~t1_pc~0Int) 0))) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (= (+ (- 2) ~M_E~0Int) 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (= ~t1_i~0Int 1)) (.cse11 (<= ~m_pc~0Int 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse13 (<= 2 ~T1_E~0Int)) (.cse14 (= 0 ~t1_st~0Int))) (or (and (= (+ (- 2) ~m_st~0Int) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0) .cse1 (= (+ (* (- 1) ~local~0Int) ~token~0Int) 0) (= 0 ~m_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L854 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L419(line 419) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L854 garLoopResultBuilder]: At program point L1007-2(lines 1007 1044) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L266-3(lines 266 272) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 309) no Hoare annotation was computed. [2022-01-11 07:42:28,442 INFO L854 garLoopResultBuilder]: At program point L1045(lines 992 1050) the Hoare annotation is: (= ~t1_i~0Int 1) [2022-01-11 07:42:28,442 INFO L858 garLoopResultBuilder]: For program point L1008(line 1008) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L44-3(lines 44 48) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L854 garLoopResultBuilder]: At program point L266-5(lines 262 276) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,443 INFO L854 garLoopResultBuilder]: At program point L311(lines 298 313) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 308) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L854 garLoopResultBuilder]: At program point L1060(lines 1051 1062) the Hoare annotation is: (= ~t1_i~0Int 1) [2022-01-11 07:42:28,443 INFO L854 garLoopResultBuilder]: At program point L813(lines 789 827) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse24 (not .cse14)) (.cse1 (= 2 ~m_st~0Int)) (.cse18 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse17 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse22 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse18) (let ((.cse19 (+ ~local~0Int 1))) (let ((.cse20 (+ ~token~0Int (* (div .cse19 4294967296) 4294967296)))) (and (<= .cse19 .cse20) .cse0 .cse21 .cse13 .cse14 .cse15 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 (< .cse20 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse24 .cse21 .cse17 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse0 .cse24 .cse21 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 .cse12 .cse18) (and .cse0 .cse21 .cse17 .cse13 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L44-5(lines 43 58) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L854 garLoopResultBuilder]: At program point L312(lines 295 314) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,443 INFO L854 garLoopResultBuilder]: At program point L828(lines 783 833) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse24 (not .cse14)) (.cse1 (= 2 ~m_st~0Int)) (.cse18 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse17 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse22 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse18) (let ((.cse19 (+ ~local~0Int 1))) (let ((.cse20 (+ ~token~0Int (* (div .cse19 4294967296) 4294967296)))) (and (<= .cse19 .cse20) .cse0 .cse21 .cse13 .cse14 .cse15 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 (< .cse20 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse24 .cse21 .cse17 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse0 .cse24 .cse21 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 .cse12 .cse18) (and .cse0 .cse21 .cse17 .cse13 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L790(line 790) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L49-3(lines 49 53) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L319-5(lines 318 331) no Hoare annotation was computed. [2022-01-11 07:42:28,443 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L854 garLoopResultBuilder]: At program point L742-1(lines 737 744) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse24 (not .cse14)) (.cse1 (= 2 ~m_st~0Int)) (.cse18 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse17 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse22 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse18) (let ((.cse19 (+ ~local~0Int 1))) (let ((.cse20 (+ ~token~0Int (* (div .cse19 4294967296) 4294967296)))) (and (<= .cse19 .cse20) .cse0 .cse21 .cse13 .cse14 .cse15 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 (< .cse20 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse24 .cse21 .cse17 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse0 .cse24 .cse21 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 .cse12 .cse18) (and .cse0 .cse21 .cse17 .cse13 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L767(lines 767 777) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L854 garLoopResultBuilder]: At program point L57-1(lines 40 59) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,444 INFO L854 garLoopResultBuilder]: At program point L324-3(lines 315 332) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L838-3(lines 838 842) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L854 garLoopResultBuilder]: At program point L779(lines 766 781) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse24 (not .cse14)) (.cse1 (= 2 ~m_st~0Int)) (.cse18 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse17 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse22 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse18) (let ((.cse19 (+ ~local~0Int 1))) (let ((.cse20 (+ ~token~0Int (* (div .cse19 4294967296) 4294967296)))) (and (<= .cse19 .cse20) .cse0 .cse21 .cse13 .cse14 .cse15 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 (< .cse20 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse24 .cse21 .cse17 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse0 .cse24 .cse21 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 .cse12 .cse18) (and .cse0 .cse21 .cse17 .cse13 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L771(lines 771 776) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L74-3(lines 74 83) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L838-5(lines 837 860) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L854 garLoopResultBuilder]: At program point L780(lines 763 782) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse24 (not .cse14)) (.cse1 (= 2 ~m_st~0Int)) (.cse18 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse17 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse22 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse18) (let ((.cse19 (+ ~local~0Int 1))) (let ((.cse20 (+ ~token~0Int (* (div .cse19 4294967296) 4294967296)))) (and (<= .cse19 .cse20) .cse0 .cse21 .cse13 .cse14 .cse15 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 (< .cse20 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse24 .cse21 .cse17 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse0 .cse24 .cse21 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 .cse12 .cse18) (and .cse0 .cse21 .cse17 .cse13 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 75 80) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L74-5(lines 73 97) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L843-3(lines 837 860) no Hoare annotation was computed. [2022-01-11 07:42:28,444 INFO L858 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L95-1(lines 73 97) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 84 93) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L848-3(lines 837 860) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L96-1(lines 70 98) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 206 260) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (= 0 ~m_st~0Int) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 214) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L853-3(lines 834 861) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0Int 1))) (let ((.cse24 (not .cse14)) (.cse1 (= 2 ~m_st~0Int)) (.cse18 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse17 (= ~local~0Int ~token~0Int)) (.cse13 (<= 2 ~t1_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse22 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse1 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse18) (let ((.cse19 (+ ~local~0Int 1))) (let ((.cse20 (+ ~token~0Int (* (div .cse19 4294967296) 4294967296)))) (and (<= .cse19 .cse20) .cse0 .cse21 .cse13 .cse14 .cse15 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 (< .cse20 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse24 .cse21 .cse17 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18) (and .cse0 .cse24 .cse21 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse23 .cse16 .cse9 .cse12 .cse18) (and .cse0 .cse21 .cse17 .cse13 .cse14 .cse15 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L799(lines 789 827) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L858 garLoopResultBuilder]: For program point L395-3(lines 395 399) no Hoare annotation was computed. [2022-01-11 07:42:28,445 INFO L854 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,446 INFO L854 garLoopResultBuilder]: At program point L256(lines 203 261) the Hoare annotation is: (and (not (= ~t1_pc~0Int 1)) (= 0 ~m_st~0Int) (= ~c_dr_pc~0Int 1) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (= 2 ~M_E~0Int) (<= ~m_pc~0Int 0) (<= 2 ~c_dr_st~0Int) (<= 2 ~T1_E~0Int) (= 0 ~t1_st~0Int)) [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L854 garLoopResultBuilder]: At program point L211(lines 206 260) the Hoare annotation is: false [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L703-9(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L395-5(lines 395 399) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 236) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L704-3(lines 704 709) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L703-11(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L854 garLoopResultBuilder]: At program point L648-1(lines 622 661) the Hoare annotation is: (let ((.cse4 (<= 2 ~t1_st~0Int)) (.cse2 (= 0 ~p_dw_st~0Int)) (.cse5 (= ~t1_pc~0Int 1)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse7 (= ~p_dw_pc~0Int 0)) (.cse8 (<= 2 ~E_1~0Int)) (.cse9 (<= 2 ~E_M~0Int)) (.cse10 (<= ~c_dr_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse12 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse13 (= ~t1_i~0Int 1)) (.cse15 (<= ~m_pc~0Int 0)) (.cse14 (<= 2 ~T1_E~0Int))) (or (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< .cse1 (+ ~local~0Int 2)) .cse14))) (and .cse2 .cse3 (= ~local~0Int ~token~0Int) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) (and .cse2 (not .cse5) .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 (= 0 ~t1_st~0Int)))) [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L103-3(lines 103 112) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2022-01-11 07:42:28,446 INFO L854 garLoopResultBuilder]: At program point L714-3(lines 702 716) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0Int 1))) (let ((.cse17 (not .cse11)) (.cse10 (= ~local~0Int ~token~0Int)) (.cse8 (<= ~m_pc~0Int 0)) (.cse12 (= 0 ~t1_st~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse15 (= 0 ~m_st~0Int)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= 2 ~m_st~0Int)) (.cse14 (<= 2 ~t1_st~0Int)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (= ~t1_i~0Int 1)) (.cse9 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse12) (and .cse0 .cse13 .cse10 .cse14 .cse11 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9) (and .cse0 .cse17 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse12) (and .cse0 .cse17 .cse13 .cse10 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse12) (let ((.cse18 (+ ~local~0Int 1))) (let ((.cse19 (+ ~token~0Int (* (div .cse18 4294967296) 4294967296)))) (and (<= .cse18 .cse19) .cse0 .cse13 .cse14 .cse11 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 (< .cse19 (+ ~local~0Int 2)) .cse9))) (and .cse0 .cse1 .cse14 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2022-01-11 07:42:28,446 INFO L854 garLoopResultBuilder]: At program point L656(lines 619 662) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse2 (= ~t1_pc~0Int 1)) (.cse1 (= 2 ~m_st~0Int)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse4 (= ~p_dw_pc~0Int 0)) (.cse5 (<= 2 ~E_1~0Int)) (.cse6 (<= 2 ~E_M~0Int)) (.cse7 (<= ~c_dr_pc~0Int 0)) (.cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= 2 ~T1_E~0Int)) (.cse11 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (<= 2 ~t1_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ~local~0Int ~token~0Int) .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 (not .cse2) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse8 .cse9 .cse10 .cse11))) [2022-01-11 07:42:28,446 INFO L858 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L854 garLoopResultBuilder]: At program point L627(lines 622 661) the Hoare annotation is: (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) (= 0 ~p_dw_st~0Int) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) (<= 2 ~t1_st~0Int) (= ~t1_pc~0Int 1) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0) (= ~p_dw_pc~0Int 0) (<= 2 ~E_1~0Int) (<= 2 ~E_M~0Int) (<= ~c_dr_pc~0Int 0) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1)) (= ~t1_i~0Int 1) (< .cse1 (+ ~local~0Int 2)) (<= 2 ~T1_E~0Int)))) [2022-01-11 07:42:28,447 INFO L854 garLoopResultBuilder]: At program point L678-1(lines 666 697) the Hoare annotation is: (let ((.cse1 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse16 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse9 .cse12) (let ((.cse17 (+ ~local~0Int 1))) (let ((.cse18 (+ ~token~0Int (* (div .cse17 4294967296) 4294967296)))) (and (<= .cse17 .cse18) .cse0 .cse13 (= ~t1_pc~0Int 1) .cse14 .cse19 .cse3 .cse4 .cse5 .cse6 .cse15 .cse16 .cse9 (< .cse18 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse13 (= ~local~0Int ~token~0Int) .cse14 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L104-1(lines 104 109) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L103-5(lines 102 126) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L854 garLoopResultBuilder]: At program point L715-3(lines 699 717) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0Int 1))) (let ((.cse6 (= 0 ~m_st~0Int)) (.cse13 (<= ~m_pc~0Int 0)) (.cse2 (= ~local~0Int ~token~0Int)) (.cse3 (<= 2 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse19 (not .cse4)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse18 (= 2 ~m_st~0Int)) (.cse5 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse7 (= ~p_dw_pc~0Int 0)) (.cse8 (<= 2 ~E_1~0Int)) (.cse9 (<= 2 ~E_M~0Int)) (.cse10 (<= ~c_dr_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse12 (= ~t1_i~0Int 1)) (.cse14 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse15 (<= 2 ~T1_E~0Int)) (.cse20 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ ~local~0Int 1))) (let ((.cse17 (+ ~token~0Int (* (div .cse16 4294967296) 4294967296)))) (and (<= .cse16 .cse17) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse17 (+ ~local~0Int 2)) .cse14 .cse15))) (and .cse0 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse19 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20) (and .cse0 .cse18 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse20) (and .cse0 .cse18 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15) (and .cse0 .cse19 .cse1 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse20)))) [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L703-3(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2022-01-11 07:42:28,447 INFO L854 garLoopResultBuilder]: At program point L692(lines 663 698) the Hoare annotation is: (let ((.cse1 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse17 (= ~t1_pc~0Int 1)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse15 (= ~local~0Int ~token~0Int) .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-01-11 07:42:28,447 INFO L858 garLoopResultBuilder]: For program point L679(line 679) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L854 garLoopResultBuilder]: At program point L671(lines 666 697) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= 2 ~m_st~0Int)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= ~c_dr_pc~0Int 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) .cse2 .cse3 .cse4 .cse5 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0) .cse6 (<= ~m_pc~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse7) (and .cse0 .cse1 (= ~local~0Int ~token~0Int) (= ~t1_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,448 INFO L854 garLoopResultBuilder]: At program point L124-1(lines 102 126) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point L114-1(lines 114 119) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point L113-3(lines 113 122) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L854 garLoopResultBuilder]: At program point L28-1(lines 23 30) the Hoare annotation is: false [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point L898-9(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point L704-1(lines 704 709) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point L703-5(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L854 garLoopResultBuilder]: At program point L600(lines 595 602) the Hoare annotation is: false [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point L703-6(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,448 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 99 127) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,448 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L854 garLoopResultBuilder]: At program point L28(lines 23 30) the Hoare annotation is: false [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L898-11(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L854 garLoopResultBuilder]: At program point L714-1(lines 702 716) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse2 (= ~t1_pc~0Int 1)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse4 (= ~p_dw_pc~0Int 0)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 (= ~local~0Int ~token~0Int) (<= 2 ~t1_st~0Int) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not .cse2) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t1_st~0Int)))) [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L704-2(lines 704 709) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L703-8(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L403-3(lines 403 407) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L722-9(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L854 garLoopResultBuilder]: At program point L715-1(lines 699 717) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse1 (= ~t1_pc~0Int 1)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse4 (= ~p_dw_pc~0Int 0)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse10 (<= 2 ~T1_E~0Int))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~t1_st~0Int)) (and .cse0 .cse2 (= ~local~0Int ~token~0Int) (<= 2 ~t1_st~0Int) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-01-11 07:42:28,449 INFO L854 garLoopResultBuilder]: At program point L714-2(lines 702 716) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= 2 ~m_st~0Int)) (.cse10 (= ~t1_pc~0Int 1)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= ~c_dr_pc~0Int 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~m_pc~0Int 0) .cse7) (let ((.cse8 (+ ~local~0Int 1))) (let ((.cse9 (+ ~token~0Int (* (div .cse8 4294967296) 4294967296)))) (and (<= .cse8 .cse9) .cse0 .cse1 .cse10 .cse3 .cse4 .cse5 .cse6 (< .cse9 (+ ~local~0Int 2)) .cse7))) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,449 INFO L854 garLoopResultBuilder]: At program point L403-5(lines 387 411) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L723-3(lines 723 728) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L722-11(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,449 INFO L858 garLoopResultBuilder]: For program point L898-3(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L854 garLoopResultBuilder]: At program point L715-2(lines 699 717) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse7 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= 2 ~m_st~0Int)) (.cse9 (= ~t1_pc~0Int 1)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= ~c_dr_pc~0Int 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse8 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~m_pc~0Int 0) .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (+ ~local~0Int 1))) (let ((.cse11 (+ ~token~0Int (* (div .cse10 4294967296) 4294967296)))) (and (<= .cse10 .cse11) .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 (< .cse11 (+ ~local~0Int 2)) .cse8))))) [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L337-3(lines 337 341) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L854 garLoopResultBuilder]: At program point L733-3(lines 721 735) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= ~local~0Int ~token~0Int)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse18 (= 0 ~m_st~0Int)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (not .cse17)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse1 (= 2 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse20 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse0 .cse15 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse20) (and .cse0 .cse15 .cse19 .cse16 .cse17 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse21 .cse15 .cse19 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20) (and .cse0 .cse21 .cse15 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse20)))) [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L898-5(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L898-6(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L337-5(lines 336 349) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L854 garLoopResultBuilder]: At program point L734-3(lines 718 736) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0Int 1))) (let ((.cse18 (= ~local~0Int ~token~0Int)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse17 (not .cse15)) (.cse1 (= 2 ~m_st~0Int)) (.cse20 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse14 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse17 .cse13 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20) (and .cse0 .cse13 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12 .cse20) (and .cse0 .cse13 .cse18 .cse14 .cse15 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse17 .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12 .cse20) (let ((.cse21 (+ ~local~0Int 1))) (let ((.cse22 (+ ~token~0Int (* (div .cse21 4294967296) 4294967296)))) (and (<= .cse21 .cse22) .cse0 .cse13 .cse14 .cse15 .cse19 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 (< .cse22 (+ ~local~0Int 2)) .cse12)))))) [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L722-3(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L898-8(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L854 garLoopResultBuilder]: At program point L342-3(lines 333 350) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L906-9(lines 906 910) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L723-1(lines 723 728) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L722-5(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L722-6(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,450 INFO L858 garLoopResultBuilder]: For program point L299-1(lines 299 309) no Hoare annotation was computed. [2022-01-11 07:42:28,451 INFO L854 garLoopResultBuilder]: At program point L906-11(lines 890 914) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,451 INFO L854 garLoopResultBuilder]: At program point L733-1(lines 721 735) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse8 (<= 2 ~t1_st~0Int)) (.cse1 (= ~t1_pc~0Int 1)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= ~c_dr_pc~0Int 0)) (.cse6 (= ~t1_i~0Int 1)) (.cse7 (<= 2 ~T1_E~0Int))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t1_st~0Int)) (and .cse0 (= ~local~0Int ~token~0Int) .cse8 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse8 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,451 INFO L858 garLoopResultBuilder]: For program point L723-2(lines 723 728) no Hoare annotation was computed. [2022-01-11 07:42:28,451 INFO L858 garLoopResultBuilder]: For program point L722-8(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,451 INFO L854 garLoopResultBuilder]: At program point L311-1(lines 298 313) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,451 INFO L858 garLoopResultBuilder]: For program point L303-1(lines 303 308) no Hoare annotation was computed. [2022-01-11 07:42:28,451 INFO L858 garLoopResultBuilder]: For program point L866-3(lines 866 870) no Hoare annotation was computed. [2022-01-11 07:42:28,451 INFO L854 garLoopResultBuilder]: At program point L734-1(lines 718 736) the Hoare annotation is: (let ((.cse0 (= 0 ~p_dw_st~0Int)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse9 (<= 2 ~t1_st~0Int)) (.cse1 (= ~t1_pc~0Int 1)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_M~0Int)) (.cse5 (<= ~c_dr_pc~0Int 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (= ~t1_i~0Int 1)) (.cse8 (<= 2 ~T1_E~0Int))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t1_st~0Int)) (and .cse0 (= ~local~0Int ~token~0Int) .cse9 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-01-11 07:42:28,451 INFO L854 garLoopResultBuilder]: At program point L733-2(lines 721 735) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse4 (= ~t1_pc~0Int 1)) (.cse2 (= 0 ~p_dw_st~0Int)) (.cse10 (= 2 ~m_st~0Int)) (.cse5 (= ~p_dw_pc~0Int 0)) (.cse6 (<= 2 ~E_1~0Int)) (.cse7 (<= ~c_dr_pc~0Int 0)) (.cse8 (= ~t1_i~0Int 1)) (.cse9 (<= 2 ~T1_E~0Int))) (or (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 (= 0 ~m_st~0Int) .cse5 .cse6 .cse7 .cse8 (< .cse1 (+ ~local~0Int 2)) .cse9))) (and .cse2 .cse3 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse10 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) .cse5 .cse6 .cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0) .cse8 (<= ~m_pc~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse9))) [2022-01-11 07:42:28,451 INFO L854 garLoopResultBuilder]: At program point L312-1(lines 295 314) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,451 INFO L858 garLoopResultBuilder]: For program point L866-5(lines 865 888) no Hoare annotation was computed. [2022-01-11 07:42:28,451 INFO L858 garLoopResultBuilder]: For program point L906-3(lines 906 910) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L734-2(lines 718 736) the Hoare annotation is: (let ((.cse1 (= 2 ~m_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse7 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse8 (= ~t1_pc~0Int 1)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_1~0Int)) (.cse4 (<= ~c_dr_pc~0Int 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) .cse2 .cse3 .cse4 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0) .cse5 (<= ~m_pc~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse6) (and .cse0 .cse7 .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6) (let ((.cse10 (+ ~local~0Int 1))) (let ((.cse11 (+ ~token~0Int (* (div .cse10 4294967296) 4294967296)))) (and (<= .cse10 .cse11) .cse0 .cse7 .cse8 (= 0 ~m_st~0Int) .cse2 .cse3 .cse4 .cse9 .cse5 (< .cse11 (+ ~local~0Int 2)) .cse6))))) [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 527) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L871-3(lines 865 888) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L906-5(lines 890 914) the Hoare annotation is: (let ((.cse7 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= ~t1_pc~0Int 1)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= ~c_dr_pc~0Int 0)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (<= 2 ~T1_E~0Int))) (or (and .cse0 (= ~local~0Int ~token~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (not .cse1) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse8 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse9 .cse5 .cse6 .cse7) (and .cse0 (<= 2 ~t1_st~0Int) .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6))) [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L906-6(lines 906 910) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L876-3(lines 865 888) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L923(lines 915 925) the Hoare annotation is: (let ((.cse7 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse1 (= ~t1_pc~0Int 1)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= ~p_dw_pc~0Int 0)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (<= ~c_dr_pc~0Int 0)) (.cse9 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse5 (= ~t1_i~0Int 1)) (.cse6 (<= 2 ~T1_E~0Int))) (or (and .cse0 (= ~local~0Int ~token~0Int) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (not .cse1) (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0) .cse8 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0) .cse9 .cse5 .cse6 .cse7) (and .cse0 (<= 2 ~t1_st~0Int) .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6))) [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L906-8(lines 890 914) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse4 (= ~t1_pc~0Int 1)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse2 (= 0 ~p_dw_st~0Int)) (.cse13 (= 2 ~m_st~0Int)) (.cse6 (= ~p_dw_pc~0Int 0)) (.cse7 (<= 2 ~E_1~0Int)) (.cse8 (<= ~c_dr_pc~0Int 0)) (.cse11 (= ~t1_i~0Int 1)) (.cse12 (<= 2 ~T1_E~0Int))) (or (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 (= 0 ~m_st~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse1 (+ ~local~0Int 2)) .cse12))) (and .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse13 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) .cse6 .cse7 .cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0) .cse11 (<= ~m_pc~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse12))) [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L357-2(lines 353 368) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L299-2(lines 299 309) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L881-3(lines 862 889) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L923-1(lines 915 925) the Hoare annotation is: (let ((.cse3 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse4 (= ~t1_pc~0Int 1)) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse10 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse2 (= 0 ~p_dw_st~0Int)) (.cse13 (= 2 ~m_st~0Int)) (.cse6 (= ~p_dw_pc~0Int 0)) (.cse7 (<= 2 ~E_1~0Int)) (.cse8 (<= ~c_dr_pc~0Int 0)) (.cse11 (= ~t1_i~0Int 1)) (.cse12 (<= 2 ~T1_E~0Int))) (or (let ((.cse0 (+ ~local~0Int 1))) (let ((.cse1 (+ ~token~0Int (* (div .cse0 4294967296) 4294967296)))) (and (<= .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 (= 0 ~m_st~0Int) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse1 (+ ~local~0Int 2)) .cse12))) (and .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse2 .cse13 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0) .cse6 .cse7 .cse8 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1)) (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0) .cse11 (<= ~m_pc~0Int 0) (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0) .cse12))) [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L74-6(lines 74 83) no Hoare annotation was computed. [2022-01-11 07:42:28,452 INFO L854 garLoopResultBuilder]: At program point L311-2(lines 298 313) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,452 INFO L858 garLoopResultBuilder]: For program point L303-2(lines 303 308) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L767-1(lines 767 777) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L74-8(lines 73 97) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L312-2(lines 295 314) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L779-1(lines 766 781) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L771-1(lines 771 776) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L95-2(lines 73 97) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L85-2(lines 85 90) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L84-5(lines 84 93) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L473(lines 473 478) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L780-1(lines 763 782) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L96-2(lines 70 98) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L480(lines 469 482) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L1026(lines 1026 1035) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L858 garLoopResultBuilder]: For program point L395-6(lines 395 399) no Hoare annotation was computed. [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L481(lines 465 483) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,453 INFO L854 garLoopResultBuilder]: At program point L932(lines 926 934) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L395-8(lines 395 399) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L703-12(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L767-2(lines 767 777) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L103-6(lines 103 112) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L704-4(lines 704 709) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L703-14(lines 703 712) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L854 garLoopResultBuilder]: At program point L779-2(lines 766 781) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L771-2(lines 771 776) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L104-2(lines 104 109) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L103-8(lines 102 126) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L854 garLoopResultBuilder]: At program point L714-4(lines 702 716) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0Int 1))) (let ((.cse16 (not .cse13)) (.cse8 (<= ~m_pc~0Int 0)) (.cse12 (<= 2 ~t1_st~0Int)) (.cse14 (= 0 ~m_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse1 (= 2 ~m_st~0Int)) (.cse11 (= ~local~0Int ~token~0Int)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (= ~t1_i~0Int 1)) (.cse9 (<= 2 ~T1_E~0Int)) (.cse17 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse12 .cse13 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse12 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse9) (and .cse0 .cse16 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse9 .cse17) (and .cse0 .cse16 .cse10 .cse11 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse17) (let ((.cse18 (+ ~local~0Int 1))) (let ((.cse19 (+ ~token~0Int (* (div .cse18 4294967296) 4294967296)))) (and (<= .cse18 .cse19) .cse0 .cse10 .cse12 .cse13 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 (< .cse19 (+ ~local~0Int 2)) .cse9))) (and .cse0 .cse10 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse9 .cse17)))) [2022-01-11 07:42:28,454 INFO L854 garLoopResultBuilder]: At program point L780-2(lines 763 782) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,454 INFO L854 garLoopResultBuilder]: At program point L124-2(lines 102 126) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L114-2(lines 114 119) no Hoare annotation was computed. [2022-01-11 07:42:28,454 INFO L858 garLoopResultBuilder]: For program point L113-5(lines 113 122) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L854 garLoopResultBuilder]: At program point L715-4(lines 699 717) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0Int 1))) (let ((.cse3 (<= 2 ~t1_st~0Int)) (.cse2 (= ~local~0Int ~token~0Int)) (.cse6 (= 0 ~m_st~0Int)) (.cse13 (<= ~m_pc~0Int 0)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse20 (not .cse4)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse18 (= 2 ~m_st~0Int)) (.cse5 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse7 (= ~p_dw_pc~0Int 0)) (.cse8 (<= 2 ~E_1~0Int)) (.cse9 (<= 2 ~E_M~0Int)) (.cse10 (<= ~c_dr_pc~0Int 0)) (.cse11 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse12 (= ~t1_i~0Int 1)) (.cse14 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse15 (<= 2 ~T1_E~0Int)) (.cse19 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ ~local~0Int 1))) (let ((.cse17 (+ ~token~0Int (* (div .cse16 4294967296) 4294967296)))) (and (<= .cse16 .cse17) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse17 (+ ~local~0Int 2)) .cse14 .cse15))) (and .cse0 .cse1 .cse18 .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse19) (and .cse0 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse18 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse0 .cse20 .cse1 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse19)))) [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L981(lines 981 986) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L854 garLoopResultBuilder]: At program point L125-2(lines 99 127) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L898-12(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L854 garLoopResultBuilder]: At program point L988(lines 977 990) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L403-6(lines 403 407) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L898-14(lines 898 902) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L854 garLoopResultBuilder]: At program point L989(lines 973 991) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,455 INFO L854 garLoopResultBuilder]: At program point L403-8(lines 387 411) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L722-12(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 377) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L723-4(lines 723 728) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L722-14(lines 722 731) no Hoare annotation was computed. [2022-01-11 07:42:28,455 INFO L858 garLoopResultBuilder]: For program point L373-2(lines 372 385) no Hoare annotation was computed. [2022-01-11 07:42:28,456 INFO L854 garLoopResultBuilder]: At program point L733-4(lines 721 735) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse16 (<= 2 ~t1_st~0Int)) (.cse19 (= ~local~0Int ~token~0Int)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse18 (= 0 ~m_st~0Int)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse21 (not .cse17)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse1 (= 2 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse12 (<= 2 ~T1_E~0Int)) (.cse20 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse0 .cse15 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse20) (and .cse0 .cse15 .cse19 .cse16 .cse17 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse21 .cse15 .cse19 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20) (and .cse0 .cse21 .cse15 .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12 .cse20)))) [2022-01-11 07:42:28,456 INFO L854 garLoopResultBuilder]: At program point L378-1(lines 369 386) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0Int 1))) (.cse1 (= 0 ~m_st~0Int)) (.cse2 (<= 2 ~E_1~0Int)) (.cse3 (<= 2 ~E_M~0Int)) (.cse4 (= 2 ~M_E~0Int)) (.cse5 (<= ~m_pc~0Int 0)) (.cse6 (<= 2 ~T1_E~0Int)) (.cse7 (= 0 ~t1_st~0Int))) (or (and .cse0 .cse1 (= ~c_dr_pc~0Int 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0Int 0) .cse4 .cse5 .cse6 .cse7))) [2022-01-11 07:42:28,456 INFO L854 garLoopResultBuilder]: At program point L734-4(lines 718 736) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0Int 1))) (let ((.cse18 (= ~local~0Int ~token~0Int)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse17 (not .cse15)) (.cse1 (= 2 ~m_st~0Int)) (.cse20 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse14 (<= 2 ~t1_st~0Int)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse16 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12) (and .cse0 .cse17 .cse13 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20) (and .cse0 .cse13 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12 .cse20) (and .cse0 .cse13 .cse18 .cse14 .cse15 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse17 .cse13 .cse1 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 .cse12 .cse20) (let ((.cse21 (+ ~local~0Int 1))) (let ((.cse22 (+ ~token~0Int (* (div .cse21 4294967296) 4294967296)))) (and (<= .cse21 .cse22) .cse0 .cse13 .cse14 .cse15 .cse19 .cse3 .cse4 .cse5 .cse6 .cse16 .cse9 (< .cse22 (+ ~local~0Int 2)) .cse12)))))) [2022-01-11 07:42:28,456 INFO L858 garLoopResultBuilder]: For program point L906-12(lines 906 910) no Hoare annotation was computed. [2022-01-11 07:42:28,456 INFO L854 garLoopResultBuilder]: At program point L906-14(lines 890 914) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,456 INFO L858 garLoopResultBuilder]: For program point L939(lines 939 943) no Hoare annotation was computed. [2022-01-11 07:42:28,456 INFO L858 garLoopResultBuilder]: For program point L939-2(lines 938 961) no Hoare annotation was computed. [2022-01-11 07:42:28,456 INFO L858 garLoopResultBuilder]: For program point L944-1(lines 938 961) no Hoare annotation was computed. [2022-01-11 07:42:28,456 INFO L858 garLoopResultBuilder]: For program point L949-1(lines 938 961) no Hoare annotation was computed. [2022-01-11 07:42:28,456 INFO L854 garLoopResultBuilder]: At program point L954-1(lines 935 962) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0Int 1))) (let ((.cse22 (not .cse17)) (.cse1 (= 2 ~m_st~0Int)) (.cse24 (= 0 ~t1_st~0Int)) (.cse0 (= 0 ~p_dw_st~0Int)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1Int| 0)) (.cse23 (= ~local~0Int ~token~0Int)) (.cse16 (<= 2 ~t1_st~0Int)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_~__retres1~4#1Int| 0)) (.cse19 (= 0 ~m_st~0Int)) (.cse3 (= ~p_dw_pc~0Int 0)) (.cse4 (<= 2 ~E_1~0Int)) (.cse5 (<= 2 ~E_M~0Int)) (.cse6 (<= ~c_dr_pc~0Int 0)) (.cse20 (<= |ULTIMATE.start_ULTIMATE.start_is_transmit1_triggered_#res#1Int| 0)) (.cse7 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 1))) (.cse21 (< 0 (+ |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp___0~4#1Int| 1))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_activate_threads2_~tmp~6#1Int| 0)) (.cse9 (= ~t1_i~0Int 1)) (.cse10 (<= ~m_pc~0Int 0)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_is_master_triggered_#res#1Int| 0)) (.cse12 (<= 2 ~T1_E~0Int))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ ~local~0Int 1))) (let ((.cse14 (+ ~token~0Int (* (div .cse13 4294967296) 4294967296)))) (and (<= .cse13 .cse14) .cse0 .cse15 .cse16 .cse17 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 (< .cse14 (+ ~local~0Int 2)) .cse12))) (and .cse0 .cse22 .cse15 .cse23 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse23 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12) (and .cse0 .cse22 .cse15 .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse9 .cse12 .cse24) (and .cse0 .cse15 .cse23 .cse16 .cse17 .cse18 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-01-11 07:42:28,459 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:42:28,460 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 07:42:28,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:42:28 BasicIcfg [2022-01-11 07:42:28,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 07:42:28,586 INFO L158 Benchmark]: Toolchain (without parser) took 25644.66ms. Allocated memory was 233.8MB in the beginning and 901.8MB in the end (delta: 667.9MB). Free memory was 182.9MB in the beginning and 431.4MB in the end (delta: -248.5MB). Peak memory consumption was 522.5MB. Max. memory is 8.0GB. [2022-01-11 07:42:28,586 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 233.8MB. Free memory was 199.5MB in the beginning and 199.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 07:42:28,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.84ms. Allocated memory is still 233.8MB. Free memory was 182.6MB in the beginning and 203.2MB in the end (delta: -20.6MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-01-11 07:42:28,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.48ms. Allocated memory is still 233.8MB. Free memory was 203.2MB in the beginning and 199.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 07:42:28,587 INFO L158 Benchmark]: Boogie Preprocessor took 43.12ms. Allocated memory is still 233.8MB. Free memory was 199.0MB in the beginning and 196.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 07:42:28,587 INFO L158 Benchmark]: RCFGBuilder took 618.99ms. Allocated memory is still 233.8MB. Free memory was 195.9MB in the beginning and 164.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-01-11 07:42:28,588 INFO L158 Benchmark]: IcfgTransformer took 113.76ms. Allocated memory is still 233.8MB. Free memory was 164.4MB in the beginning and 148.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-11 07:42:28,590 INFO L158 Benchmark]: TraceAbstraction took 24499.84ms. Allocated memory was 233.8MB in the beginning and 901.8MB in the end (delta: 667.9MB). Free memory was 148.2MB in the beginning and 431.4MB in the end (delta: -283.3MB). Peak memory consumption was 488.5MB. Max. memory is 8.0GB. [2022-01-11 07:42:28,594 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 233.8MB. Free memory was 199.5MB in the beginning and 199.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.84ms. Allocated memory is still 233.8MB. Free memory was 182.6MB in the beginning and 203.2MB in the end (delta: -20.6MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.48ms. Allocated memory is still 233.8MB. Free memory was 203.2MB in the beginning and 199.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.12ms. Allocated memory is still 233.8MB. Free memory was 199.0MB in the beginning and 196.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 618.99ms. Allocated memory is still 233.8MB. Free memory was 195.9MB in the beginning and 164.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * IcfgTransformer took 113.76ms. Allocated memory is still 233.8MB. Free memory was 164.4MB in the beginning and 148.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 24499.84ms. Allocated memory was 233.8MB in the beginning and 901.8MB in the end (delta: 667.9MB). Free memory was 148.2MB in the beginning and 431.4MB in the end (delta: -283.3MB). Peak memory consumption was 488.5MB. 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: 599]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 295 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6165 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6165 mSDsluCounter, 14428 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5678 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 8750 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7099occurred in iteration=17, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 540 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 106 LocationsWithAnnotation, 106 PreInvPairs, 2621 NumberOfFragments, 14800 HoareAnnotationTreeSize, 106 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 106 FomulaSimplificationsInter, 129178 FormulaSimplificationTreeSizeReductionInter, 14.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1530 ConstructedInterpolants, 0 QuantifiedInterpolants, 3242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 267/267 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: 702]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 699]: 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))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((~bvule32(2bv32, E_1) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((~bvule32(2bv32, E_1) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: (((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: ((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 718]: 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))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((~bvule32(__retres1, 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 977]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvule32(2bv32, q_write_ev)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && 0bv65 == ~bvadd16(~zero_extendFrom32To65(q_write_ev), ~sign_extendFrom8To32(~bvmul64(~zero_extendFrom32To64(q_read_ev), 18446744073709551615bv64)))) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 203]: 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)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 622]: 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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 834]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 766]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 1bv32 == t1_i - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 915]: 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))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 926]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 702]: 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))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_1) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((~bvule32(2bv32, E_1) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 890]: 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))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33)) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 915]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: (((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~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)))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: 1bv32 == t1_i - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((~bvule32(2bv32, E_M) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: ((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((~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)))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule32(2bv32, E_M) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && local == token) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || (((((((((((((((((((~bvule32(2bv32, E_M) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp___0), 1bv33))) && ~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(tmp___0, 0bv32)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && local == token) && ~bvule32(2bv32, t1_st)) && t1_pc == 1bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && ~bvule32(\result, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 834]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(m_st))) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || ((((((((((((~bvule32(2bv32, E_M) && !(0bv33 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(t1_pc)))) && 0bv33 == ~bvadd16(8589934590bv33, ~zero_extendFrom32To33(M_E))) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 0bv65 == ~bvadd16(~sign_extendFrom8To32(~bvmul64(18446744073709551615bv64, ~zero_extendFrom32To64(local))), ~zero_extendFrom32To65(token))) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && c_dr_pc == 1bv32) && ~bvule32(m_pc, 0bv32)) || ((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && ~bvule32(m_pc, 0bv32)) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((((((~bvule32(__retres1, 0bv32) && ~bvule32(2bv32, E_1)) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && 2bv32 == m_st) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) || (((((((((((~bvult64(0bv33, ~bvadd16(~zero_extendFrom32To33(tmp), 1bv33)) && ~bvule32(2bv32, E_1)) && ~bvule32(tmp, 0bv32)) && \result == 0bv32) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && __retres1 == 0bv32) && 2bv32 == m_st) && 1bv32 == t1_i) && ~bvule32(m_pc, 0bv32)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32))) || ((((((((((~bvule34(~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)), ~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32))) && ~bvult64(~bvadd16(~zero_extendFrom32To34(token), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 1bv33)[32:32] ++ 0bv32)), ~zero_extendFrom33To34(~bvadd16(~zero_extendFrom32To33(local), 2bv33)))) && ~bvule32(__retres1, 0bv32)) && ~bvule32(2bv32, E_1)) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && t1_pc == 1bv32) && 1bv32 == t1_i) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((~bvule32(2bv32, E_M) && !(t1_pc == 1bv32)) && t1_st == 0bv32) && ~bvule32(2bv32, E_1)) && 2bv32 == M_E) && 0bv32 == m_st) && ~bvule32(2bv32, T1_E)) && p_dw_st == 0bv32) && ~bvule32(m_pc, 0bv32)) && ~bvule32(2bv32, slow_clk_edge)) && p_dw_pc == 0bv32) && ~bvule32(c_dr_pc, 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-11 07:42:28,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...