/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:45:17,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:45:17,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:45:17,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:45:17,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:45:17,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:45:17,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:45:17,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:45:17,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:45:17,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:45:17,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:45:17,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:45:17,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:45:17,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:45:17,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:45:17,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:45:17,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:45:17,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:45:17,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:45:17,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:45:17,635 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:45:17,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:45:17,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:45:17,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:45:17,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:45:17,850 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:45:17,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2025-04-13 23:45:19,129 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4289b84/709945b725844356980e50ed1dea93be/FLAG476cba8e4 [2025-04-13 23:45:19,390 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:45:19,393 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2025-04-13 23:45:19,408 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4289b84/709945b725844356980e50ed1dea93be/FLAG476cba8e4 [2025-04-13 23:45:20,129 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4289b84/709945b725844356980e50ed1dea93be [2025-04-13 23:45:20,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:45:20,132 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:45:20,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:45:20,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:45:20,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:45:20,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a31250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20, skipping insertion in model container [2025-04-13 23:45:20,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:45:20,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2025-04-13 23:45:20,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2025-04-13 23:45:20,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:45:20,550 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:45:20,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2025-04-13 23:45:20,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2025-04-13 23:45:20,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:45:20,677 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:45:20,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20 WrapperNode [2025-04-13 23:45:20,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:45:20,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:45:20,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:45:20,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:45:20,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,734 INFO L138 Inliner]: procedures = 274, calls = 92, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 231 [2025-04-13 23:45:20,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:45:20,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:45:20,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:45:20,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:45:20,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,771 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-04-13 23:45:20,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:45:20,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:45:20,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:45:20,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:45:20,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (1/1) ... [2025-04-13 23:45:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:45:20,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:45:20,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:45:20,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:45:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:45:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:45:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 23:45:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:45:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:45:20,848 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:45:20,973 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:45:20,974 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:45:21,272 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:45:21,273 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:45:21,273 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:45:21,691 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:45:21,720 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:45:21,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:45:21 BoogieIcfgContainer [2025-04-13 23:45:21,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:45:21,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:45:21,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:45:21,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:45:21,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:45:20" (1/3) ... [2025-04-13 23:45:21,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449f6fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:45:21, skipping insertion in model container [2025-04-13 23:45:21,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:45:20" (2/3) ... [2025-04-13 23:45:21,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449f6fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:45:21, skipping insertion in model container [2025-04-13 23:45:21,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:45:21" (3/3) ... [2025-04-13 23:45:21,728 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-04-13 23:45:21,738 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:45:21,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 24 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 23:45:21,739 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:45:21,828 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:45:21,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 29 transitions, 72 flow [2025-04-13 23:45:21,879 INFO L116 PetriNetUnfolderBase]: 5/27 cut-off events. [2025-04-13 23:45:21,881 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:45:21,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 5/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-13 23:45:21,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 29 transitions, 72 flow [2025-04-13 23:45:21,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 59 flow [2025-04-13 23:45:21,894 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:45:21,901 INFO L340 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3eb8dea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:45:21,901 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:45:21,912 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:45:21,913 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-13 23:45:21,913 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:45:21,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:21,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-13 23:45:21,914 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:45:21,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 564, now seen corresponding path program 1 times [2025-04-13 23:45:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:21,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335263582] [2025-04-13 23:45:21,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:21,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 23:45:21,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 23:45:21,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:21,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:22,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:22,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335263582] [2025-04-13 23:45:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335263582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:22,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 23:45:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323983584] [2025-04-13 23:45:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:22,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:45:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:22,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:45:22,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:45:22,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 23:45:22,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:22,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:22,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 23:45:22,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:22,182 INFO L116 PetriNetUnfolderBase]: 239/374 cut-off events. [2025-04-13 23:45:22,182 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-13 23:45:22,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 374 events. 239/374 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1114 event pairs, 158 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 722. Up to 375 conditions per place. [2025-04-13 23:45:22,186 INFO L140 encePairwiseOnDemand]: 28/29 looper letters, 20 selfloop transitions, 0 changer transitions 4/24 dead transitions. [2025-04-13 23:45:22,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 105 flow [2025-04-13 23:45:22,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:45:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:45:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2025-04-13 23:45:22,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:45:22,196 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 59 flow. Second operand 2 states and 29 transitions. [2025-04-13 23:45:22,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 105 flow [2025-04-13 23:45:22,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 23:45:22,201 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 44 flow [2025-04-13 23:45:22,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-04-13 23:45:22,206 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-04-13 23:45:22,206 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 44 flow [2025-04-13 23:45:22,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:22,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:22,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:22,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:45:22,207 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:45:22,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1430524034, now seen corresponding path program 1 times [2025-04-13 23:45:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:22,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383643798] [2025-04-13 23:45:22,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:22,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:45:22,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:45:22,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:22,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:22,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:22,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383643798] [2025-04-13 23:45:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383643798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:22,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:22,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:45:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531177567] [2025-04-13 23:45:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:22,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:45:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:22,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:45:22,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:45:22,568 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 23:45:22,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:22,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:22,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 23:45:22,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:22,711 INFO L116 PetriNetUnfolderBase]: 195/323 cut-off events. [2025-04-13 23:45:22,711 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:45:22,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 323 events. 195/323 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 964 event pairs, 85 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 669. Up to 178 conditions per place. [2025-04-13 23:45:22,713 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 25 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2025-04-13 23:45:22,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 32 transitions, 135 flow [2025-04-13 23:45:22,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:45:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:45:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-13 23:45:22,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2025-04-13 23:45:22,715 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 44 flow. Second operand 3 states and 40 transitions. [2025-04-13 23:45:22,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 32 transitions, 135 flow [2025-04-13 23:45:22,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 32 transitions, 135 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:45:22,717 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 56 flow [2025-04-13 23:45:22,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-04-13 23:45:22,717 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-04-13 23:45:22,717 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 56 flow [2025-04-13 23:45:22,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:22,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:22,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:22,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:45:22,718 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:45:22,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1774847312, now seen corresponding path program 1 times [2025-04-13 23:45:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:22,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130512671] [2025-04-13 23:45:22,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:22,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:45:22,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:45:22,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:22,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:45:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:22,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130512671] [2025-04-13 23:45:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130512671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:45:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:45:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:45:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626472236] [2025-04-13 23:45:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:45:22,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:45:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:22,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:45:22,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:45:22,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 23:45:22,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:22,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:22,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 23:45:22,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:23,046 INFO L116 PetriNetUnfolderBase]: 121/225 cut-off events. [2025-04-13 23:45:23,046 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-13 23:45:23,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 225 events. 121/225 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs, 33 based on Foata normal form. 14/239 useless extension candidates. Maximal degree in co-relation 502. Up to 151 conditions per place. [2025-04-13 23:45:23,048 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-13 23:45:23,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 127 flow [2025-04-13 23:45:23,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:45:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:45:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 23:45:23,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2025-04-13 23:45:23,050 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 56 flow. Second operand 3 states and 34 transitions. [2025-04-13 23:45:23,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 127 flow [2025-04-13 23:45:23,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 125 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:45:23,052 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 60 flow [2025-04-13 23:45:23,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2025-04-13 23:45:23,053 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2025-04-13 23:45:23,053 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 60 flow [2025-04-13 23:45:23,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:23,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:23,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:23,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:45:23,053 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:45:23,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1351231567, now seen corresponding path program 1 times [2025-04-13 23:45:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:23,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761652353] [2025-04-13 23:45:23,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:23,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:45:23,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:45:23,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:23,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:23,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761652353] [2025-04-13 23:45:23,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761652353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:45:23,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240329871] [2025-04-13 23:45:23,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:45:23,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:45:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:45:23,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:45:23,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:45:23,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:45:23,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:45:23,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:45:23,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:23,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:45:23,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:45:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:23,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:45:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:23,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240329871] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:45:23,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:45:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 23:45:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876614406] [2025-04-13 23:45:23,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:45:23,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:45:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:23,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:45:23,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:45:23,369 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 23:45:23,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:23,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:23,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 23:45:23,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:23,517 INFO L116 PetriNetUnfolderBase]: 105/197 cut-off events. [2025-04-13 23:45:23,517 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:45:23,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 197 events. 105/197 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 493 event pairs, 61 based on Foata normal form. 24/221 useless extension candidates. Maximal degree in co-relation 479. Up to 150 conditions per place. [2025-04-13 23:45:23,519 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2025-04-13 23:45:23,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 190 flow [2025-04-13 23:45:23,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:45:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:45:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-04-13 23:45:23,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3160919540229885 [2025-04-13 23:45:23,521 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 60 flow. Second operand 6 states and 55 transitions. [2025-04-13 23:45:23,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 190 flow [2025-04-13 23:45:23,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:45:23,522 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 97 flow [2025-04-13 23:45:23,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2025-04-13 23:45:23,523 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-04-13 23:45:23,523 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 97 flow [2025-04-13 23:45:23,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:23,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:23,523 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:23,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:45:23,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:45:23,724 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:45:23,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2099409556, now seen corresponding path program 2 times [2025-04-13 23:45:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:23,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383624584] [2025-04-13 23:45:23,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:45:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:23,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:45:23,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:45:23,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:45:23,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:23,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:23,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383624584] [2025-04-13 23:45:23,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383624584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:45:23,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133659201] [2025-04-13 23:45:23,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:45:23,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:45:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:45:23,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:45:23,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:45:24,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 23:45:24,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:45:24,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:45:24,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:24,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:45:24,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:45:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:24,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:45:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:24,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133659201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:45:24,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:45:24,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:45:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542489080] [2025-04-13 23:45:24,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:45:24,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:45:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:24,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:45:24,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:45:24,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 23:45:24,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 97 flow. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:24,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:24,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 23:45:24,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:24,447 INFO L116 PetriNetUnfolderBase]: 141/269 cut-off events. [2025-04-13 23:45:24,447 INFO L117 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2025-04-13 23:45:24,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 269 events. 141/269 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 691 event pairs, 61 based on Foata normal form. 36/305 useless extension candidates. Maximal degree in co-relation 776. Up to 150 conditions per place. [2025-04-13 23:45:24,449 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 58 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2025-04-13 23:45:24,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 371 flow [2025-04-13 23:45:24,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:45:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 23:45:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2025-04-13 23:45:24,451 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28448275862068967 [2025-04-13 23:45:24,451 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 97 flow. Second operand 12 states and 99 transitions. [2025-04-13 23:45:24,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 371 flow [2025-04-13 23:45:24,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 355 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 23:45:24,453 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 165 flow [2025-04-13 23:45:24,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2025-04-13 23:45:24,456 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2025-04-13 23:45:24,457 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 165 flow [2025-04-13 23:45:24,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:24,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:24,457 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:24,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:45:24,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:45:24,661 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:45:24,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 763866572, now seen corresponding path program 3 times [2025-04-13 23:45:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:24,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880242711] [2025-04-13 23:45:24,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:45:24,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:24,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-04-13 23:45:24,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:45:24,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:45:24,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:25,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:25,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880242711] [2025-04-13 23:45:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880242711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:45:25,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857891814] [2025-04-13 23:45:25,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:45:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:45:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:45:25,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:45:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:45:25,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-04-13 23:45:26,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:45:26,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:45:26,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:26,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:45:26,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:45:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:26,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:45:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857891814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:45:26,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:45:26,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-04-13 23:45:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223380092] [2025-04-13 23:45:26,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:45:26,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:45:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:45:26,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:45:26,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:45:26,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 23:45:26,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 165 flow. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:26,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:45:26,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 23:45:26,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:27,255 INFO L116 PetriNetUnfolderBase]: 201/389 cut-off events. [2025-04-13 23:45:27,255 INFO L117 PetriNetUnfolderBase]: For 2977/2977 co-relation queries the response was YES. [2025-04-13 23:45:27,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 389 events. 201/389 cut-off events. For 2977/2977 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1021 event pairs, 61 based on Foata normal form. 60/449 useless extension candidates. Maximal degree in co-relation 1317. Up to 150 conditions per place. [2025-04-13 23:45:27,258 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 98 selfloop transitions, 21 changer transitions 0/119 dead transitions. [2025-04-13 23:45:27,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 683 flow [2025-04-13 23:45:27,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:45:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 23:45:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 173 transitions. [2025-04-13 23:45:27,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2711598746081505 [2025-04-13 23:45:27,261 INFO L175 Difference]: Start difference. First operand has 49 places, 29 transitions, 165 flow. Second operand 22 states and 173 transitions. [2025-04-13 23:45:27,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 683 flow [2025-04-13 23:45:27,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 615 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-04-13 23:45:27,269 INFO L231 Difference]: Finished difference. Result has 75 places, 39 transitions, 261 flow [2025-04-13 23:45:27,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=261, PETRI_PLACES=75, PETRI_TRANSITIONS=39} [2025-04-13 23:45:27,270 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2025-04-13 23:45:27,270 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 39 transitions, 261 flow [2025-04-13 23:45:27,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:45:27,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:45:27,270 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:45:27,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:45:27,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:45:27,471 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:45:27,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:45:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1430655380, now seen corresponding path program 4 times [2025-04-13 23:45:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:45:27,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229626649] [2025-04-13 23:45:27,471 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:45:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:45:27,513 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:45:29,427 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:45:29,427 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:45:29,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:46,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:45:46,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229626649] [2025-04-13 23:45:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229626649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:45:46,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015699414] [2025-04-13 23:45:46,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:45:46,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:45:46,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:45:46,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:45:46,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:45:46,729 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 23:45:46,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:45:46,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:45:46,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:45:46,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 152 conjuncts are in the unsatisfiable core [2025-04-13 23:45:46,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:45:46,916 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-04-13 23:45:47,038 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 30 [2025-04-13 23:45:47,082 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 30 [2025-04-13 23:45:47,133 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:45:47,140 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,140 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 41 [2025-04-13 23:45:47,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,201 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,259 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,318 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,382 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,436 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,446 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,506 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,507 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,636 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,689 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,752 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,807 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,807 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,864 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,924 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,924 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:47,984 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:47,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:47,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 23:45:48,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:45:48,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-13 23:45:48,013 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:48,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 44 [2025-04-13 23:45:48,034 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:48,035 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 57 [2025-04-13 23:45:48,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:45:48,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-13 23:45:48,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:45:48,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:45:48,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:45:48,239 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:48,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2025-04-13 23:45:48,250 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:48,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 60 [2025-04-13 23:45:48,424 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:48,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 61 [2025-04-13 23:45:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:45:48,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:45:48,652 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:45:48,652 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 68 [2025-04-13 23:45:48,992 INFO L325 Elim1Store]: treesize reduction 23, result has 66.7 percent of original size [2025-04-13 23:45:48,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 509 treesize of output 337 [2025-04-13 23:45:49,180 INFO L325 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2025-04-13 23:45:49,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 523 treesize of output 1 [2025-04-13 23:45:49,346 INFO L325 Elim1Store]: treesize reduction 8, result has 88.4 percent of original size [2025-04-13 23:45:49,347 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 536 treesize of output 359 [2025-04-13 23:45:52,277 INFO L325 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2025-04-13 23:45:52,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 7538 treesize of output 4790 [2025-04-13 23:46:35,592 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int#3| |c_~#queue~0.base|))) (let ((.cse14 (select |c_#memory_int#2| |c_~#stored_elements~0.base|)) (.cse15 (+ |c_~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (.cse8 (+ |c_~#queue~0.offset| 80)) (.cse773 (select .cse16 (+ 76 |c_~#queue~0.offset|))) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse336 (select .cse16 .cse4)) (.cse55 (= .cse773 0)) (.cse22 (select .cse16 .cse8)) (.cse13 (+ |c_~#stored_elements~0.offset| 4)) (.cse2 (+ |c_~#stored_elements~0.offset| 8)) (.cse229 (store .cse14 .cse15 20)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1))) (let ((.cse150 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_234 Int)) (let ((.cse780 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_234))) (or (not (= (select .cse780 .cse2) 1)) (= (select .cse780 .cse13) 0) (= (select .cse780 |c_~#stored_elements~0.offset|) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_235 Int)) (let ((.cse781 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_235))) (or (= 0 (select .cse781 .cse13)) (not (= (select .cse781 .cse2) 0)) (= (select .cse781 |c_~#stored_elements~0.offset|) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (.cse98 (store .cse14 .cse15 19)) (.cse279 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (forall ((v_prenex_229 Int)) (let ((.cse778 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_229))) (or (not (= (select .cse778 .cse2) 1)) (= (select .cse778 |c_~#stored_elements~0.offset|) 0) (= (select .cse778 .cse13) 1)))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_242 Int)) (let ((.cse779 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_242))) (or (= (select .cse779 .cse13) 1) (not (= (select .cse779 .cse2) 0)) (= (select .cse779 |c_~#stored_elements~0.offset|) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (.cse309 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_211 Int)) (let ((.cse775 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_211))) (let ((.cse774 (select .cse775 |c_~#stored_elements~0.offset|))) (or (= .cse774 1) (= .cse774 0) (= (select .cse775 .cse13) 0) (not (= (select .cse775 .cse2) 1)))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_236 Int)) (let ((.cse776 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_236))) (let ((.cse777 (select .cse776 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse776 .cse2) 0)) (= (select .cse776 .cse13) 0) (= .cse777 0) (= .cse777 1))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (.cse111 (not (= .cse22 20))) (.cse280 (not .cse55)) (.cse18 (= 21 .cse22)) (.cse19 (= 23 .cse22)) (.cse20 (= 22 .cse22)) (.cse74 (not (= .cse336 20))) (.cse71 (+ |c_~#queue~0.offset| 4)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse17 (+ (* .cse336 4) |c_~#queue~0.offset|)) (.cse36 (< (+ .cse773 2147483648) 0)) (.cse37 (not (= 19 .cse22))) (.cse38 (< 2147483647 .cse773))) (and (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_166 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_10 Int)) (let ((.cse3 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse9 (select .cse3 .cse8))) (let ((.cse1 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_166)) (.cse6 (store .cse3 .cse4 23)) (.cse10 (* .cse9 4))) (let ((.cse11 (select (store (store .cse6 .cse7 v_DerPreprocessor_4) .cse8 (+ .cse9 1)) (+ .cse10 |c_~#queue~0.offset| 4))) (.cse5 (select .cse1 .cse13)) (.cse0 (select (store (store .cse3 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse10 |c_~#queue~0.offset|)))) (or (< 2147483647 .cse0) (not (= (select .cse1 .cse2) 0)) (not (= 21 (select .cse3 .cse4))) (= .cse5 1) (= (select .cse1 |c_~#stored_elements~0.offset|) 0) (= (select (store (store .cse6 .cse7 (+ (- 1) v_DerPreprocessor_4)) .cse8 (+ 2 .cse9)) (+ .cse10 |c_~#queue~0.offset| 8)) 0) (= .cse0 0) (< (+ .cse11 2147483648) 0) (< 2147483647 .cse11) (= .cse5 0) (< (+ .cse0 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse18 .cse19 .cse20) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse33 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse21 (select .cse33 .cse4))) (let ((.cse32 (select .cse33 .cse7)) (.cse35 (+ .cse21 1))) (let ((.cse23 (+ 2 .cse21)) (.cse24 (store (store .cse33 .cse7 (+ .cse32 1)) .cse4 .cse35)) (.cse25 (+ |c_~#queue~0.offset| (* .cse21 4) 4))) (or (= .cse21 20) (= .cse22 .cse23) (= 21 .cse21) (= 20 (select (store .cse24 .cse25 v_ArrVal_924) .cse4)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_244 Int)) (let ((.cse27 (select (store .cse24 .cse25 v_DerPreprocessor_11) .cse8)) (.cse31 (store .cse33 .cse25 v_DerPreprocessor_11))) (let ((.cse26 (store .cse31 .cse4 .cse23)) (.cse28 (* 4 .cse27))) (let ((.cse30 (select (store (store .cse31 .cse7 (+ 2 .cse32)) .cse4 .cse23) (+ |c_~#queue~0.offset| .cse28))) (.cse29 (select (store (store .cse26 .cse7 v_prenex_244) .cse8 (+ .cse27 1)) (+ |c_~#queue~0.offset| .cse28 4)))) (or (= (select (store (store .cse26 .cse7 (+ (- 1) v_prenex_244)) .cse8 (+ 2 .cse27)) (+ |c_~#queue~0.offset| 8 .cse28)) 0) (< (+ .cse29 2147483648) 0) (< (+ .cse30 2147483648) 0) (= .cse30 0) (= .cse29 0) (< 2147483647 .cse30) (< 2147483647 .cse29)))))) (= .cse21 .cse22) (forall ((v_prenex_233 Int)) (let ((.cse34 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_233))) (or (= (select .cse34 .cse13) 0) (= (select .cse34 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse34 .cse2) 0))))) (= .cse35 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse36 .cse37 .cse38 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_199 Int)) (let ((.cse39 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_199))) (let ((.cse40 (select .cse39 |c_~#stored_elements~0.offset|))) (or (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (not (= (select .cse39 .cse2) 0)) (= .cse40 1) (= .cse40 0) (= (select .cse39 .cse13) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or .cse18 .cse19 (forall ((v_ArrVal_919 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_10 Int)) (let ((.cse41 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse44 (select .cse41 .cse8))) (let ((.cse42 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_ArrVal_919)) (.cse43 (store .cse41 .cse4 23)) (.cse45 (* .cse44 4))) (let ((.cse47 (select (store (store .cse43 .cse7 v_DerPreprocessor_4) .cse8 (+ .cse44 1)) (+ .cse45 |c_~#queue~0.offset| 4))) (.cse46 (select .cse42 .cse13))) (or (not (= 21 (select .cse41 .cse4))) (= (select .cse42 |c_~#stored_elements~0.offset|) 1) (not (= 0 (select .cse42 .cse2))) (= (select (store (store .cse43 .cse7 (+ (- 1) v_DerPreprocessor_4)) .cse8 (+ 2 .cse44)) (+ .cse45 |c_~#queue~0.offset| 8)) 0) (= .cse46 0) (not (= (select (store (store .cse41 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse45 |c_~#queue~0.offset|)) 0)) (< (+ .cse47 2147483648) 0) (< 2147483647 .cse47) (= .cse46 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse20) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse51 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse50 (select .cse51 .cse4))) (or (forall ((v_prenex_46 Int)) (let ((.cse48 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_46))) (let ((.cse49 (select .cse48 .cse13))) (or (= (select .cse48 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse48 .cse2) 0)) (= .cse49 1) (= .cse49 0))))) (= .cse50 20) (not (= 20 (select (store (store (store .cse51 .cse7 (+ (select .cse51 .cse7) 1)) .cse4 (+ .cse50 1)) (+ |c_~#queue~0.offset| (* .cse50 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse54 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse52 (select .cse54 .cse4))) (or (= .cse52 20) (forall ((v_prenex_77 Int)) (let ((.cse53 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_77))) (or (= (select .cse53 .cse13) 1) (not (= (select .cse53 .cse2) 0)) (= 0 (select .cse53 |c_~#stored_elements~0.offset|))))) (not (= 20 (select (store (store (store .cse54 .cse7 (+ (select .cse54 .cse7) 1)) .cse4 (+ .cse52 1)) (+ |c_~#queue~0.offset| (* .cse52 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse55 .cse36 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_190 Int)) (let ((.cse56 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_190))) (or (= (select .cse56 .cse13) 0) (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse56 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse56 .cse2) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse37 .cse38) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse65 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse57 (select .cse65 .cse4))) (let ((.cse61 (select .cse65 .cse7)) (.cse69 (+ .cse57 1))) (let ((.cse58 (+ 2 .cse57)) (.cse67 (store (store .cse65 .cse7 (+ .cse61 1)) .cse4 .cse69)) (.cse66 (+ |c_~#queue~0.offset| (* .cse57 4) 4))) (or (= .cse57 20) (= .cse22 .cse58) (= 21 .cse57) (forall ((v_DerPreprocessor_11 Int) (v_prenex_224 Int)) (let ((.cse64 (select (store .cse67 .cse66 v_DerPreprocessor_11) .cse8)) (.cse60 (store .cse65 .cse66 v_DerPreprocessor_11))) (let ((.cse63 (store .cse60 .cse4 .cse58)) (.cse62 (* 4 .cse64))) (let ((.cse59 (select (store (store .cse63 .cse7 v_prenex_224) .cse8 (+ .cse64 1)) (+ |c_~#queue~0.offset| .cse62 4)))) (or (= .cse59 0) (< (+ .cse59 2147483648) 0) (< 2147483647 .cse59) (not (= (select (store (store .cse60 .cse7 (+ 2 .cse61)) .cse4 .cse58) (+ |c_~#queue~0.offset| .cse62)) 0)) (= (select (store (store .cse63 .cse7 (+ (- 1) v_prenex_224)) .cse8 (+ 2 .cse64)) (+ |c_~#queue~0.offset| 8 .cse62)) 0)))))) (= 20 (select (store .cse67 .cse66 v_ArrVal_924) .cse4)) (= .cse57 .cse22) (forall ((v_prenex_223 Int)) (let ((.cse68 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_223))) (or (not (= (select .cse68 .cse2) 0)) (= (select .cse68 |c_~#stored_elements~0.offset|) 1) (= (select .cse68 .cse13) 0)))) (= .cse69 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_prenex_215 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (v_prenex_214 Int) (v_prenex_420 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse70 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_214)) (.cse73 (store (store .cse16 .cse71 v_prenex_420) .cse4 2)) (.cse72 (* v_DerPreprocessor_12 4))) (or (= (select .cse70 .cse13) 1) (= (select .cse70 |c_~#stored_elements~0.offset|) 1) (= v_DerPreprocessor_12 0) (not (= (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_420) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse72 |c_~#queue~0.offset|)) 0)) (not (= (select (store (store .cse73 .cse7 v_prenex_215) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse72 |c_~#queue~0.offset| 4)) 0)) (not (= (select .cse70 .cse2) 0)) (= v_DerPreprocessor_12 1) (= v_DerPreprocessor_12 2) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (= (select (store (store .cse73 .cse7 (+ (- 1) v_prenex_215)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse72 |c_~#queue~0.offset| 8)) 0)))) .cse74) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse78 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse77 (select .cse78 .cse4))) (or (forall ((v_prenex_56 Int)) (let ((.cse76 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_56))) (let ((.cse75 (select .cse76 |c_~#stored_elements~0.offset|))) (or (= .cse75 0) (= (select .cse76 .cse13) 1) (not (= 0 (select .cse76 .cse2))) (= .cse75 1))))) (= .cse77 20) (not (= 20 (select (store (store (store .cse78 .cse7 (+ (select .cse78 .cse7) 1)) .cse4 (+ .cse77 1)) (+ |c_~#queue~0.offset| (* .cse77 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse18 .cse19 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_165 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_10 Int)) (let ((.cse81 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse84 (select .cse81 .cse8))) (let ((.cse83 (store .cse81 .cse4 23)) (.cse85 (* .cse84 4)) (.cse87 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_165))) (let ((.cse80 (select .cse87 .cse13)) (.cse86 (select (store (store .cse83 .cse7 v_DerPreprocessor_4) .cse8 (+ .cse84 1)) (+ .cse85 |c_~#queue~0.offset| 4))) (.cse79 (select (store (store .cse81 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse85 |c_~#queue~0.offset|))) (.cse82 (select .cse87 |c_~#stored_elements~0.offset|))) (or (< 2147483647 .cse79) (= .cse80 1) (not (= 21 (select .cse81 .cse4))) (= .cse80 0) (= .cse82 1) (= (select (store (store .cse83 .cse7 (+ (- 1) v_DerPreprocessor_4)) .cse8 (+ 2 .cse84)) (+ .cse85 |c_~#queue~0.offset| 8)) 0) (< (+ .cse86 2147483648) 0) (not (= (select .cse87 .cse2) 0)) (< 2147483647 .cse86) (< (+ .cse79 2147483648) 0) (= .cse82 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse20) (or (forall ((v_prenex_200 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_188 Int) (v_DerPreprocessor_10 Int)) (let ((.cse91 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse94 (select .cse91 .cse8))) (let ((.cse93 (store .cse91 .cse4 23)) (.cse95 (* .cse94 4)) (.cse88 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_188))) (let ((.cse90 (select .cse88 |c_~#stored_elements~0.offset|)) (.cse92 (select (store (store .cse93 .cse7 v_prenex_200) .cse8 (+ .cse94 1)) (+ .cse95 |c_~#queue~0.offset| 4))) (.cse89 (select (store (store .cse91 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse95 |c_~#queue~0.offset|)))) (or (not (= (select .cse88 .cse2) 1)) (< 2147483647 .cse89) (= .cse90 0) (not (= 21 (select .cse91 .cse4))) (< 2147483647 .cse92) (= .cse92 0) (= (select .cse88 .cse13) 0) (not (= 0 (select (store (store .cse93 .cse7 (+ (- 1) v_prenex_200)) .cse8 (+ 2 .cse94)) (+ .cse95 |c_~#queue~0.offset| 8)))) (= .cse90 1) (< (+ .cse92 2147483648) 0) (< (+ .cse89 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse18 .cse19 .cse20) (or .cse36 .cse74 .cse38 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_239 Int)) (let ((.cse97 (store .cse98 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_239))) (let ((.cse96 (select .cse97 |c_~#stored_elements~0.offset|))) (or (= .cse96 0) (not (= (select .cse97 .cse2) 0)) (= .cse96 1) (= (select .cse97 .cse13) 0))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_240 Int)) (let ((.cse99 (store .cse98 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_240))) (let ((.cse100 (select .cse99 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse99 .cse2) 1)) (= .cse100 0) (= (select .cse99 .cse13) 0) (= .cse100 1))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_240 Int) (v_ArrVal_924 Int)) (let ((.cse103 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_240)) (.cse104 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse101 (select .cse104 .cse4)) (.cse102 (select .cse103 |c_~#stored_elements~0.offset|))) (or (= .cse101 18) (= .cse102 1) (= .cse101 20) (= (select .cse103 .cse13) 0) (= 21 .cse101) (= 20 (select (store (store (store .cse104 .cse7 (+ (select .cse104 .cse7) 1)) .cse4 (+ .cse101 1)) (+ |c_~#queue~0.offset| (* .cse101 4) 4) v_ArrVal_924) .cse4)) (= .cse101 17) (= .cse102 0) (not (= (select .cse103 .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse36 .cse37 .cse38) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse106 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse105 (select .cse106 .cse4))) (or (= .cse105 20) (not (= 20 (select (store (store (store .cse106 .cse7 (+ (select .cse106 .cse7) 1)) .cse4 (+ .cse105 1)) (+ |c_~#queue~0.offset| (* .cse105 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_83 Int)) (let ((.cse107 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_83))) (or (= (select .cse107 |c_~#stored_elements~0.offset|) 0) (= (select .cse107 .cse13) 0) (not (= (select .cse107 .cse2) 1))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_prenex_235 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_924 Int)) (let ((.cse110 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse109 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_235)) (.cse108 (select .cse110 .cse4))) (or (= .cse108 18) (= (select .cse109 |c_~#stored_elements~0.offset|) 0) (= .cse108 20) (not (= (select .cse109 .cse2) 0)) (= 21 .cse108) (= (select .cse109 .cse13) 0) (= 20 (select (store (store (store .cse110 .cse7 (+ (select .cse110 .cse7) 1)) .cse4 (+ .cse108 1)) (+ |c_~#queue~0.offset| (* .cse108 4) 4) v_ArrVal_924) .cse4)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse111) (or .cse18 .cse19 .cse20 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_187 Int) (v_prenex_186 Int) (v_DerPreprocessor_10 Int)) (let ((.cse118 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse114 (select .cse118 .cse8))) (let ((.cse113 (store .cse118 .cse4 23)) (.cse115 (* .cse114 4)) (.cse119 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_186))) (let ((.cse112 (select .cse119 |c_~#stored_elements~0.offset|)) (.cse116 (select (store (store .cse113 .cse7 v_prenex_187) .cse8 (+ .cse114 1)) (+ .cse115 |c_~#queue~0.offset| 4))) (.cse117 (select (store (store .cse118 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse115 |c_~#queue~0.offset|)))) (or (= .cse112 0) (= .cse112 1) (= (select (store (store .cse113 .cse7 (+ (- 1) v_prenex_187)) .cse8 (+ 2 .cse114)) (+ .cse115 |c_~#queue~0.offset| 8)) 0) (= .cse116 0) (< 2147483647 .cse117) (not (= 21 (select .cse118 .cse4))) (= (select .cse119 .cse13) 0) (< (+ .cse116 2147483648) 0) (not (= (select .cse119 .cse2) 0)) (< 2147483647 .cse116) (< (+ .cse117 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse122 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse121 (select .cse122 .cse4))) (or (forall ((v_prenex_78 Int)) (let ((.cse120 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_78))) (or (not (= (select .cse120 .cse2) 0)) (= (select .cse120 .cse13) 0) (= (select .cse120 |c_~#stored_elements~0.offset|) 1)))) (= .cse121 20) (not (= 20 (select (store (store (store .cse122 .cse7 (+ (select .cse122 .cse7) 1)) .cse4 (+ .cse121 1)) (+ |c_~#queue~0.offset| (* .cse121 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse18 .cse19 (forall ((v_prenex_169 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_170 Int) (v_DerPreprocessor_10 Int)) (let ((.cse128 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse126 (select .cse128 .cse8))) (let ((.cse125 (store .cse128 .cse4 23)) (.cse127 (* .cse126 4)) (.cse130 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_169))) (let ((.cse129 (select .cse130 |c_~#stored_elements~0.offset|)) (.cse124 (select .cse130 .cse13)) (.cse131 (select (store (store .cse125 .cse7 v_prenex_170) .cse8 (+ .cse126 1)) (+ .cse127 |c_~#queue~0.offset| 4))) (.cse123 (select (store (store .cse128 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse127 |c_~#queue~0.offset|)))) (or (< 2147483647 .cse123) (= .cse124 1) (not (= (select (store (store .cse125 .cse7 (+ (- 1) v_prenex_170)) .cse8 (+ 2 .cse126)) (+ .cse127 |c_~#queue~0.offset| 8)) 0)) (not (= 21 (select .cse128 .cse4))) (= .cse129 1) (= .cse129 0) (not (= (select .cse130 .cse2) 1)) (< (+ .cse131 2147483648) 0) (= .cse124 0) (< 2147483647 .cse131) (< (+ .cse123 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse20) (or .cse18 .cse19 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_172 Int) (v_prenex_173 Int) (v_DerPreprocessor_10 Int)) (let ((.cse134 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse136 (select .cse134 .cse8))) (let ((.cse137 (* .cse136 4))) (let ((.cse135 (store .cse134 .cse4 23)) (.cse133 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_172)) (.cse132 (select (store (store .cse134 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse137 |c_~#queue~0.offset|)))) (or (< 2147483647 .cse132) (= (select .cse133 |c_~#stored_elements~0.offset|) 0) (not (= 21 (select .cse134 .cse4))) (not (= (select (store (store .cse135 .cse7 (+ (- 1) v_prenex_173)) .cse8 (+ 2 .cse136)) (+ .cse137 |c_~#queue~0.offset| 8)) 0)) (not (= (select (store (store .cse135 .cse7 v_prenex_173) .cse8 (+ .cse136 1)) (+ .cse137 |c_~#queue~0.offset| 4)) 0)) (= (select .cse133 .cse13) 1) (not (= (select .cse133 .cse2) 1)) (= .cse132 0) (< (+ .cse132 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse20) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_183 Int) (v_prenex_184 Int) (v_DerPreprocessor_10 Int)) (let ((.cse139 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse141 (select .cse139 .cse8))) (let ((.cse140 (store .cse139 .cse4 23)) (.cse142 (* .cse141 4))) (let ((.cse138 (select (store (store .cse140 .cse7 v_prenex_184) .cse8 (+ .cse141 1)) (+ .cse142 |c_~#queue~0.offset| 4))) (.cse143 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_183))) (or (< 2147483647 .cse138) (= .cse138 0) (not (= 21 (select .cse139 .cse4))) (= (select (store (store .cse140 .cse7 (+ (- 1) v_prenex_184)) .cse8 (+ 2 .cse141)) (+ .cse142 |c_~#queue~0.offset| 8)) 0) (= (select .cse143 |c_~#stored_elements~0.offset|) 1) (= (select .cse143 .cse13) 0) (not (= (select (store (store .cse139 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse142 |c_~#queue~0.offset|)) 0)) (< (+ .cse138 2147483648) 0) (not (= (select .cse143 .cse2) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse19 .cse20) (or .cse19 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_185 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_10 Int)) (let ((.cse148 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse146 (select .cse148 .cse8))) (let ((.cse145 (store .cse148 .cse4 23)) (.cse147 (* .cse146 4))) (let ((.cse144 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_185)) (.cse149 (select (store (store .cse145 .cse7 v_DerPreprocessor_6) .cse8 (+ .cse146 1)) (+ .cse147 |c_~#queue~0.offset| 4)))) (or (= (select .cse144 |c_~#stored_elements~0.offset|) 1) (not (= (select .cse144 .cse2) 1)) (not (= (select (store (store .cse145 .cse7 (+ (- 1) v_DerPreprocessor_6)) .cse8 (+ 2 .cse146)) (+ .cse147 |c_~#queue~0.offset| 8)) 0)) (= (select .cse144 .cse13) 0) (not (= 21 (select .cse148 .cse4))) (< 2147483647 .cse149) (= .cse149 0) (not (= (select (store (store .cse148 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse147 |c_~#queue~0.offset|)) 0)) (< (+ 2147483648 .cse149) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse20) (or .cse150 .cse74) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse163 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse151 (select .cse163 .cse4))) (let ((.cse159 (select .cse163 .cse7)) (.cse156 (+ .cse151 1))) (let ((.cse152 (+ 2 .cse151)) (.cse153 (store (store .cse163 .cse7 (+ .cse159 1)) .cse4 .cse156)) (.cse154 (+ |c_~#queue~0.offset| (* .cse151 4) 4))) (or (= .cse151 20) (= .cse22 .cse152) (= 21 .cse151) (= 20 (select (store .cse153 .cse154 v_ArrVal_924) .cse4)) (= .cse151 .cse22) (forall ((v_prenex_225 Int)) (let ((.cse155 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_225))) (or (= (select .cse155 |c_~#stored_elements~0.offset|) 1) (= (select .cse155 .cse13) 0) (not (= (select .cse155 .cse2) 1))))) (= .cse156 .cse22) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_6 Int)) (let ((.cse162 (select (store .cse153 .cse154 v_DerPreprocessor_11) .cse8)) (.cse158 (store .cse163 .cse154 v_DerPreprocessor_11))) (let ((.cse161 (store .cse158 .cse4 .cse152)) (.cse160 (* 4 .cse162))) (let ((.cse157 (select (store (store .cse161 .cse7 v_DerPreprocessor_6) .cse8 (+ .cse162 1)) (+ |c_~#queue~0.offset| .cse160 4)))) (or (= .cse157 0) (< (+ .cse157 2147483648) 0) (not (= (select (store (store .cse158 .cse7 (+ 2 .cse159)) .cse4 .cse152) (+ |c_~#queue~0.offset| .cse160)) 0)) (not (= (select (store (store .cse161 .cse7 (+ (- 1) v_DerPreprocessor_6)) .cse8 (+ 2 .cse162)) (+ |c_~#queue~0.offset| 8 .cse160)) 0)) (< 2147483647 .cse157)))))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_DerPreprocessor_13 Int) (v_prenex_226 Int) (v_prenex_227 Int) (v_prenex_444 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse166 (store (store .cse16 .cse71 v_prenex_444) .cse4 2)) (.cse165 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_226)) (.cse167 (* v_DerPreprocessor_12 4))) (let ((.cse168 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_444) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse167 |c_~#queue~0.offset|))) (.cse164 (select .cse165 |c_~#stored_elements~0.offset|)) (.cse169 (select (store (store .cse166 .cse7 v_prenex_227) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse167 |c_~#queue~0.offset| 4)))) (or (= .cse164 0) (= (select .cse165 .cse13) 0) (= (select (store (store .cse166 .cse7 (+ (- 1) v_prenex_227)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse167 |c_~#queue~0.offset| 8)) 0) (not (= (select .cse165 .cse2) 0)) (= v_DerPreprocessor_12 0) (< (+ .cse168 2147483648) 0) (< 2147483647 .cse168) (= .cse169 0) (< 2147483647 .cse169) (= v_DerPreprocessor_12 1) (= .cse164 1) (= v_DerPreprocessor_12 2) (< (+ .cse169 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse74) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_171 Int)) (let ((.cse171 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_171))) (let ((.cse170 (select .cse171 |c_~#stored_elements~0.offset|))) (or (= 1 .cse170) (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (not (= (select .cse171 .cse2) 1)) (= 0 .cse170) (= (select .cse171 .cse13) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse111) (or (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (v_prenex_431 Int) (v_prenex_244 Int) (v_prenex_233 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse175 (store (store .cse16 .cse71 v_prenex_431) .cse4 2)) (.cse176 (* v_DerPreprocessor_12 4))) (let ((.cse174 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_431) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse176 |c_~#queue~0.offset|))) (.cse173 (select (store (store .cse175 .cse7 v_prenex_244) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse176 |c_~#queue~0.offset| 4))) (.cse172 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_233))) (or (= (select .cse172 |c_~#stored_elements~0.offset|) 0) (= .cse173 0) (< 2147483647 .cse174) (< (+ .cse174 2147483648) 0) (= .cse174 0) (= v_DerPreprocessor_12 0) (= (select .cse172 .cse13) 0) (= (select (store (store .cse175 .cse7 (+ (- 1) v_prenex_244)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse176 |c_~#queue~0.offset| 8)) 0) (= v_DerPreprocessor_12 1) (< (+ .cse173 2147483648) 0) (< 2147483647 .cse173) (= v_DerPreprocessor_12 2) (not (= (select .cse172 .cse2) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse74) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_437 Int)) (let ((.cse177 (store (store .cse16 .cse71 v_prenex_437) .cse4 2)) (.cse178 (* v_DerPreprocessor_12 4))) (let ((.cse180 (select (store (store .cse177 .cse7 v_prenex_232) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse178 |c_~#queue~0.offset| 4))) (.cse181 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_437) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse178 |c_~#queue~0.offset|))) (.cse179 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_231))) (or (not (= (select (store (store .cse177 .cse7 (+ (- 1) v_prenex_232)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse178 |c_~#queue~0.offset| 8)) 0)) (= (select .cse179 .cse13) 0) (= v_DerPreprocessor_12 0) (= (select .cse179 |c_~#stored_elements~0.offset|) 0) (< (+ .cse180 2147483648) 0) (< (+ 2147483648 .cse181) 0) (< 2147483647 .cse181) (= v_DerPreprocessor_12 1) (< 2147483647 .cse180) (= v_DerPreprocessor_12 2) (= .cse180 0) (= .cse181 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (not (= (select .cse179 .cse2) 1))))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse183 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse182 (select .cse183 .cse4))) (or (= .cse182 20) (not (= 20 (select (store (store (store .cse183 .cse7 (+ (select .cse183 .cse7) 1)) .cse4 (+ .cse182 1)) (+ |c_~#queue~0.offset| (* .cse182 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_63 Int)) (let ((.cse184 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_63))) (or (not (= (select .cse184 .cse2) 0)) (= (select .cse184 .cse13) 0) (= (select .cse184 |c_~#stored_elements~0.offset|) 1)))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_prenex_433 Int) (v_DerPreprocessor_12 Int) (v_prenex_434 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_207 Int)) (let ((.cse190 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_207)) (.cse187 (store (store .cse16 .cse71 v_prenex_433) .cse4 2)) (.cse188 (* v_DerPreprocessor_12 4))) (let ((.cse185 (select (store (store .cse187 .cse7 v_prenex_434) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse188 |c_~#queue~0.offset| 4))) (.cse186 (select .cse190 .cse13)) (.cse189 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_433) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse188 |c_~#queue~0.offset|)))) (or (< (+ 2147483648 .cse185) 0) (= .cse186 1) (not (= (select (store (store .cse187 .cse7 (+ (- 1) v_prenex_434)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse188 |c_~#queue~0.offset| 8)) 0)) (< 2147483647 .cse189) (= v_DerPreprocessor_12 0) (< 2147483647 .cse185) (= .cse189 0) (= .cse186 0) (= (select .cse190 |c_~#stored_elements~0.offset|) 0) (= v_DerPreprocessor_12 1) (not (= (select .cse190 .cse2) 1)) (= v_DerPreprocessor_12 2) (< (+ .cse189 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse193 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse191 (select .cse193 .cse4))) (or (= .cse191 20) (forall ((v_prenex_74 Int)) (let ((.cse192 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_74))) (or (not (= (select .cse192 .cse2) 1)) (= (select .cse192 |c_~#stored_elements~0.offset|) 0) (= (select .cse192 .cse13) 0)))) (not (= 20 (select (store (store (store .cse193 .cse7 (+ (select .cse193 .cse7) 1)) .cse4 (+ .cse191 1)) (+ |c_~#queue~0.offset| (* .cse191 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse195 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse194 (select .cse195 .cse4))) (or (= .cse194 20) (not (= 20 (select (store (store (store .cse195 .cse7 (+ (select .cse195 .cse7) 1)) .cse4 (+ .cse194 1)) (+ |c_~#queue~0.offset| (* .cse194 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_76 Int)) (let ((.cse196 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_76))) (let ((.cse197 (select .cse196 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse196 .cse2) 0)) (= .cse197 0) (= .cse197 1) (= 0 (select .cse196 .cse13)))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_prenex_211 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_924 Int)) (let ((.cse199 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_211)) (.cse201 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse198 (select .cse201 .cse4)) (.cse200 (select .cse199 |c_~#stored_elements~0.offset|))) (or (= .cse198 18) (not (= (select .cse199 .cse2) 1)) (= (select .cse199 .cse13) 0) (= .cse198 20) (= .cse200 1) (= 21 .cse198) (= 20 (select (store (store (store .cse201 .cse7 (+ (select .cse201 .cse7) 1)) .cse4 (+ .cse198 1)) (+ |c_~#queue~0.offset| (* .cse198 4) 4) v_ArrVal_924) .cse4)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (= .cse200 0))))) .cse111) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse215 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse204 (select .cse215 .cse4))) (let ((.cse214 (select .cse215 .cse7)) (.cse216 (+ .cse204 1))) (let ((.cse205 (+ 2 .cse204)) (.cse206 (store (store .cse215 .cse7 (+ .cse214 1)) .cse4 .cse216)) (.cse207 (+ |c_~#queue~0.offset| (* .cse204 4) 4))) (or (forall ((v_prenex_228 Int)) (let ((.cse203 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_228))) (let ((.cse202 (select .cse203 |c_~#stored_elements~0.offset|))) (or (= .cse202 0) (= (select .cse203 .cse13) 0) (not (= (select .cse203 .cse2) 1)) (= .cse202 1))))) (= .cse204 20) (= .cse22 .cse205) (= 21 .cse204) (= 20 (select (store .cse206 .cse207 v_ArrVal_924) .cse4)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_241 Int)) (let ((.cse209 (select (store .cse206 .cse207 v_DerPreprocessor_11) .cse8)) (.cse213 (store .cse215 .cse207 v_DerPreprocessor_11))) (let ((.cse208 (store .cse213 .cse4 .cse205)) (.cse210 (* 4 .cse209))) (let ((.cse212 (select (store (store .cse213 .cse7 (+ 2 .cse214)) .cse4 .cse205) (+ |c_~#queue~0.offset| .cse210))) (.cse211 (select (store (store .cse208 .cse7 v_prenex_241) .cse8 (+ .cse209 1)) (+ |c_~#queue~0.offset| .cse210 4)))) (or (not (= (select (store (store .cse208 .cse7 (+ (- 1) v_prenex_241)) .cse8 (+ 2 .cse209)) (+ |c_~#queue~0.offset| 8 .cse210)) 0)) (= .cse211 0) (< (+ .cse212 2147483648) 0) (< 2147483647 .cse211) (< 2147483647 .cse212) (< (+ .cse211 2147483648) 0)))))) (= .cse204 .cse22) (= .cse216 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse55 .cse36 .cse74 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_243 Int)) (let ((.cse217 (store .cse98 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_243))) (or (= (select .cse217 .cse13) 0) (not (= (select .cse217 .cse2) 1)) (= (select .cse217 |c_~#stored_elements~0.offset|) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_230 Int)) (let ((.cse218 (store .cse98 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_230))) (or (= (select .cse218 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse218 .cse2) 0)) (= (select .cse218 .cse13) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse38) (or (forall ((v_DerPreprocessor_13 Int) (v_prenex_425 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_426 Int) (v_prenex_206 Int)) (let ((.cse223 (store (store .cse16 .cse71 v_prenex_425) .cse4 2)) (.cse224 (* v_DerPreprocessor_12 4)) (.cse221 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_206))) (let ((.cse219 (select .cse221 .cse13)) (.cse220 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_425) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse224 |c_~#queue~0.offset|))) (.cse222 (select (store (store .cse223 .cse7 v_prenex_426) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse224 |c_~#queue~0.offset| 4)))) (or (= .cse219 1) (< 2147483647 .cse220) (= v_DerPreprocessor_12 0) (not (= (select .cse221 .cse2) 0)) (< (+ .cse220 2147483648) 0) (= .cse219 0) (= (select .cse221 |c_~#stored_elements~0.offset|) 0) (< 2147483647 .cse222) (= (select (store (store .cse223 .cse7 (+ (- 1) v_prenex_426)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse224 |c_~#queue~0.offset| 8)) 0) (= v_DerPreprocessor_12 1) (= .cse220 0) (= v_DerPreprocessor_12 2) (< (+ .cse222 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse74) (or (let ((.cse335 (* .cse22 4))) (let ((.cse225 (= .cse22 0)) (.cse226 (= 2 .cse22)) (.cse234 (+ 2 .cse22)) (.cse235 (+ .cse335 |c_~#queue~0.offset| 8)) (.cse237 (+ .cse335 |c_~#queue~0.offset|)) (.cse231 (+ .cse22 1)) (.cse232 (+ .cse335 |c_~#queue~0.offset| 4)) (.cse227 (= .cse22 1))) (and (or .cse150 .cse111) (or .cse225 .cse226 .cse227 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_212 Int)) (let ((.cse228 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_212))) (or (not (= (select .cse228 .cse2) 1)) (= (select .cse228 |c_~#stored_elements~0.offset|) 0) (= (select .cse228 .cse13) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) (forall ((v_DerPreprocessor_14 Int) (v_prenex_213 Int) (v_prenex_487 Int)) (let ((.cse236 (store .cse16 .cse71 v_prenex_487))) (let ((.cse230 (store .cse236 .cse4 2)) (.cse233 (select (store (store .cse236 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (not (= (select (store (store .cse230 .cse7 v_prenex_213) .cse8 .cse231) .cse232) 0)) (< 2147483647 .cse233) (not (= (select (store (store .cse230 .cse7 (+ (- 1) v_prenex_213)) .cse8 .cse234) .cse235) 0)) (< (+ .cse233 2147483648) 0) (= .cse233 0)))))) (or .cse225 .cse226 .cse227 (forall ((v_prenex_237 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse238 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_237))) (or (= (select .cse238 .cse13) 1) (not (= (select .cse238 .cse2) 0)) (= (select .cse238 |c_~#stored_elements~0.offset|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) (forall ((v_prenex_501 Int) (v_DerPreprocessor_14 Int) (v_prenex_518 Int)) (let ((.cse241 (store .cse16 .cse71 v_prenex_501))) (let ((.cse239 (store .cse241 .cse4 2)) (.cse240 (select (store (store .cse241 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (not (= (select (store (store .cse239 .cse7 v_prenex_518) .cse8 .cse231) .cse232) 0)) (< (+ .cse240 2147483648) 0) (= (select (store (store .cse239 .cse7 (+ (- 1) v_prenex_518)) .cse8 .cse234) .cse235) 0) (< 2147483647 .cse240) (= .cse240 0)))))) (or (forall ((v_prenex_205 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse243 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_205))) (let ((.cse242 (select .cse243 |c_~#stored_elements~0.offset|)) (.cse244 (select .cse243 .cse13))) (or (= .cse242 0) (not (= (select .cse243 .cse2) 0)) (= .cse242 1) (= .cse244 0) (= .cse244 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse225 .cse226 (forall ((v_DerPreprocessor_14 Int) (v_prenex_478 Int) (v_prenex_517 Int)) (let ((.cse248 (store .cse16 .cse71 v_prenex_478))) (let ((.cse247 (store .cse248 .cse4 2))) (let ((.cse245 (select (store (store .cse247 .cse7 v_prenex_517) .cse8 .cse231) .cse232)) (.cse246 (select (store (store .cse248 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (< 2147483647 .cse245) (< 2147483647 .cse246) (= (select (store (store .cse247 .cse7 (+ (- 1) v_prenex_517)) .cse8 .cse234) .cse235) 0) (< (+ .cse245 2147483648) 0) (< (+ .cse246 2147483648) 0)))))) .cse227) (or .cse55 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_243 Int)) (let ((.cse249 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_243))) (or (= (select .cse249 .cse13) 0) (not (= (select .cse249 .cse2) 1)) (= (select .cse249 |c_~#stored_elements~0.offset|) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_230 Int)) (let ((.cse250 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_230))) (or (= (select .cse250 .cse13) 0) (not (= (select .cse250 .cse2) 0)) (= (select .cse250 |c_~#stored_elements~0.offset|) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse36 .cse37 .cse38) (or (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_240 Int)) (let ((.cse252 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_240))) (let ((.cse251 (select .cse252 |c_~#stored_elements~0.offset|))) (or (= .cse251 0) (= .cse251 1) (= (select .cse252 .cse13) 0) (not (= (select .cse252 .cse2) 1)))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_239 Int)) (let ((.cse253 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_239))) (let ((.cse254 (select .cse253 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse253 .cse2) 0)) (= .cse254 0) (= (select .cse253 .cse13) 0) (= .cse254 1))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse36 .cse37 .cse38) (or .cse225 .cse226 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_218 Int)) (let ((.cse255 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_218))) (or (= (select .cse255 |c_~#stored_elements~0.offset|) 1) (= (select .cse255 .cse13) 1) (not (= (select .cse255 .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse227 (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_11 Int) (v_prenex_219 Int)) (let ((.cse257 (store .cse16 .cse71 v_DerPreprocessor_11))) (let ((.cse256 (store .cse257 .cse4 2))) (or (not (= (select (store (store .cse256 .cse7 v_prenex_219) .cse8 .cse231) .cse232) 0)) (not (= (select (store (store .cse256 .cse7 (+ (- 1) v_prenex_219)) .cse8 .cse234) .cse235) 0)) (not (= 0 (select (store (store .cse257 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237)))))))) (or .cse225 .cse226 .cse227 (forall ((v_DerPreprocessor_14 Int) (v_prenex_488 Int) (v_prenex_489 Int)) (let ((.cse260 (store .cse16 .cse71 v_prenex_488))) (let ((.cse259 (store .cse260 .cse4 2))) (let ((.cse258 (select (store (store .cse259 .cse7 v_prenex_489) .cse8 .cse231) .cse232))) (or (< (+ 2147483648 .cse258) 0) (= (select (store (store .cse259 .cse7 (+ (- 1) v_prenex_489)) .cse8 .cse234) .cse235) 0) (< 2147483647 .cse258) (not (= (select (store (store .cse260 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237) 0))))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_515 Int)) (let ((.cse262 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_515))) (let ((.cse261 (select .cse262 .cse13))) (or (= 0 .cse261) (not (= (select .cse262 .cse2) 0)) (= (select .cse262 |c_~#stored_elements~0.offset|) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (= .cse261 1)))))) (or .cse225 .cse226 .cse227 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_228 Int)) (let ((.cse263 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_228))) (let ((.cse264 (select .cse263 |c_~#stored_elements~0.offset|))) (or (= (select .cse263 .cse13) 0) (not (= (select .cse263 .cse2) 1)) (= .cse264 1) (= .cse264 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (forall ((v_prenex_502 Int) (v_DerPreprocessor_14 Int) (v_prenex_241 Int)) (let ((.cse268 (store .cse16 .cse71 v_prenex_502))) (let ((.cse266 (store .cse268 .cse4 2))) (let ((.cse265 (select (store (store .cse266 .cse7 v_prenex_241) .cse8 .cse231) .cse232)) (.cse267 (select (store (store .cse268 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (< (+ .cse265 2147483648) 0) (= .cse265 0) (< 2147483647 .cse265) (not (= (select (store (store .cse266 .cse7 (+ (- 1) v_prenex_241)) .cse8 .cse234) .cse235) 0)) (< 2147483647 .cse267) (< (+ .cse267 2147483648) 0))))))) (or .cse225 .cse226 (forall ((v_DerPreprocessor_14 Int) (v_prenex_500 Int) (v_prenex_516 Int)) (let ((.cse270 (store .cse16 .cse71 v_prenex_500))) (let ((.cse271 (store .cse270 .cse4 2))) (let ((.cse269 (select (store (store .cse271 .cse7 v_prenex_516) .cse8 .cse231) .cse232))) (or (< 2147483647 .cse269) (< (+ .cse269 2147483648) 0) (not (= (select (store (store .cse270 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237) 0)) (not (= (select (store (store .cse271 .cse7 (+ (- 1) v_prenex_516)) .cse8 .cse234) .cse235) 0)) (= .cse269 0)))))) .cse227 (forall ((v_prenex_225 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse272 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_225))) (or (= (select .cse272 .cse13) 0) (not (= (select .cse272 .cse2) 1)) (= 1 (select .cse272 |c_~#stored_elements~0.offset|)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (or .cse225 .cse226 (forall ((v_DerPreprocessor_14 Int) (v_prenex_491 Int) (v_prenex_490 Int)) (let ((.cse276 (store .cse16 .cse71 v_prenex_490))) (let ((.cse274 (store .cse276 .cse4 2))) (let ((.cse273 (select (store (store .cse274 .cse7 v_prenex_491) .cse8 .cse231) .cse232)) (.cse275 (select (store (store .cse276 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (< 2147483647 .cse273) (= (select (store (store .cse274 .cse7 (+ (- 1) v_prenex_491)) .cse8 .cse234) .cse235) 0) (< (+ .cse275 2147483648) 0) (= .cse275 0) (< (+ .cse273 2147483648) 0) (< 2147483647 .cse275)))))) .cse227 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_206 Int)) (let ((.cse277 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_206))) (let ((.cse278 (select .cse277 .cse13))) (or (not (= (select .cse277 .cse2) 0)) (= .cse278 0) (= (select .cse277 |c_~#stored_elements~0.offset|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (= .cse278 1)))))) (or .cse279 .cse111) (or .cse280 .cse37 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_222 Int)) (let ((.cse281 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_222))) (or (= (select .cse281 |c_~#stored_elements~0.offset|) 1) (= (select .cse281 .cse13) 0) (not (= 1 (select .cse281 .cse2)))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_238 Int)) (let ((.cse282 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_238))) (or (= (select .cse282 |c_~#stored_elements~0.offset|) 1) (= (select .cse282 .cse13) 0) (not (= (select .cse282 .cse2) 0))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (or .cse225 .cse226 .cse227 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_220 Int)) (let ((.cse284 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_220))) (let ((.cse283 (select .cse284 |c_~#stored_elements~0.offset|))) (or (= .cse283 0) (= (select .cse284 .cse13) 1) (not (= (select .cse284 .cse2) 1)) (= .cse283 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (forall ((v_DerPreprocessor_14 Int) (v_prenex_221 Int) (v_prenex_481 Int)) (let ((.cse287 (store .cse16 .cse71 v_prenex_481))) (let ((.cse286 (select (store (store .cse287 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237)) (.cse285 (store .cse287 .cse4 2))) (or (not (= (select (store (store .cse285 .cse7 v_prenex_221) .cse8 .cse231) .cse232) 0)) (< (+ .cse286 2147483648) 0) (< 2147483647 .cse286) (not (= (select (store (store .cse285 .cse7 (+ (- 1) v_prenex_221)) .cse8 .cse234) .cse235) 0))))))) (or (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_209 Int)) (let ((.cse288 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_209))) (let ((.cse289 (select .cse288 .cse13)) (.cse290 (select .cse288 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse288 .cse2) 1)) (= .cse289 1) (= .cse290 0) (= .cse289 0) (= .cse290 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse225 (forall ((v_DerPreprocessor_14 Int) (v_prenex_493 Int) (v_prenex_492 Int)) (let ((.cse294 (store .cse16 .cse71 v_prenex_492))) (let ((.cse293 (store .cse294 .cse4 2))) (let ((.cse291 (select (store (store .cse293 .cse7 v_prenex_493) .cse8 .cse231) .cse232)) (.cse292 (select (store (store .cse294 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (< 2147483647 .cse291) (< (+ .cse291 2147483648) 0) (< (+ .cse292 2147483648) 0) (not (= (select (store (store .cse293 .cse7 (+ (- 1) v_prenex_493)) .cse8 .cse234) .cse235) 0)) (< 2147483647 .cse292)))))) .cse226 .cse227) (or (forall ((v_prenex_215 Int) (v_DerPreprocessor_14 Int) (v_prenex_498 Int)) (let ((.cse296 (store .cse16 .cse71 v_prenex_498))) (let ((.cse295 (store .cse296 .cse4 2))) (or (not (= (select (store (store .cse295 .cse7 v_prenex_215) .cse8 .cse231) .cse232) 0)) (= (select (store (store .cse295 .cse7 (+ (- 1) v_prenex_215)) .cse8 .cse234) .cse235) 0) (not (= (select (store (store .cse296 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237) 0)))))) .cse225 .cse226 .cse227 (forall ((v_prenex_214 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse297 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_214))) (or (not (= (select .cse297 .cse2) 0)) (= (select .cse297 .cse13) 1) (= (select .cse297 |c_~#stored_elements~0.offset|) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (or .cse225 .cse226 .cse227 (forall ((v_prenex_227 Int) (v_DerPreprocessor_14 Int) (v_prenex_476 Int)) (let ((.cse301 (store .cse16 .cse71 v_prenex_476))) (let ((.cse299 (store .cse301 .cse4 2))) (let ((.cse298 (select (store (store .cse299 .cse7 v_prenex_227) .cse8 .cse231) .cse232)) (.cse300 (select (store (store .cse301 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (< (+ .cse298 2147483648) 0) (< 2147483647 .cse298) (= .cse298 0) (= (select (store (store .cse299 .cse7 (+ (- 1) v_prenex_227)) .cse8 .cse234) .cse235) 0) (< (+ .cse300 2147483648) 0) (< 2147483647 .cse300)))))) (forall ((v_prenex_226 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse303 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_226))) (let ((.cse302 (select .cse303 |c_~#stored_elements~0.offset|))) (or (= .cse302 0) (= .cse302 1) (= (select .cse303 .cse13) 0) (not (= (select .cse303 .cse2) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or .cse225 .cse226 (forall ((v_DerPreprocessor_14 Int) (v_prenex_244 Int) (v_prenex_496 Int)) (let ((.cse307 (store .cse16 .cse71 v_prenex_496))) (let ((.cse306 (store .cse307 .cse4 2))) (let ((.cse304 (select (store (store .cse306 .cse7 v_prenex_244) .cse8 .cse231) .cse232)) (.cse305 (select (store (store .cse307 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (< 2147483647 .cse304) (< 2147483647 .cse305) (= (select (store (store .cse306 .cse7 (+ (- 1) v_prenex_244)) .cse8 .cse234) .cse235) 0) (= .cse304 0) (< (+ .cse304 2147483648) 0) (= .cse305 0) (< (+ .cse305 2147483648) 0)))))) .cse227 (forall ((v_prenex_233 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse308 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_233))) (or (= (select .cse308 .cse13) 0) (= (select .cse308 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse308 .cse2) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (or .cse309 .cse111) (or .cse225 .cse226 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_207 Int)) (let ((.cse310 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_207))) (let ((.cse311 (select .cse310 .cse13))) (or (= (select .cse310 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse310 .cse2) 1)) (= .cse311 0) (= .cse311 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (forall ((v_DerPreprocessor_14 Int) (v_prenex_486 Int) (v_prenex_485 Int)) (let ((.cse315 (store .cse16 .cse71 v_prenex_485))) (let ((.cse312 (store .cse315 .cse4 2))) (let ((.cse314 (select (store (store .cse312 .cse7 v_prenex_486) .cse8 .cse231) .cse232)) (.cse313 (select (store (store .cse315 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (not (= (select (store (store .cse312 .cse7 (+ (- 1) v_prenex_486)) .cse8 .cse234) .cse235) 0)) (= .cse313 0) (< (+ 2147483648 .cse314) 0) (< 2147483647 .cse314) (< 2147483647 .cse313) (< (+ .cse313 2147483648) 0)))))) .cse227) (or (forall ((v_DerPreprocessor_14 Int) (v_prenex_477 Int) (v_prenex_210 Int)) (let ((.cse317 (store .cse16 .cse71 v_prenex_477))) (let ((.cse318 (store .cse317 .cse4 2))) (let ((.cse316 (select (store (store .cse318 .cse7 v_prenex_210) .cse8 .cse231) .cse232))) (or (< 2147483647 .cse316) (< (+ .cse316 2147483648) 0) (not (= (select (store (store .cse317 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237) 0)) (not (= (select (store (store .cse318 .cse7 (+ (- 1) v_prenex_210)) .cse8 .cse234) .cse235) 0))))))) .cse225 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_208 Int)) (let ((.cse319 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_208))) (let ((.cse320 (select .cse319 .cse13))) (or (not (= (select .cse319 .cse2) 1)) (= (select .cse319 |c_~#stored_elements~0.offset|) 1) (= .cse320 1) (= .cse320 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse226 .cse227) (or .cse225 .cse226 (forall ((v_DerPreprocessor_14 Int) (v_prenex_499 Int) (v_prenex_224 Int)) (let ((.cse321 (store .cse16 .cse71 v_prenex_499))) (let ((.cse322 (store .cse321 .cse4 2))) (let ((.cse323 (select (store (store .cse322 .cse7 v_prenex_224) .cse8 .cse231) .cse232))) (or (not (= (select (store (store .cse321 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237) 0)) (= (select (store (store .cse322 .cse7 (+ (- 1) v_prenex_224)) .cse8 .cse234) .cse235) 0) (< 2147483647 .cse323) (= .cse323 0) (< (+ .cse323 2147483648) 0)))))) .cse227 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_223 Int)) (let ((.cse324 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_223))) (or (= (select .cse324 .cse13) 0) (not (= (select .cse324 .cse2) 0)) (= (select .cse324 |c_~#stored_elements~0.offset|) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (or (forall ((v_DerPreprocessor_14 Int) (v_prenex_497 Int) (v_prenex_217 Int)) (let ((.cse327 (store .cse16 .cse71 v_prenex_497))) (let ((.cse325 (select (store (store .cse327 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237)) (.cse326 (store .cse327 .cse4 2))) (or (< (+ .cse325 2147483648) 0) (< 2147483647 .cse325) (= (select (store (store .cse326 .cse7 (+ (- 1) v_prenex_217)) .cse8 .cse234) .cse235) 0) (not (= (select (store (store .cse326 .cse7 v_prenex_217) .cse8 .cse231) .cse232) 0)))))) .cse225 .cse226 .cse227 (forall ((v_prenex_216 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse328 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_216))) (let ((.cse329 (select .cse328 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse328 .cse2) 0)) (= .cse329 0) (= .cse329 1) (= (select .cse328 .cse13) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_231 Int)) (let ((.cse330 (store .cse229 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_231))) (or (not (= (select .cse330 .cse2) 1)) (= (select .cse330 .cse13) 0) (= (select .cse330 |c_~#stored_elements~0.offset|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse225 .cse226 (forall ((v_prenex_479 Int) (v_DerPreprocessor_14 Int) (v_prenex_232 Int)) (let ((.cse334 (store .cse16 .cse71 v_prenex_479))) (let ((.cse332 (store .cse334 .cse4 2))) (let ((.cse331 (select (store (store .cse332 .cse7 v_prenex_232) .cse8 .cse231) .cse232)) (.cse333 (select (store (store .cse334 .cse7 (+ v_DerPreprocessor_14 1)) .cse4 2) .cse237))) (or (= .cse331 0) (< 2147483647 .cse331) (< (+ .cse331 2147483648) 0) (not (= (select (store (store .cse332 .cse7 (+ (- 1) v_prenex_232)) .cse8 .cse234) .cse235) 0)) (< (+ .cse333 2147483648) 0) (< 2147483647 .cse333) (= .cse333 0)))))) .cse227)))) (not (= 21 .cse336))) (or (forall ((v_prenex_238 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_924 Int)) (let ((.cse339 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse338 (select .cse339 .cse4)) (.cse337 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_238))) (or (= (select .cse337 |c_~#stored_elements~0.offset|) 1) (= .cse338 18) (= .cse338 20) (= 21 .cse338) (= 20 (select (store (store (store .cse339 .cse7 (+ (select .cse339 .cse7) 1)) .cse4 (+ .cse338 1)) (+ |c_~#queue~0.offset| (* .cse338 4) 4) v_ArrVal_924) .cse4)) (= .cse338 17) (not (= (select .cse337 .cse2) 0)) (= (select .cse337 .cse13) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse280 .cse37) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_prenex_213 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_212 Int) (v_prenex_432 Int)) (let ((.cse342 (* v_DerPreprocessor_12 4))) (let ((.cse340 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_432) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse342 |c_~#queue~0.offset|))) (.cse341 (store (store .cse16 .cse71 v_prenex_432) .cse4 2)) (.cse343 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_212))) (or (< 2147483647 .cse340) (< (+ .cse340 2147483648) 0) (= v_DerPreprocessor_12 0) (not (= (select (store (store .cse341 .cse7 v_prenex_213) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse342 |c_~#queue~0.offset| 4)) 0)) (= .cse340 0) (= v_DerPreprocessor_12 1) (not (= (select .cse343 .cse2) 1)) (not (= (select (store (store .cse341 .cse7 (+ (- 1) v_prenex_213)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse342 |c_~#queue~0.offset| 8)) 0)) (= v_DerPreprocessor_12 2) (= (select .cse343 |c_~#stored_elements~0.offset|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (= (select .cse343 .cse13) 1)))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse350 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse354 (select .cse350 .cse4))) (let ((.cse348 (select .cse350 .cse7)) (.cse355 (+ .cse354 1))) (let ((.cse349 (+ 2 .cse354)) (.cse352 (store (store .cse350 .cse7 (+ .cse348 1)) .cse4 .cse355)) (.cse351 (+ |c_~#queue~0.offset| (* .cse354 4) 4))) (or (forall ((v_prenex_215 Int) (v_DerPreprocessor_11 Int)) (let ((.cse345 (select (store .cse352 .cse351 v_DerPreprocessor_11) .cse8)) (.cse347 (store .cse350 .cse351 v_DerPreprocessor_11))) (let ((.cse344 (store .cse347 .cse4 .cse349)) (.cse346 (* 4 .cse345))) (or (not (= (select (store (store .cse344 .cse7 v_prenex_215) .cse8 (+ .cse345 1)) (+ |c_~#queue~0.offset| .cse346 4)) 0)) (= (select (store (store .cse344 .cse7 (+ (- 1) v_prenex_215)) .cse8 (+ 2 .cse345)) (+ |c_~#queue~0.offset| 8 .cse346)) 0) (not (= (select (store (store .cse347 .cse7 (+ 2 .cse348)) .cse4 .cse349) (+ |c_~#queue~0.offset| .cse346)) 0)))))) (forall ((v_prenex_214 Int)) (let ((.cse353 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_214))) (or (not (= (select .cse353 .cse2) 0)) (= (select .cse353 .cse13) 1) (= (select .cse353 |c_~#stored_elements~0.offset|) 1)))) (= .cse354 20) (= .cse22 .cse349) (= 21 .cse354) (= 20 (select (store .cse352 .cse351 v_ArrVal_924) .cse4)) (= .cse354 .cse22) (= .cse355 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse111 (forall ((v_prenex_202 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse356 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_202))) (or (= (select .cse356 |c_~#stored_elements~0.offset|) 0) (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse356 .cse13) 1) (not (= (select .cse356 .cse2) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse360 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse357 (select .cse360 .cse4))) (or (= .cse357 20) (forall ((v_prenex_79 Int)) (let ((.cse359 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_79))) (let ((.cse358 (select .cse359 |c_~#stored_elements~0.offset|))) (or (= .cse358 1) (= .cse358 0) (not (= (select .cse359 .cse2) 0)) (= (select .cse359 .cse13) 0))))) (not (= 20 (select (store (store (store .cse360 .cse7 (+ (select .cse360 .cse7) 1)) .cse4 (+ .cse357 1)) (+ |c_~#queue~0.offset| (* .cse357 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse374 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse363 (select .cse374 .cse4))) (let ((.cse373 (select .cse374 .cse7)) (.cse375 (+ .cse363 1))) (let ((.cse364 (+ 2 .cse363)) (.cse365 (store (store .cse374 .cse7 (+ .cse373 1)) .cse4 .cse375)) (.cse366 (+ |c_~#queue~0.offset| (* .cse363 4) 4))) (or (forall ((v_prenex_226 Int)) (let ((.cse362 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_226))) (let ((.cse361 (select .cse362 |c_~#stored_elements~0.offset|))) (or (= .cse361 1) (not (= (select .cse362 .cse2) 0)) (= .cse361 0) (= (select .cse362 .cse13) 0))))) (= .cse363 20) (= .cse22 .cse364) (= 21 .cse363) (= 20 (select (store .cse365 .cse366 v_ArrVal_924) .cse4)) (= .cse363 .cse22) (forall ((v_prenex_227 Int) (v_DerPreprocessor_11 Int)) (let ((.cse370 (select (store .cse365 .cse366 v_DerPreprocessor_11) .cse8)) (.cse372 (store .cse374 .cse366 v_DerPreprocessor_11))) (let ((.cse369 (store .cse372 .cse4 .cse364)) (.cse371 (* 4 .cse370))) (let ((.cse368 (select (store (store .cse372 .cse7 (+ 2 .cse373)) .cse4 .cse364) (+ |c_~#queue~0.offset| .cse371))) (.cse367 (select (store (store .cse369 .cse7 v_prenex_227) .cse8 (+ .cse370 1)) (+ |c_~#queue~0.offset| .cse371 4)))) (or (< 2147483647 .cse367) (< (+ .cse368 2147483648) 0) (< (+ .cse367 2147483648) 0) (= (select (store (store .cse369 .cse7 (+ (- 1) v_prenex_227)) .cse8 (+ 2 .cse370)) (+ |c_~#queue~0.offset| 8 .cse371)) 0) (< 2147483647 .cse368) (= .cse367 0)))))) (= .cse375 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_prenex_203 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse376 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_203))) (or (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse376 .cse13) 0) (not (= (select .cse376 .cse2) 1)) (= (select .cse376 |c_~#stored_elements~0.offset|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse55 .cse36 .cse37 .cse38) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_195 Int)) (let ((.cse377 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_195))) (or (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse377 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse377 .cse2) 0)) (= (select .cse377 .cse13) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse111) (or (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (v_prenex_442 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_441 Int) (v_prenex_449 Int)) (let ((.cse379 (store (store .cse16 .cse71 v_prenex_441) .cse4 2)) (.cse380 (* v_DerPreprocessor_12 4)) (.cse382 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_449))) (let ((.cse378 (select .cse382 .cse13)) (.cse381 (select (store (store .cse379 .cse7 v_prenex_442) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse380 |c_~#queue~0.offset| 4)))) (or (= .cse378 1) (= (select (store (store .cse379 .cse7 (+ (- 1) v_prenex_442)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse380 |c_~#queue~0.offset| 8)) 0) (< (+ .cse381 2147483648) 0) (= v_DerPreprocessor_12 0) (= .cse378 0) (not (= (select .cse382 .cse2) 0)) (not (= (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_441) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse380 |c_~#queue~0.offset|)) 0)) (= (select .cse382 |c_~#stored_elements~0.offset|) 1) (= v_DerPreprocessor_12 1) (< 2147483647 .cse381) (= v_DerPreprocessor_12 2) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse74) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse397 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse385 (select .cse397 .cse4))) (let ((.cse396 (select .cse397 .cse7)) (.cse389 (+ .cse385 1))) (let ((.cse386 (+ 2 .cse385)) (.cse387 (store (store .cse397 .cse7 (+ .cse396 1)) .cse4 .cse389)) (.cse388 (+ |c_~#queue~0.offset| (* .cse385 4) 4))) (or (forall ((v_prenex_206 Int)) (let ((.cse384 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_206))) (let ((.cse383 (select .cse384 .cse13))) (or (= .cse383 1) (not (= (select .cse384 .cse2) 0)) (= (select .cse384 |c_~#stored_elements~0.offset|) 0) (= .cse383 0))))) (= .cse385 20) (= .cse22 .cse386) (= 21 .cse385) (= 20 (select (store .cse387 .cse388 v_ArrVal_924) .cse4)) (= .cse385 .cse22) (= .cse389 .cse22) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_4 Int)) (let ((.cse392 (select (store .cse387 .cse388 v_DerPreprocessor_11) .cse8)) (.cse395 (store .cse397 .cse388 v_DerPreprocessor_11))) (let ((.cse391 (store .cse395 .cse4 .cse386)) (.cse393 (* 4 .cse392))) (let ((.cse394 (select (store (store .cse395 .cse7 (+ 2 .cse396)) .cse4 .cse386) (+ |c_~#queue~0.offset| .cse393))) (.cse390 (select (store (store .cse391 .cse7 v_DerPreprocessor_4) .cse8 (+ .cse392 1)) (+ |c_~#queue~0.offset| .cse393 4)))) (or (< (+ .cse390 2147483648) 0) (= (select (store (store .cse391 .cse7 (+ (- 1) v_DerPreprocessor_4)) .cse8 (+ 2 .cse392)) (+ |c_~#queue~0.offset| 8 .cse393)) 0) (< (+ .cse394 2147483648) 0) (= .cse394 0) (< 2147483647 .cse394) (< 2147483647 .cse390)))))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_prenex_236 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_924 Int)) (let ((.cse398 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_236)) (.cse401 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse399 (select .cse401 .cse4)) (.cse400 (select .cse398 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse398 .cse2) 0)) (= .cse399 18) (= (select .cse398 .cse13) 0) (= .cse399 20) (= 21 .cse399) (= .cse400 0) (= 20 (select (store (store (store .cse401 .cse7 (+ (select .cse401 .cse7) 1)) .cse4 (+ .cse399 1)) (+ |c_~#queue~0.offset| (* .cse399 4) 4) v_ArrVal_924) .cse4)) (= .cse400 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse111) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse405 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse404 (select .cse405 .cse4))) (or (forall ((v_prenex_68 Int)) (let ((.cse403 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_68))) (let ((.cse402 (select .cse403 |c_~#stored_elements~0.offset|))) (or (= .cse402 0) (not (= (select .cse403 .cse2) 1)) (= .cse402 1) (= (select .cse403 .cse13) 0))))) (= .cse404 20) (not (= 20 (select (store (store (store .cse405 .cse7 (+ (select .cse405 .cse7) 1)) .cse4 (+ .cse404 1)) (+ |c_~#queue~0.offset| (* .cse404 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse407 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse406 (select .cse407 .cse4))) (or (= .cse406 20) (not (= 20 (select (store (store (store .cse407 .cse7 (+ (select .cse407 .cse7) 1)) .cse4 (+ .cse406 1)) (+ |c_~#queue~0.offset| (* .cse406 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_51 Int)) (let ((.cse408 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_51))) (let ((.cse409 (select .cse408 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse408 .cse2) 1)) (= 0 .cse409) (= (select .cse408 .cse13) 0) (= .cse409 1))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse412 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse411 (select .cse412 .cse4))) (or (forall ((v_prenex_75 Int)) (let ((.cse410 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_75))) (or (= (select .cse410 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse410 .cse2) 0)) (= (select .cse410 .cse13) 0)))) (= .cse411 20) (not (= 20 (select (store (store (store .cse412 .cse7 (+ (select .cse412 .cse7) 1)) .cse4 (+ .cse411 1)) (+ |c_~#queue~0.offset| (* .cse411 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse111 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_924 Int) (v_prenex_229 Int)) (let ((.cse415 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse413 (select .cse415 .cse4)) (.cse414 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_229))) (or (= .cse413 18) (= .cse413 20) (not (= (select .cse414 .cse2) 1)) (= 21 .cse413) (= 20 (select (store (store (store .cse415 .cse7 (+ (select .cse415 .cse7) 1)) .cse4 (+ .cse413 1)) (+ |c_~#queue~0.offset| (* .cse413 4) 4) v_ArrVal_924) .cse4)) (= (select .cse414 .cse13) 1) (= (select .cse414 |c_~#stored_elements~0.offset|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse426 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse416 (select .cse426 .cse4))) (let ((.cse422 (select .cse426 .cse7)) (.cse427 (+ .cse416 1))) (let ((.cse418 (+ 2 .cse416)) (.cse419 (store (store .cse426 .cse7 (+ .cse422 1)) .cse4 .cse427)) (.cse420 (+ |c_~#queue~0.offset| (* .cse416 4) 4))) (or (= .cse416 20) (forall ((v_prenex_218 Int)) (let ((.cse417 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_218))) (or (not (= (select .cse417 .cse2) 1)) (= (select .cse417 .cse13) 1) (= (select .cse417 |c_~#stored_elements~0.offset|) 1)))) (= .cse22 .cse418) (= 21 .cse416) (= 20 (select (store .cse419 .cse420 v_ArrVal_924) .cse4)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_219 Int)) (let ((.cse425 (select (store .cse419 .cse420 v_DerPreprocessor_11) .cse8)) (.cse421 (store .cse426 .cse420 v_DerPreprocessor_11))) (let ((.cse424 (store .cse421 .cse4 .cse418)) (.cse423 (* 4 .cse425))) (or (not (= (select (store (store .cse421 .cse7 (+ 2 .cse422)) .cse4 .cse418) (+ |c_~#queue~0.offset| .cse423)) 0)) (not (= (select (store (store .cse424 .cse7 v_prenex_219) .cse8 (+ .cse425 1)) (+ |c_~#queue~0.offset| .cse423 4)) 0)) (not (= (select (store (store .cse424 .cse7 (+ (- 1) v_prenex_219)) .cse8 (+ 2 .cse425)) (+ |c_~#queue~0.offset| 8 .cse423)) 0)))))) (= .cse416 .cse22) (= .cse427 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_prenex_189 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (let ((.cse428 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_189))) (or (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse428 |c_~#stored_elements~0.offset|) 0) (= (select .cse428 .cse13) 1) (not (= (select .cse428 .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse111) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_234 Int) (v_ArrVal_924 Int)) (let ((.cse431 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse429 (select .cse431 .cse4)) (.cse430 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_234))) (or (= .cse429 18) (= .cse429 20) (= 21 .cse429) (not (= (select .cse430 .cse2) 1)) (= 20 (select (store (store (store .cse431 .cse7 (+ (select .cse431 .cse7) 1)) .cse4 (+ .cse429 1)) (+ |c_~#queue~0.offset| (* .cse429 4) 4) v_ArrVal_924) .cse4)) (= (select .cse430 .cse13) 0) (= (select .cse430 |c_~#stored_elements~0.offset|) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse111) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse445 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse432 (select .cse445 .cse4))) (let ((.cse444 (select .cse445 .cse7)) (.cse446 (+ .cse432 1))) (let ((.cse433 (+ 2 .cse432)) (.cse434 (store (store .cse445 .cse7 (+ .cse444 1)) .cse4 .cse446)) (.cse435 (+ |c_~#queue~0.offset| (* .cse432 4) 4))) (or (= .cse432 20) (= .cse22 .cse433) (= 21 .cse432) (= 20 (select (store .cse434 .cse435 v_ArrVal_924) .cse4)) (forall ((v_prenex_207 Int)) (let ((.cse437 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_207))) (let ((.cse436 (select .cse437 .cse13))) (or (= 1 .cse436) (= (select .cse437 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse437 .cse2) 1)) (= 0 .cse436))))) (forall ((v_DerPreprocessor_11 Int) (v_prenex_210 Int)) (let ((.cse439 (select (store .cse434 .cse435 v_DerPreprocessor_11) .cse8)) (.cse443 (store .cse445 .cse435 v_DerPreprocessor_11))) (let ((.cse438 (store .cse443 .cse4 .cse433)) (.cse440 (* 4 .cse439))) (let ((.cse441 (select (store (store .cse438 .cse7 v_prenex_210) .cse8 (+ .cse439 1)) (+ |c_~#queue~0.offset| .cse440 4))) (.cse442 (select (store (store .cse443 .cse7 (+ 2 .cse444)) .cse4 .cse433) (+ |c_~#queue~0.offset| .cse440)))) (or (not (= (select (store (store .cse438 .cse7 (+ (- 1) v_prenex_210)) .cse8 (+ 2 .cse439)) (+ |c_~#queue~0.offset| 8 .cse440)) 0)) (< 2147483647 .cse441) (< (+ .cse442 2147483648) 0) (= .cse442 0) (< (+ .cse441 2147483648) 0) (< 2147483647 .cse442)))))) (= .cse432 .cse22) (= .cse446 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse451 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse447 (select .cse451 .cse4))) (or (= .cse447 20) (forall ((v_prenex_49 Int)) (let ((.cse448 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_49))) (let ((.cse450 (select .cse448 |c_~#stored_elements~0.offset|)) (.cse449 (select .cse448 .cse13))) (or (not (= (select .cse448 .cse2) 1)) (= .cse449 0) (= .cse450 0) (= .cse450 1) (= .cse449 1))))) (not (= 20 (select (store (store (store .cse451 .cse7 (+ (select .cse451 .cse7) 1)) .cse4 (+ .cse447 1)) (+ |c_~#queue~0.offset| (* .cse447 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse453 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse452 (select .cse453 .cse4))) (or (= .cse452 20) (not (= 20 (select (store (store (store .cse453 .cse7 (+ (select .cse453 .cse7) 1)) .cse4 (+ .cse452 1)) (+ |c_~#queue~0.offset| (* .cse452 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_81 Int)) (let ((.cse454 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_81))) (let ((.cse455 (select .cse454 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse454 .cse2) 1)) (= .cse455 1) (= .cse455 0) (= (select .cse454 .cse13) 0))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_prenex_178 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_179 Int) (v_DerPreprocessor_10 Int)) (let ((.cse459 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse457 (select .cse459 .cse8))) (let ((.cse456 (store .cse459 .cse4 23)) (.cse458 (* .cse457 4)) (.cse460 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_178))) (or (not (= (select (store (store .cse456 .cse7 v_prenex_179) .cse8 (+ .cse457 1)) (+ .cse458 |c_~#queue~0.offset| 4)) 0)) (not (= 21 (select .cse459 .cse4))) (= (select .cse460 |c_~#stored_elements~0.offset|) 1) (= (select .cse460 .cse13) 1) (not (= (select (store (store .cse459 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse458 |c_~#queue~0.offset|)) 0)) (not (= (select (store (store .cse456 .cse7 (+ (- 1) v_prenex_179)) .cse8 (+ 2 .cse457)) (+ .cse458 |c_~#queue~0.offset| 8)) 0)) (not (= (select .cse460 .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) .cse19 .cse20) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse465 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse464 (select .cse465 .cse4))) (or (forall ((v_prenex_45 Int)) (let ((.cse463 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_45))) (let ((.cse462 (select .cse463 .cse13)) (.cse461 (select .cse463 |c_~#stored_elements~0.offset|))) (or (= .cse461 1) (= .cse462 1) (not (= (select .cse463 .cse2) 0)) (= .cse462 0) (= .cse461 0))))) (= .cse464 20) (not (= 20 (select (store (store (store .cse465 .cse7 (+ (select .cse465 .cse7) 1)) .cse4 (+ .cse464 1)) (+ |c_~#queue~0.offset| (* .cse464 4) 4) v_ArrVal_924) .cse4))))))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse478 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse466 (select .cse478 .cse4))) (let ((.cse477 (select .cse478 .cse7)) (.cse479 (+ .cse466 1))) (let ((.cse469 (+ 2 .cse466)) (.cse470 (store (store .cse478 .cse7 (+ .cse477 1)) .cse4 .cse479)) (.cse471 (+ |c_~#queue~0.offset| (* .cse466 4) 4))) (or (= .cse466 20) (forall ((v_ArrVal_919 Int)) (let ((.cse467 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_ArrVal_919))) (let ((.cse468 (select .cse467 .cse13))) (or (= (select .cse467 |c_~#stored_elements~0.offset|) 1) (not (= 0 (select .cse467 .cse2))) (= .cse468 0) (= .cse468 1))))) (= .cse22 .cse469) (= 21 .cse466) (= 20 (select (store .cse470 .cse471 v_ArrVal_924) .cse4)) (= .cse466 .cse22) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_4 Int)) (let ((.cse474 (select (store .cse470 .cse471 v_DerPreprocessor_11) .cse8)) (.cse476 (store .cse478 .cse471 v_DerPreprocessor_11))) (let ((.cse473 (store .cse476 .cse4 .cse469)) (.cse475 (* 4 .cse474))) (let ((.cse472 (select (store (store .cse473 .cse7 v_DerPreprocessor_4) .cse8 (+ .cse474 1)) (+ |c_~#queue~0.offset| .cse475 4)))) (or (< (+ .cse472 2147483648) 0) (= (select (store (store .cse473 .cse7 (+ (- 1) v_DerPreprocessor_4)) .cse8 (+ 2 .cse474)) (+ |c_~#queue~0.offset| 8 .cse475)) 0) (not (= (select (store (store .cse476 .cse7 (+ 2 .cse477)) .cse4 .cse469) (+ |c_~#queue~0.offset| .cse475)) 0)) (< 2147483647 .cse472)))))) (= .cse479 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse492 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse480 (select .cse492 .cse4))) (let ((.cse491 (select .cse492 .cse7)) (.cse493 (+ .cse480 1))) (let ((.cse482 (+ 2 .cse480)) (.cse483 (store (store .cse492 .cse7 (+ .cse491 1)) .cse4 .cse493)) (.cse484 (+ |c_~#queue~0.offset| (* .cse480 4) 4))) (or (= .cse480 20) (forall ((v_prenex_231 Int)) (let ((.cse481 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_231))) (or (not (= (select .cse481 .cse2) 1)) (= (select .cse481 .cse13) 0) (= (select .cse481 |c_~#stored_elements~0.offset|) 0)))) (= .cse22 .cse482) (= 21 .cse480) (= 20 (select (store .cse483 .cse484 v_ArrVal_924) .cse4)) (= .cse480 .cse22) (forall ((v_DerPreprocessor_11 Int) (v_prenex_232 Int)) (let ((.cse487 (select (store .cse483 .cse484 v_DerPreprocessor_11) .cse8)) (.cse490 (store .cse492 .cse484 v_DerPreprocessor_11))) (let ((.cse486 (store .cse490 .cse4 .cse482)) (.cse488 (* 4 .cse487))) (let ((.cse489 (select (store (store .cse490 .cse7 (+ 2 .cse491)) .cse4 .cse482) (+ |c_~#queue~0.offset| .cse488))) (.cse485 (select (store (store .cse486 .cse7 v_prenex_232) .cse8 (+ .cse487 1)) (+ |c_~#queue~0.offset| .cse488 4)))) (or (< (+ .cse485 2147483648) 0) (not (= (select (store (store .cse486 .cse7 (+ (- 1) v_prenex_232)) .cse8 (+ 2 .cse487)) (+ |c_~#queue~0.offset| 8 .cse488)) 0)) (< 2147483647 .cse485) (< (+ .cse489 2147483648) 0) (= .cse489 0) (< 2147483647 .cse489) (= .cse485 0)))))) (= .cse493 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_430 Int) (v_prenex_210 Int) (v_prenex_209 Int)) (let ((.cse500 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_209)) (.cse498 (store (store .cse16 .cse71 v_prenex_430) .cse4 2)) (.cse499 (* v_DerPreprocessor_12 4))) (let ((.cse497 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_430) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse499 |c_~#queue~0.offset|))) (.cse495 (select (store (store .cse498 .cse7 v_prenex_210) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse499 |c_~#queue~0.offset| 4))) (.cse494 (select .cse500 |c_~#stored_elements~0.offset|)) (.cse496 (select .cse500 .cse13))) (or (= .cse494 1) (< (+ .cse495 2147483648) 0) (= v_DerPreprocessor_12 0) (= .cse496 0) (< (+ .cse497 2147483648) 0) (not (= (select (store (store .cse498 .cse7 (+ (- 1) v_prenex_210)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse499 |c_~#queue~0.offset| 8)) 0)) (< 2147483647 .cse497) (= v_DerPreprocessor_12 1) (< 2147483647 .cse495) (not (= (select .cse500 .cse2) 1)) (= .cse494 0) (= .cse496 1) (= v_DerPreprocessor_12 2) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse504 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse503 (select .cse504 .cse4))) (or (forall ((v_prenex_66 Int)) (let ((.cse501 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_66))) (let ((.cse502 (select .cse501 |c_~#stored_elements~0.offset|))) (or (= (select .cse501 .cse13) 0) (not (= (select .cse501 .cse2) 0)) (= .cse502 1) (= .cse502 0))))) (= .cse503 20) (not (= 20 (select (store (store (store .cse504 .cse7 (+ (select .cse504 .cse7) 1)) .cse4 (+ .cse503 1)) (+ |c_~#queue~0.offset| (* .cse503 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse506 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse505 (select .cse506 .cse4))) (or (= .cse505 20) (not (= 20 (select (store (store (store .cse506 .cse7 (+ (select .cse506 .cse7) 1)) .cse4 (+ .cse505 1)) (+ |c_~#queue~0.offset| (* .cse505 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_73 Int)) (let ((.cse507 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_73))) (or (= (select .cse507 .cse13) 0) (not (= 0 (select .cse507 .cse2))) (= (select .cse507 |c_~#stored_elements~0.offset|) 0)))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse509 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse508 (select .cse509 .cse4))) (or (= .cse508 20) (not (= 20 (select (store (store (store .cse509 .cse7 (+ (select .cse509 .cse7) 1)) .cse4 (+ .cse508 1)) (+ |c_~#queue~0.offset| (* .cse508 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_65 Int)) (let ((.cse510 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_65))) (or (= (select .cse510 |c_~#stored_elements~0.offset|) 1) (not (= (select .cse510 .cse2) 1)) (= (select .cse510 .cse13) 0)))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse514 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse513 (select .cse514 .cse4))) (or (forall ((v_prenex_60 Int)) (let ((.cse512 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_60))) (let ((.cse511 (select .cse512 |c_~#stored_elements~0.offset|))) (or (= .cse511 0) (= (select .cse512 .cse13) 1) (not (= (select .cse512 .cse2) 1)) (= .cse511 1))))) (= .cse513 20) (not (= 20 (select (store (store (store .cse514 .cse7 (+ (select .cse514 .cse7) 1)) .cse4 (+ .cse513 1)) (+ |c_~#queue~0.offset| (* .cse513 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse529 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse515 (select .cse529 .cse4))) (let ((.cse528 (select .cse529 .cse7)) (.cse530 (+ .cse515 1))) (let ((.cse519 (+ 2 .cse515)) (.cse520 (store (store .cse529 .cse7 (+ .cse528 1)) .cse4 .cse530)) (.cse521 (+ |c_~#queue~0.offset| (* .cse515 4) 4))) (or (= .cse515 20) (forall ((v_prenex_205 Int)) (let ((.cse518 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_205))) (let ((.cse516 (select .cse518 |c_~#stored_elements~0.offset|)) (.cse517 (select .cse518 .cse13))) (or (= .cse516 0) (= .cse517 0) (= .cse516 1) (= .cse517 1) (not (= (select .cse518 .cse2) 0)))))) (= .cse22 .cse519) (= 21 .cse515) (= 20 (select (store .cse520 .cse521 v_ArrVal_924) .cse4)) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_4 Int)) (let ((.cse524 (select (store .cse520 .cse521 v_DerPreprocessor_11) .cse8)) (.cse527 (store .cse529 .cse521 v_DerPreprocessor_11))) (let ((.cse523 (store .cse527 .cse4 .cse519)) (.cse525 (* 4 .cse524))) (let ((.cse526 (select (store (store .cse527 .cse7 (+ 2 .cse528)) .cse4 .cse519) (+ |c_~#queue~0.offset| .cse525))) (.cse522 (select (store (store .cse523 .cse7 v_DerPreprocessor_4) .cse8 (+ .cse524 1)) (+ |c_~#queue~0.offset| .cse525 4)))) (or (< (+ .cse522 2147483648) 0) (= (select (store (store .cse523 .cse7 (+ (- 1) v_DerPreprocessor_4)) .cse8 (+ 2 .cse524)) (+ |c_~#queue~0.offset| 8 .cse525)) 0) (< (+ .cse526 2147483648) 0) (< 2147483647 .cse526) (< 2147483647 .cse522)))))) (= .cse515 .cse22) (= .cse530 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse280 .cse37 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_182 Int)) (let ((.cse531 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_182))) (or (= (select .cse531 |c_~#stored_elements~0.offset|) 1) (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse531 .cse13) 0) (not (= (select .cse531 .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse544 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse534 (select .cse544 .cse4))) (let ((.cse543 (select .cse544 .cse7)) (.cse545 (+ .cse534 1))) (let ((.cse535 (+ 2 .cse534)) (.cse536 (store (store .cse544 .cse7 (+ .cse543 1)) .cse4 .cse545)) (.cse537 (+ |c_~#queue~0.offset| (* .cse534 4) 4))) (or (forall ((v_prenex_216 Int)) (let ((.cse532 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_216))) (let ((.cse533 (select .cse532 |c_~#stored_elements~0.offset|))) (or (= 1 (select .cse532 .cse13)) (= .cse533 1) (= .cse533 0) (not (= (select .cse532 .cse2) 0)))))) (= .cse534 20) (= .cse22 .cse535) (= 21 .cse534) (= 20 (select (store .cse536 .cse537 v_ArrVal_924) .cse4)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_217 Int)) (let ((.cse539 (select (store .cse536 .cse537 v_DerPreprocessor_11) .cse8))) (let ((.cse542 (store .cse544 .cse537 v_DerPreprocessor_11)) (.cse540 (* 4 .cse539))) (let ((.cse541 (select (store (store .cse542 .cse7 (+ 2 .cse543)) .cse4 .cse535) (+ |c_~#queue~0.offset| .cse540))) (.cse538 (store .cse542 .cse4 .cse535))) (or (not (= (select (store (store .cse538 .cse7 v_prenex_217) .cse8 (+ .cse539 1)) (+ |c_~#queue~0.offset| .cse540 4)) 0)) (< (+ .cse541 2147483648) 0) (< 2147483647 .cse541) (= (select (store (store .cse538 .cse7 (+ (- 1) v_prenex_217)) .cse8 (+ 2 .cse539)) (+ |c_~#queue~0.offset| 8 .cse540)) 0)))))) (= .cse534 .cse22) (= .cse545 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse74 .cse280 (and (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_238 Int)) (let ((.cse546 (store .cse98 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_238))) (or (not (= (select .cse546 .cse2) 0)) (= (select .cse546 |c_~#stored_elements~0.offset|) 1) (= (select .cse546 .cse13) 0)))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_prenex_222 Int)) (let ((.cse547 (store .cse98 (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_222))) (or (= (select .cse547 .cse13) 0) (= (select .cse547 |c_~#stored_elements~0.offset|) 1) (not (= (select .cse547 .cse2) 1))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse550 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse549 (select .cse550 .cse4))) (or (forall ((v_prenex_82 Int)) (let ((.cse548 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_82))) (or (not (= (select .cse548 .cse2) 0)) (= (select .cse548 .cse13) 1) (= (select .cse548 |c_~#stored_elements~0.offset|) 0)))) (= .cse549 20) (not (= 20 (select (store (store (store .cse550 .cse7 (+ (select .cse550 .cse7) 1)) .cse4 (+ .cse549 1)) (+ |c_~#queue~0.offset| (* .cse549 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_DerPreprocessor_13 Int) (v_prenex_422 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_241 Int) (v_prenex_228 Int)) (let ((.cse551 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_228)) (.cse553 (store (store .cse16 .cse71 v_prenex_422) .cse4 2)) (.cse554 (* v_DerPreprocessor_12 4))) (let ((.cse552 (select (store (store .cse553 .cse7 v_prenex_241) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse554 |c_~#queue~0.offset| 4))) (.cse555 (select .cse551 |c_~#stored_elements~0.offset|)) (.cse556 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_422) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse554 |c_~#queue~0.offset|)))) (or (= (select .cse551 .cse13) 0) (< 2147483647 .cse552) (not (= (select .cse551 .cse2) 1)) (= v_DerPreprocessor_12 0) (< (+ .cse552 2147483648) 0) (not (= (select (store (store .cse553 .cse7 (+ (- 1) v_prenex_241)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse554 |c_~#queue~0.offset| 8)) 0)) (= .cse552 0) (= v_DerPreprocessor_12 1) (= .cse555 1) (= .cse555 0) (= v_DerPreprocessor_12 2) (< (+ .cse556 2147483648) 0) (< 2147483647 .cse556) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse74) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse559 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse558 (select .cse559 .cse4))) (or (forall ((v_prenex_69 Int)) (let ((.cse557 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_69))) (or (= (select .cse557 .cse13) 1) (not (= (select .cse557 .cse2) 1)) (= (select .cse557 |c_~#stored_elements~0.offset|) 0)))) (= .cse558 20) (not (= 20 (select (store (store (store .cse559 .cse7 (+ (select .cse559 .cse7) 1)) .cse4 (+ .cse558 1)) (+ |c_~#queue~0.offset| (* .cse558 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_196 Int)) (let ((.cse560 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_196))) (let ((.cse561 (select .cse560 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse560 .cse2) 0)) (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= .cse561 1) (= 0 (select .cse560 .cse13)) (= .cse561 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse111) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse563 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse562 (select .cse563 .cse4))) (or (= .cse562 20) (not (= 20 (select (store (store (store .cse563 .cse7 (+ (select .cse563 .cse7) 1)) .cse4 (+ .cse562 1)) (+ |c_~#queue~0.offset| (* .cse562 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_52 Int)) (let ((.cse564 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_52))) (or (= (select .cse564 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse564 .cse2) 1)) (= (select .cse564 .cse13) 1)))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse566 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse565 (select .cse566 .cse4))) (or (= .cse565 20) (not (= 20 (select (store (store (store .cse566 .cse7 (+ (select .cse566 .cse7) 1)) .cse4 (+ .cse565 1)) (+ |c_~#queue~0.offset| (* .cse565 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_47 Int)) (let ((.cse567 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_47))) (let ((.cse568 (select .cse567 .cse13))) (or (not (= (select .cse567 .cse2) 1)) (= (select .cse567 |c_~#stored_elements~0.offset|) 0) (= .cse568 1) (= .cse568 0))))))))))) (or .cse279 .cse74) (or .cse18 .cse19 (forall ((v_prenex_167 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_918 Int) (v_prenex_170 Int) (v_DerPreprocessor_10 Int)) (let ((.cse574 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse572 (select .cse574 .cse8))) (let ((.cse571 (store .cse574 .cse4 23)) (.cse573 (* .cse572 4)) (.cse569 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_167))) (let ((.cse575 (select .cse569 .cse13)) (.cse576 (select (store (store .cse571 .cse7 v_prenex_170) .cse8 (+ .cse572 1)) (+ .cse573 |c_~#queue~0.offset| 4))) (.cse570 (select (store (store .cse574 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse573 |c_~#queue~0.offset|)))) (or (not (= (select .cse569 .cse2) 1)) (< 2147483647 .cse570) (not (= (select (store (store .cse571 .cse7 (+ (- 1) v_prenex_170)) .cse8 (+ 2 .cse572)) (+ .cse573 |c_~#queue~0.offset| 8)) 0)) (not (= 21 (select .cse574 .cse4))) (= .cse575 1) (= 0 (select .cse569 |c_~#stored_elements~0.offset|)) (= .cse575 0) (< (+ .cse576 2147483648) 0) (= .cse570 0) (< 2147483647 .cse576) (< (+ .cse570 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse20) (or .cse18 .cse19 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_197 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_10 Int)) (let ((.cse582 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse580 (select .cse582 .cse8))) (let ((.cse581 (* .cse580 4))) (let ((.cse579 (store .cse582 .cse4 23)) (.cse578 (select (store (store .cse582 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse581 |c_~#queue~0.offset|))) (.cse577 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_197))) (or (not (= (select .cse577 .cse2) 0)) (< 2147483647 .cse578) (not (= (select (store (store .cse579 .cse7 v_DerPreprocessor_3) .cse8 (+ .cse580 1)) (+ .cse581 |c_~#queue~0.offset| 4)) 0)) (not (= 21 (select .cse582 .cse4))) (= (select .cse577 |c_~#stored_elements~0.offset|) 0) (= .cse578 0) (= 0 (select (store (store .cse579 .cse7 (+ (- 1) v_DerPreprocessor_3)) .cse8 (+ 2 .cse580)) (+ .cse581 |c_~#queue~0.offset| 8))) (< (+ .cse578 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (= (select .cse577 .cse13) 1))))))) .cse20) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_prenex_216 Int) (v_DerPreprocessor_12 Int) (v_prenex_423 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_217 Int)) (let ((.cse586 (* v_DerPreprocessor_12 4)) (.cse587 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_216))) (let ((.cse584 (select .cse587 |c_~#stored_elements~0.offset|)) (.cse585 (store (store .cse16 .cse71 v_prenex_423) .cse4 2)) (.cse583 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_423) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse586 |c_~#queue~0.offset|)))) (or (< (+ .cse583 2147483648) 0) (= .cse584 1) (= (select (store (store .cse585 .cse7 (+ (- 1) v_prenex_217)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse586 |c_~#queue~0.offset| 8)) 0) (= .cse584 0) (= v_DerPreprocessor_12 0) (not (= (select (store (store .cse585 .cse7 v_prenex_217) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse586 |c_~#queue~0.offset| 4)) 0)) (= (select .cse587 .cse13) 1) (< 2147483647 .cse583) (not (= (select .cse587 .cse2) 0)) (= v_DerPreprocessor_12 1) (= v_DerPreprocessor_12 2) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_prenex_205 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_451 Int) (v_prenex_418 Int)) (let ((.cse593 (store (store .cse16 .cse71 v_prenex_418) .cse4 2)) (.cse594 (* v_DerPreprocessor_12 4)) (.cse589 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_205))) (let ((.cse588 (select .cse589 |c_~#stored_elements~0.offset|)) (.cse590 (select .cse589 .cse13)) (.cse591 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_418) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse594 |c_~#queue~0.offset|))) (.cse592 (select (store (store .cse593 .cse7 v_prenex_451) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse594 |c_~#queue~0.offset| 4)))) (or (= .cse588 1) (not (= (select .cse589 .cse2) 0)) (= .cse590 1) (= .cse588 0) (= v_DerPreprocessor_12 0) (= .cse590 0) (< (+ .cse591 2147483648) 0) (= v_DerPreprocessor_12 1) (< 2147483647 .cse592) (< 2147483647 .cse591) (< (+ .cse592 2147483648) 0) (= v_DerPreprocessor_12 2) (= (select (store (store .cse593 .cse7 (+ (- 1) v_prenex_451)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse594 |c_~#queue~0.offset| 8)) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_194 Int)) (let ((.cse595 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_194))) (or (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (not (= (select .cse595 .cse2) 1)) (= (select .cse595 |c_~#stored_elements~0.offset|) 0) (= (select .cse595 .cse13) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse111) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_198 Int)) (let ((.cse596 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_198))) (or (= (select .cse596 |c_~#stored_elements~0.offset|) 1) (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse596 .cse13) 0) (not (= (select .cse596 .cse2) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse280 .cse37) (or .cse74 .cse309) (or (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_440 Int) (v_prenex_219 Int) (v_prenex_218 Int)) (let ((.cse599 (store (store .cse16 .cse71 v_prenex_440) .cse4 2)) (.cse597 (* v_DerPreprocessor_12 4)) (.cse598 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_218))) (or (not (= (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_440) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse597 |c_~#queue~0.offset|)) 0)) (= v_DerPreprocessor_12 0) (not (= (select .cse598 .cse2) 1)) (= (select .cse598 |c_~#stored_elements~0.offset|) 1) (= v_DerPreprocessor_12 1) (not (= (select (store (store .cse599 .cse7 (+ (- 1) v_prenex_219)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse597 |c_~#queue~0.offset| 8)) 0)) (not (= (select (store (store .cse599 .cse7 v_prenex_219) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse597 |c_~#queue~0.offset| 4)) 0)) (= v_DerPreprocessor_12 2) (= (select .cse598 .cse13) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))) .cse74) (or .cse18 .cse19 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_168 Int) (v_prenex_170 Int) (v_DerPreprocessor_10 Int)) (let ((.cse604 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse602 (select .cse604 .cse8))) (let ((.cse601 (store .cse604 .cse4 23)) (.cse603 (* .cse602 4)) (.cse605 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_168))) (let ((.cse600 (select .cse605 .cse13)) (.cse606 (select (store (store .cse601 .cse7 v_prenex_170) .cse8 (+ .cse602 1)) (+ .cse603 |c_~#queue~0.offset| 4)))) (or (= .cse600 0) (not (= (select (store (store .cse601 .cse7 (+ (- 1) v_prenex_170)) .cse8 (+ 2 .cse602)) (+ .cse603 |c_~#queue~0.offset| 8)) 0)) (not (= 21 (select .cse604 .cse4))) (not (= (select .cse605 .cse2) 1)) (= (select .cse605 |c_~#stored_elements~0.offset|) 1) (< (+ .cse606 2147483648) 0) (not (= (select (store (store .cse604 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse603 |c_~#queue~0.offset|)) 0)) (= .cse600 1) (< 2147483647 .cse606) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse20) (or (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_208 Int) (v_prenex_439 Int) (v_prenex_438 Int)) (let ((.cse610 (store (store .cse16 .cse71 v_prenex_438) .cse4 2)) (.cse611 (* v_DerPreprocessor_12 4)) (.cse609 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_208))) (let ((.cse607 (select .cse609 .cse13)) (.cse608 (select (store (store .cse610 .cse7 v_prenex_439) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse611 |c_~#queue~0.offset| 4)))) (or (= .cse607 1) (= v_DerPreprocessor_12 0) (< 2147483647 .cse608) (not (= (select .cse609 .cse2) 1)) (not (= (select (store (store .cse610 .cse7 (+ (- 1) v_prenex_439)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse611 |c_~#queue~0.offset| 8)) 0)) (= .cse607 0) (not (= (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_438) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse611 |c_~#queue~0.offset|)) 0)) (= v_DerPreprocessor_12 1) (= (select .cse609 |c_~#stored_elements~0.offset|) 1) (= v_DerPreprocessor_12 2) (< (+ .cse608 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse74) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse614 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse612 (select .cse614 .cse4))) (or (= .cse612 20) (forall ((v_prenex_70 Int)) (let ((.cse613 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_70))) (or (= (select .cse613 .cse13) 0) (not (= (select .cse613 .cse2) 0)) (= (select .cse613 |c_~#stored_elements~0.offset|) 0)))) (not (= 20 (select (store (store (store .cse614 .cse7 (+ (select .cse614 .cse7) 1)) .cse4 (+ .cse612 1)) (+ |c_~#queue~0.offset| (* .cse612 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse616 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse615 (select .cse616 .cse4))) (or (= .cse615 20) (not (= 20 (select (store (store (store .cse616 .cse7 (+ (select .cse616 .cse7) 1)) .cse4 (+ .cse615 1)) (+ |c_~#queue~0.offset| (* .cse615 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_71 Int)) (let ((.cse617 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_71))) (or (not (= (select .cse617 .cse2) 1)) (= (select .cse617 |c_~#stored_elements~0.offset|) 0) (= (select .cse617 .cse13) 0)))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse36 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_924 Int) (v_prenex_239 Int)) (let ((.cse620 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_239)) (.cse621 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse619 (select .cse621 .cse4)) (.cse618 (select .cse620 |c_~#stored_elements~0.offset|))) (or (= .cse618 1) (= .cse619 18) (= (select .cse620 .cse13) 0) (= .cse619 20) (not (= (select .cse620 .cse2) 0)) (= 21 .cse619) (= 20 (select (store (store (store .cse621 .cse7 (+ (select .cse621 .cse7) 1)) .cse4 (+ .cse619 1)) (+ |c_~#queue~0.offset| (* .cse619 4) 4) v_ArrVal_924) .cse4)) (= .cse619 17) (= .cse618 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse37 .cse38) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_176 Int) (v_prenex_177 Int) (v_DerPreprocessor_10 Int)) (let ((.cse626 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse624 (select .cse626 .cse8))) (let ((.cse625 (* .cse624 4)) (.cse628 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_176))) (let ((.cse623 (store .cse626 .cse4 23)) (.cse627 (select .cse628 |c_~#stored_elements~0.offset|)) (.cse622 (select (store (store .cse626 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse625 |c_~#queue~0.offset|)))) (or (< 2147483647 .cse622) (= (select (store (store .cse623 .cse7 (+ (- 1) v_prenex_177)) .cse8 (+ 2 .cse624)) (+ .cse625 |c_~#queue~0.offset| 8)) 0) (not (= 21 (select .cse626 .cse4))) (= .cse627 1) (not (= (select .cse628 .cse2) 0)) (not (= (select (store (store .cse623 .cse7 v_prenex_177) .cse8 (+ .cse624 1)) (+ .cse625 |c_~#queue~0.offset| 4)) 0)) (= .cse627 0) (< (+ .cse622 2147483648) 0) (= (select .cse628 .cse13) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse18 .cse19 .cse20) (or .cse19 (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_918 Int) (v_prenex_174 Int) (v_prenex_175 Int) (v_DerPreprocessor_10 Int)) (let ((.cse629 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse633 (select .cse629 .cse8))) (let ((.cse632 (store .cse629 .cse4 23)) (.cse631 (* .cse633 4)) (.cse630 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_174))) (or (not (= 21 (select .cse629 .cse4))) (not (= (select .cse630 .cse2) 0)) (not (= (select (store (store .cse629 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse631 |c_~#queue~0.offset|)) 0)) (= (select (store (store .cse632 .cse7 (+ (- 1) v_prenex_175)) .cse8 (+ 2 .cse633)) (+ .cse631 |c_~#queue~0.offset| 8)) 0) (not (= (select (store (store .cse632 .cse7 v_prenex_175) .cse8 (+ .cse633 1)) (+ .cse631 |c_~#queue~0.offset| 4)) 0)) (= (select .cse630 .cse13) 1) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12) (= (select .cse630 |c_~#stored_elements~0.offset|) 1)))))) .cse20) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_192 Int) (v_DerPreprocessor_10 Int) (v_prenex_191 Int)) (let ((.cse637 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse639 (select .cse637 .cse8))) (let ((.cse638 (store .cse637 .cse4 23)) (.cse640 (* .cse639 4))) (let ((.cse634 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_191)) (.cse635 (select (store (store .cse637 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse640 |c_~#queue~0.offset|))) (.cse636 (select (store (store .cse638 .cse7 v_prenex_192) .cse8 (+ .cse639 1)) (+ .cse640 |c_~#queue~0.offset| 4)))) (or (= (select .cse634 .cse13) 0) (< 2147483647 .cse635) (= (select .cse634 |c_~#stored_elements~0.offset|) 0) (< 2147483647 .cse636) (not (= 21 (select .cse637 .cse4))) (< (+ .cse636 2147483648) 0) (not (= (select .cse634 .cse2) 1)) (= .cse635 0) (< (+ .cse635 2147483648) 0) (= .cse636 0) (not (= (select (store (store .cse638 .cse7 (+ (- 1) v_prenex_192)) .cse8 (+ 2 .cse639)) (+ .cse640 |c_~#queue~0.offset| 8)) 0)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse18 .cse19 .cse20) (or .cse36 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_201 Int)) (let ((.cse642 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_201))) (let ((.cse641 (select .cse642 |c_~#stored_elements~0.offset|))) (or (= .cse641 1) (not (= (select .cse642 .cse2) 1)) (not (= 21 (select (store .cse16 .cse17 v_ArrVal_918) .cse4))) (= (select .cse642 .cse13) 0) (= .cse641 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse37 .cse38) (or (forall ((v_prenex_204 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_193 Int) (v_DerPreprocessor_10 Int)) (let ((.cse649 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse644 (select .cse649 .cse8))) (let ((.cse643 (store .cse649 .cse4 23)) (.cse645 (* .cse644 4))) (let ((.cse648 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_193)) (.cse646 (select (store (store .cse643 .cse7 v_prenex_204) .cse8 (+ .cse644 1)) (+ .cse645 |c_~#queue~0.offset| 4))) (.cse647 (select (store (store .cse649 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse645 |c_~#queue~0.offset|)))) (or (= (select (store (store .cse643 .cse7 (+ (- 1) v_prenex_204)) .cse8 (+ 2 .cse644)) (+ .cse645 |c_~#queue~0.offset| 8)) 0) (< (+ .cse646 2147483648) 0) (= .cse646 0) (< 2147483647 .cse647) (= (select .cse648 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse648 .cse2) 0)) (not (= 21 (select .cse649 .cse4))) (= .cse647 0) (= (select .cse648 .cse13) 0) (< 2147483647 .cse646) (< (+ .cse647 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse18 .cse19 .cse20) (or .cse111 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_242 Int) (v_ArrVal_924 Int)) (let ((.cse652 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse651 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_242)) (.cse650 (select .cse652 .cse4))) (or (= .cse650 18) (= (select .cse651 .cse13) 1) (= (select .cse651 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse651 .cse2) 0)) (= .cse650 20) (= 21 .cse650) (= 20 (select (store (store (store .cse652 .cse7 (+ (select .cse652 .cse7) 1)) .cse4 (+ .cse650 1)) (+ |c_~#queue~0.offset| (* .cse650 4) 4) v_ArrVal_924) .cse4)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or (forall ((v_prenex_222 Int) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_ArrVal_924 Int)) (let ((.cse654 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse653 (select .cse654 .cse4)) (.cse655 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_222))) (or (= .cse653 18) (= .cse653 20) (= 21 .cse653) (= 20 (select (store (store (store .cse654 .cse7 (+ (select .cse654 .cse7) 1)) .cse4 (+ .cse653 1)) (+ |c_~#queue~0.offset| (* .cse653 4) 4) v_ArrVal_924) .cse4)) (= 1 (select .cse655 |c_~#stored_elements~0.offset|)) (= .cse653 17) (not (= (select .cse655 .cse2) 1)) (= (select .cse655 .cse13) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse280 .cse37) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse658 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse657 (select .cse658 .cse4))) (or (forall ((v_prenex_58 Int)) (let ((.cse656 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_58))) (or (not (= 1 (select .cse656 .cse2))) (= (select .cse656 |c_~#stored_elements~0.offset|) 1) (= (select .cse656 .cse13) 1)))) (= .cse657 20) (not (= 20 (select (store (store (store .cse658 .cse7 (+ (select .cse658 .cse7) 1)) .cse4 (+ .cse657 1)) (+ |c_~#queue~0.offset| (* .cse657 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse662 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse659 (select .cse662 .cse4))) (or (= .cse659 20) (forall ((v_ArrVal_919 Int)) (let ((.cse660 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_ArrVal_919))) (let ((.cse661 (select .cse660 .cse13))) (or (= (select .cse660 |c_~#stored_elements~0.offset|) 1) (not (= 0 (select .cse660 .cse2))) (= .cse661 0) (= .cse661 1))))) (not (= 20 (select (store (store (store .cse662 .cse7 (+ (select .cse662 .cse7) 1)) .cse4 (+ .cse659 1)) (+ |c_~#queue~0.offset| (* .cse659 4) 4) v_ArrVal_924) .cse4))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_230 Int) (v_ArrVal_924 Int)) (let ((.cse665 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse664 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_230)) (.cse663 (select .cse665 .cse4))) (or (= .cse663 18) (= (select .cse664 .cse13) 0) (= .cse663 20) (= (select .cse664 |c_~#stored_elements~0.offset|) 0) (= 21 .cse663) (= 20 (select (store (store (store .cse665 .cse7 (+ (select .cse665 .cse7) 1)) .cse4 (+ .cse663 1)) (+ |c_~#queue~0.offset| (* .cse663 4) 4) v_ArrVal_924) .cse4)) (not (= (select .cse664 .cse2) 0)) (= .cse663 17) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse55 .cse36 .cse37 .cse38) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse675 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse678 (select .cse675 .cse4))) (let ((.cse673 (select .cse675 .cse7)) (.cse679 (+ .cse678 1))) (let ((.cse674 (+ 2 .cse678)) (.cse677 (store (store .cse675 .cse7 (+ .cse673 1)) .cse4 .cse679)) (.cse676 (+ |c_~#queue~0.offset| (* .cse678 4) 4))) (or (forall ((v_prenex_220 Int)) (let ((.cse666 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_220))) (let ((.cse667 (select .cse666 |c_~#stored_elements~0.offset|))) (or (not (= (select .cse666 .cse2) 1)) (= .cse667 0) (= (select .cse666 .cse13) 1) (= .cse667 1))))) (forall ((v_DerPreprocessor_11 Int) (v_prenex_221 Int)) (let ((.cse669 (select (store .cse677 .cse676 v_DerPreprocessor_11) .cse8))) (let ((.cse670 (* 4 .cse669)) (.cse672 (store .cse675 .cse676 v_DerPreprocessor_11))) (let ((.cse668 (store .cse672 .cse4 .cse674)) (.cse671 (select (store (store .cse672 .cse7 (+ 2 .cse673)) .cse4 .cse674) (+ |c_~#queue~0.offset| .cse670)))) (or (not (= (select (store (store .cse668 .cse7 (+ (- 1) v_prenex_221)) .cse8 (+ 2 .cse669)) (+ |c_~#queue~0.offset| 8 .cse670)) 0)) (< (+ .cse671 2147483648) 0) (not (= (select (store (store .cse668 .cse7 v_prenex_221) .cse8 (+ .cse669 1)) (+ |c_~#queue~0.offset| .cse670 4)) 0)) (< 2147483647 .cse671)))))) (= .cse678 20) (= .cse22 .cse674) (= 21 .cse678) (= 20 (select (store .cse677 .cse676 v_ArrVal_924) .cse4)) (= .cse678 .cse22) (= .cse679 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_prenex_224 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_223 Int) (v_prenex_421 Int)) (let ((.cse682 (store (store .cse16 .cse71 v_prenex_421) .cse4 2)) (.cse681 (* v_DerPreprocessor_12 4))) (let ((.cse680 (select (store (store .cse682 .cse7 v_prenex_224) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse681 |c_~#queue~0.offset| 4))) (.cse683 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_223))) (or (< 2147483647 .cse680) (= v_DerPreprocessor_12 0) (= .cse680 0) (not (= (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_421) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse681 |c_~#queue~0.offset|)) 0)) (= (select (store (store .cse682 .cse7 (+ (- 1) v_prenex_224)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse681 |c_~#queue~0.offset| 8)) 0) (= v_DerPreprocessor_12 1) (< (+ .cse680 2147483648) 0) (= (select .cse683 |c_~#stored_elements~0.offset|) 1) (not (= (select .cse683 .cse2) 0)) (= v_DerPreprocessor_12 2) (= (select .cse683 .cse13) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or (forall ((v_prenex_424 Int) (v_DerPreprocessor_13 Int) (v_prenex_237 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_452 Int)) (let ((.cse687 (* v_DerPreprocessor_12 4))) (let ((.cse686 (store (store .cse16 .cse71 v_prenex_424) .cse4 2)) (.cse685 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_237)) (.cse684 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_424) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse687 |c_~#queue~0.offset|)))) (or (= .cse684 0) (= (select .cse685 |c_~#stored_elements~0.offset|) 0) (= v_DerPreprocessor_12 0) (not (= (select .cse685 .cse2) 0)) (= (select (store (store .cse686 .cse7 (+ (- 1) v_prenex_452)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse687 |c_~#queue~0.offset| 8)) 0) (not (= (select (store (store .cse686 .cse7 v_prenex_452) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse687 |c_~#queue~0.offset| 4)) 0)) (< 2147483647 .cse684) (= (select .cse685 .cse13) 1) (= v_DerPreprocessor_12 1) (< (+ .cse684 2147483648) 0) (= v_DerPreprocessor_12 2) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse74) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse697 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse689 (select .cse697 .cse4))) (let ((.cse696 (select .cse697 .cse7)) (.cse700 (+ .cse689 1))) (let ((.cse690 (+ 2 .cse689)) (.cse699 (store (store .cse697 .cse7 (+ .cse696 1)) .cse4 .cse700)) (.cse698 (+ |c_~#queue~0.offset| (* .cse689 4) 4))) (or (forall ((v_prenex_237 Int)) (let ((.cse688 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_237))) (or (= (select .cse688 .cse13) 1) (= (select .cse688 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse688 .cse2) 0))))) (= .cse689 20) (= .cse22 .cse690) (= 21 .cse689) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_3 Int)) (let ((.cse692 (select (store .cse699 .cse698 v_DerPreprocessor_11) .cse8))) (let ((.cse693 (* 4 .cse692)) (.cse695 (store .cse697 .cse698 v_DerPreprocessor_11))) (let ((.cse691 (store .cse695 .cse4 .cse690)) (.cse694 (select (store (store .cse695 .cse7 (+ 2 .cse696)) .cse4 .cse690) (+ |c_~#queue~0.offset| .cse693)))) (or (not (= (select (store (store .cse691 .cse7 v_DerPreprocessor_3) .cse8 (+ .cse692 1)) (+ |c_~#queue~0.offset| .cse693 4)) 0)) (= (select (store (store .cse691 .cse7 (+ (- 1) v_DerPreprocessor_3)) .cse8 (+ 2 .cse692)) (+ |c_~#queue~0.offset| 8 .cse693)) 0) (< (+ .cse694 2147483648) 0) (= .cse694 0) (< 2147483647 .cse694)))))) (= 20 (select (store .cse699 .cse698 v_ArrVal_924) .cse4)) (= .cse689 .cse22) (= .cse700 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse708 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse711 (select .cse708 .cse4))) (let ((.cse706 (select .cse708 .cse7)) (.cse714 (+ .cse711 1))) (let ((.cse707 (+ 2 .cse711)) (.cse710 (store (store .cse708 .cse7 (+ .cse706 1)) .cse4 .cse714)) (.cse709 (+ |c_~#queue~0.offset| (* .cse711 4) 4))) (or (forall ((v_DerPreprocessor_11 Int) (v_prenex_210 Int)) (let ((.cse702 (select (store .cse710 .cse709 v_DerPreprocessor_11) .cse8)) (.cse705 (store .cse708 .cse709 v_DerPreprocessor_11))) (let ((.cse701 (store .cse705 .cse4 .cse707)) (.cse703 (* 4 .cse702))) (let ((.cse704 (select (store (store .cse701 .cse7 v_prenex_210) .cse8 (+ .cse702 1)) (+ |c_~#queue~0.offset| .cse703 4)))) (or (not (= (select (store (store .cse701 .cse7 (+ (- 1) v_prenex_210)) .cse8 (+ 2 .cse702)) (+ |c_~#queue~0.offset| 8 .cse703)) 0)) (< 2147483647 .cse704) (< (+ .cse704 2147483648) 0) (not (= (select (store (store .cse705 .cse7 (+ 2 .cse706)) .cse4 .cse707) (+ |c_~#queue~0.offset| .cse703)) 0))))))) (= .cse711 20) (= .cse22 .cse707) (= 21 .cse711) (= 20 (select (store .cse710 .cse709 v_ArrVal_924) .cse4)) (forall ((v_prenex_208 Int)) (let ((.cse713 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_208))) (let ((.cse712 (select .cse713 .cse13))) (or (= .cse712 0) (not (= (select .cse713 .cse2) 1)) (= (select .cse713 |c_~#stored_elements~0.offset|) 1) (= .cse712 1))))) (= .cse711 .cse22) (= .cse714 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse716 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse715 (select .cse716 .cse4))) (or (= .cse715 20) (not (= 20 (select (store (store (store .cse716 .cse7 (+ (select .cse716 .cse7) 1)) .cse4 (+ .cse715 1)) (+ |c_~#queue~0.offset| (* .cse715 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_54 Int)) (let ((.cse717 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_54))) (or (not (= (select .cse717 .cse2) 0)) (= (select .cse717 .cse13) 1) (= (select .cse717 |c_~#stored_elements~0.offset|) 1)))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse729 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse719 (select .cse729 .cse4))) (let ((.cse728 (select .cse729 .cse7)) (.cse730 (+ .cse719 1))) (let ((.cse720 (+ 2 .cse719)) (.cse721 (store (store .cse729 .cse7 (+ .cse728 1)) .cse4 .cse730)) (.cse722 (+ |c_~#queue~0.offset| (* .cse719 4) 4))) (or (forall ((v_prenex_212 Int)) (let ((.cse718 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_212))) (or (not (= (select .cse718 .cse2) 1)) (= (select .cse718 .cse13) 1) (= (select .cse718 |c_~#stored_elements~0.offset|) 0)))) (= .cse719 20) (= .cse22 .cse720) (= 21 .cse719) (= 20 (select (store .cse721 .cse722 v_ArrVal_924) .cse4)) (= .cse719 .cse22) (forall ((v_DerPreprocessor_11 Int) (v_prenex_213 Int)) (let ((.cse724 (select (store .cse721 .cse722 v_DerPreprocessor_11) .cse8))) (let ((.cse725 (* 4 .cse724)) (.cse727 (store .cse729 .cse722 v_DerPreprocessor_11))) (let ((.cse723 (store .cse727 .cse4 .cse720)) (.cse726 (select (store (store .cse727 .cse7 (+ 2 .cse728)) .cse4 .cse720) (+ |c_~#queue~0.offset| .cse725)))) (or (not (= (select (store (store .cse723 .cse7 v_prenex_213) .cse8 (+ .cse724 1)) (+ |c_~#queue~0.offset| .cse725 4)) 0)) (< (+ .cse726 2147483648) 0) (= .cse726 0) (not (= (select (store (store .cse723 .cse7 (+ (- 1) v_prenex_213)) .cse8 (+ 2 .cse724)) (+ |c_~#queue~0.offset| 8 .cse725)) 0)) (< 2147483647 .cse726)))))) (= .cse730 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_181 Int) (v_DerPreprocessor_10 Int) (v_prenex_180 Int)) (let ((.cse736 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse732 (select .cse736 .cse8))) (let ((.cse733 (* .cse732 4)) (.cse737 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_180))) (let ((.cse731 (store .cse736 .cse4 23)) (.cse734 (select .cse737 |c_~#stored_elements~0.offset|)) (.cse735 (select (store (store .cse736 .cse7 v_DerPreprocessor_10) .cse4 23) (+ .cse733 |c_~#queue~0.offset|)))) (or (not (= (select (store (store .cse731 .cse7 v_prenex_181) .cse8 (+ .cse732 1)) (+ .cse733 |c_~#queue~0.offset| 4)) 0)) (= .cse734 0) (< 2147483647 .cse735) (not (= 21 (select .cse736 .cse4))) (not (= (select (store (store .cse731 .cse7 (+ (- 1) v_prenex_181)) .cse8 (+ 2 .cse732)) (+ .cse733 |c_~#queue~0.offset| 8)) 0)) (= (select .cse737 .cse13) 1) (= .cse734 1) (< (+ .cse735 2147483648) 0) (not (= (select .cse737 .cse2) 1)) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))))) .cse18 .cse19 .cse20) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse739 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse738 (select .cse739 .cse4))) (or (= .cse738 20) (not (= 20 (select (store (store (store .cse739 .cse7 (+ (select .cse739 .cse7) 1)) .cse4 (+ .cse738 1)) (+ |c_~#queue~0.offset| (* .cse738 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_62 Int)) (let ((.cse740 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_62))) (or (= (select .cse740 |c_~#stored_elements~0.offset|) 1) (= (select .cse740 .cse13) 0) (not (= (select .cse740 .cse2) 1))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse742 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse741 (select .cse742 .cse4))) (or (= .cse741 20) (not (= 20 (select (store (store (store .cse742 .cse7 (+ (select .cse742 .cse7) 1)) .cse4 (+ .cse741 1)) (+ |c_~#queue~0.offset| (* .cse741 4) 4) v_ArrVal_924) .cse4))) (forall ((v_prenex_48 Int)) (let ((.cse744 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_48))) (let ((.cse743 (select .cse744 .cse13))) (or (= .cse743 1) (= .cse743 0) (= (select .cse744 |c_~#stored_elements~0.offset|) 1) (not (= (select .cse744 .cse2) 1)))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (v_prenex_225 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_443 Int) (v_prenex_450 Int)) (let ((.cse748 (store (store .cse16 .cse71 v_prenex_443) .cse4 2)) (.cse747 (* v_DerPreprocessor_12 4))) (let ((.cse746 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_225)) (.cse745 (select (store (store .cse748 .cse7 v_prenex_450) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse747 |c_~#queue~0.offset| 4)))) (or (< 2147483647 .cse745) (not (= (select .cse746 .cse2) 1)) (not (= (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_443) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse747 |c_~#queue~0.offset|)) 0)) (= v_DerPreprocessor_12 0) (= (select .cse746 |c_~#stored_elements~0.offset|) 1) (= (select .cse746 .cse13) 0) (= v_DerPreprocessor_12 1) (= .cse745 0) (= v_DerPreprocessor_12 2) (not (= (select (store (store .cse748 .cse7 (+ (- 1) v_prenex_450)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse747 |c_~#queue~0.offset| 8)) 0)) (< (+ .cse745 2147483648) 0) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_66| Int)) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_924 Int)) (let ((.cse763 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse749 (select .cse763 .cse4))) (let ((.cse762 (select .cse763 .cse7)) (.cse764 (+ .cse749 1))) (let ((.cse753 (+ 2 .cse749)) (.cse754 (store (store .cse763 .cse7 (+ .cse762 1)) .cse4 .cse764)) (.cse755 (+ |c_~#queue~0.offset| (* .cse749 4) 4))) (or (= .cse749 20) (forall ((v_prenex_209 Int)) (let ((.cse751 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_209))) (let ((.cse750 (select .cse751 |c_~#stored_elements~0.offset|)) (.cse752 (select .cse751 .cse13))) (or (= .cse750 1) (= .cse750 0) (not (= (select .cse751 .cse2) 1)) (= .cse752 1) (= .cse752 0))))) (= .cse22 .cse753) (= 21 .cse749) (= 20 (select (store .cse754 .cse755 v_ArrVal_924) .cse4)) (forall ((v_DerPreprocessor_11 Int) (v_prenex_210 Int)) (let ((.cse757 (select (store .cse754 .cse755 v_DerPreprocessor_11) .cse8)) (.cse761 (store .cse763 .cse755 v_DerPreprocessor_11))) (let ((.cse756 (store .cse761 .cse4 .cse753)) (.cse758 (* 4 .cse757))) (let ((.cse759 (select (store (store .cse756 .cse7 v_prenex_210) .cse8 (+ .cse757 1)) (+ |c_~#queue~0.offset| .cse758 4))) (.cse760 (select (store (store .cse761 .cse7 (+ 2 .cse762)) .cse4 .cse753) (+ |c_~#queue~0.offset| .cse758)))) (or (not (= (select (store (store .cse756 .cse7 (+ (- 1) v_prenex_210)) .cse8 (+ 2 .cse757)) (+ |c_~#queue~0.offset| 8 .cse758)) 0)) (< 2147483647 .cse759) (< (+ .cse760 2147483648) 0) (< (+ .cse759 2147483648) 0) (< 2147483647 .cse760)))))) (= .cse749 .cse22) (= .cse764 .cse22))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))) (or .cse74 (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_12 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_220 Int) (v_prenex_221 Int) (v_prenex_428 Int)) (let ((.cse769 (* v_DerPreprocessor_12 4)) (.cse765 (store (store .cse14 .cse15 v_DerPreprocessor_12) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_220))) (let ((.cse767 (select .cse765 |c_~#stored_elements~0.offset|)) (.cse768 (store (store .cse16 .cse71 v_prenex_428) .cse4 2)) (.cse766 (select (store (store (store (store .cse16 .cse8 v_DerPreprocessor_12) .cse71 v_prenex_428) .cse7 (+ v_DerPreprocessor_13 1)) .cse4 2) (+ .cse769 |c_~#queue~0.offset|)))) (or (= (select .cse765 .cse13) 1) (< 2147483647 .cse766) (= .cse767 1) (= v_DerPreprocessor_12 0) (= .cse767 0) (not (= (select (store (store .cse768 .cse7 (+ (- 1) v_prenex_221)) .cse8 (+ v_DerPreprocessor_12 2)) (+ .cse769 |c_~#queue~0.offset| 8)) 0)) (not (= (select (store (store .cse768 .cse7 v_prenex_221) .cse8 (+ v_DerPreprocessor_12 1)) (+ .cse769 |c_~#queue~0.offset| 4)) 0)) (< (+ .cse766 2147483648) 0) (= v_DerPreprocessor_12 1) (not (= (select .cse765 .cse2) 1)) (= v_DerPreprocessor_12 2) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12)))))) (or .cse55 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_~i~0#1_66| Int) (v_prenex_243 Int) (v_ArrVal_924 Int)) (let ((.cse772 (store .cse16 .cse17 v_ArrVal_918))) (let ((.cse771 (store (store .cse14 .cse15 v_ArrVal_918) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_66| 4) |c_~#stored_elements~0.offset|) v_prenex_243)) (.cse770 (select .cse772 .cse4))) (or (= .cse770 18) (= (select .cse771 .cse13) 0) (= .cse770 20) (= 21 .cse770) (= 20 (select (store (store (store .cse772 .cse7 (+ (select .cse772 .cse7) 1)) .cse4 (+ .cse770 1)) (+ |c_~#queue~0.offset| (* .cse770 4) 4) v_ArrVal_924) .cse4)) (= (select .cse771 |c_~#stored_elements~0.offset|) 0) (not (= (select .cse771 .cse2) 1)) (= .cse770 17) (< |v_t1Thread1of1ForFork1_~i~0#1_66| .cse12))))) .cse36 .cse37 .cse38)))))) is different from true [2025-04-13 23:46:49,400 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:49,400 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7689 treesize of output 7431 [2025-04-13 23:46:50,141 INFO L325 Elim1Store]: treesize reduction 207, result has 16.2 percent of original size [2025-04-13 23:46:50,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 54909 treesize of output 34758 [2025-04-13 23:46:50,553 INFO L325 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-04-13 23:46:50,553 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 10462 treesize of output 10118 [2025-04-13 23:46:50,904 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:50,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 96 [2025-04-13 23:46:51,181 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:51,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 119 [2025-04-13 23:46:51,648 INFO L325 Elim1Store]: treesize reduction 232, result has 6.1 percent of original size [2025-04-13 23:46:51,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 18739 treesize of output 13471 [2025-04-13 23:46:52,069 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 74 [2025-04-13 23:46:52,273 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:46:52,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 17 [2025-04-13 23:46:53,898 INFO L325 Elim1Store]: treesize reduction 44, result has 92.3 percent of original size [2025-04-13 23:46:53,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 15 new quantified variables, introduced 66 case distinctions, treesize of input 785972 treesize of output 509264 [2025-04-13 23:47:28,030 WARN L286 SmtUtils]: Spent 34.12s on a formula simplification. DAG size of input: 3425 DAG size of output: 958 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 23:51:30,704 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:51:30,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 11926 treesize of output 11502 [2025-04-13 23:51:31,329 INFO L325 Elim1Store]: treesize reduction 177, result has 28.3 percent of original size [2025-04-13 23:51:31,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 5973 treesize of output 3985 [2025-04-13 23:51:31,950 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:51:31,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 21 [2025-04-13 23:51:34,354 INFO L325 Elim1Store]: treesize reduction 34, result has 94.0 percent of original size [2025-04-13 23:51:34,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 15 new quantified variables, introduced 66 case distinctions, treesize of input 3398548 treesize of output 2027438 [2025-04-13 23:51:56,051 WARN L286 SmtUtils]: Spent 21.68s on a formula simplification. DAG size of input: 5586 DAG size of output: 1067 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 23:52:10,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 23:52:10,070 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 23:52:10,071 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 23:52:10,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:52:10,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:52:10,272 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 86 more [2025-04-13 23:52:10,277 INFO L158 Benchmark]: Toolchain (without parser) took 410144.63ms. Allocated memory was 155.2MB in the beginning and 889.2MB in the end (delta: 734.0MB). Free memory was 108.9MB in the beginning and 530.1MB in the end (delta: -421.2MB). Peak memory consumption was 566.7MB. Max. memory is 8.0GB. [2025-04-13 23:52:10,277 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:52:10,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.03ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 75.6MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 23:52:10,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.24ms. Allocated memory is still 155.2MB. Free memory was 75.6MB in the beginning and 72.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:52:10,277 INFO L158 Benchmark]: Boogie Preprocessor took 58.13ms. Allocated memory is still 155.2MB. Free memory was 72.1MB in the beginning and 69.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:52:10,277 INFO L158 Benchmark]: IcfgBuilder took 924.17ms. Allocated memory is still 155.2MB. Free memory was 69.9MB in the beginning and 60.9MB in the end (delta: 9.0MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. [2025-04-13 23:52:10,277 INFO L158 Benchmark]: TraceAbstraction took 408553.43ms. Allocated memory was 155.2MB in the beginning and 889.2MB in the end (delta: 734.0MB). Free memory was 59.8MB in the beginning and 530.1MB in the end (delta: -470.3MB). Peak memory consumption was 517.9MB. Max. memory is 8.0GB. [2025-04-13 23:52:10,278 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.03ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 75.6MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.24ms. Allocated memory is still 155.2MB. Free memory was 75.6MB in the beginning and 72.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.13ms. Allocated memory is still 155.2MB. Free memory was 72.1MB in the beginning and 69.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 924.17ms. Allocated memory is still 155.2MB. Free memory was 69.9MB in the beginning and 60.9MB in the end (delta: 9.0MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. * TraceAbstraction took 408553.43ms. Allocated memory was 155.2MB in the beginning and 889.2MB in the end (delta: 734.0MB). Free memory was 59.8MB in the beginning and 530.1MB in the end (delta: -470.3MB). Peak memory consumption was 517.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...