/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:24:49,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:24:49,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:24:49,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:24:49,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:24:49,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:24:49,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:24:49,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:24:49,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:24:49,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:24:49,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:24:49,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:24:49,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:24:49,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:24:49,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:24:49,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:24:49,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:24:49,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:24:49,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:24:49,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:24:49,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:24:49,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:24:49,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:24:49,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:24:49,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:24:49,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:24:49,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:24:49,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:24:49,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:24:49,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:24:49,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:24:49,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:24:49,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:24:49,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:24:49,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:24:49,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:24:49,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:24:49,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:24:49,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:24:49,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:24:49,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:24:49,208 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:24:49,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:24:49,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:24:49,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:24:49,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:24:49,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:24:49,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:24:49,222 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:24:49,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:24:49,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:24:49,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:24:49,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:24:49,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:24:49,225 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:24:49,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:24:49,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:24:49,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:24:49,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:24:49,428 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:24:49,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-03-15 19:24:49,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97772b695/f6cadcfff010420faf4fb1535fc3999a/FLAGbc49081fe [2022-03-15 19:24:49,798 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:24:49,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-03-15 19:24:49,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97772b695/f6cadcfff010420faf4fb1535fc3999a/FLAGbc49081fe [2022-03-15 19:24:50,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97772b695/f6cadcfff010420faf4fb1535fc3999a [2022-03-15 19:24:50,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:24:50,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:24:50,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:24:50,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:24:50,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:24:50,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdf87ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50, skipping insertion in model container [2022-03-15 19:24:50,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:24:50,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:24:50,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-03-15 19:24:50,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:24:50,502 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:24:50,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-03-15 19:24:50,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:24:50,542 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:24:50,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50 WrapperNode [2022-03-15 19:24:50,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:24:50,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:24:50,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:24:50,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:24:50,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,566 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-03-15 19:24:50,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:24:50,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:24:50,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:24:50,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:24:50,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:24:50,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:24:50,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:24:50,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:24:50,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (1/1) ... [2022-03-15 19:24:50,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:24:50,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:50,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:24:50,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:24:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:24:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:24:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:24:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:24:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:24:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:24:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:24:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:24:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:24:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:24:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:24:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:24:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:24:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:24:50,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:24:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:24:50,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:24:50,638 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:24:50,692 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:24:50,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:24:50,863 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:24:50,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:24:50,906 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:24:50,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:24:50 BoogieIcfgContainer [2022-03-15 19:24:50,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:24:50,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:24:50,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:24:50,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:24:50,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:24:50" (1/3) ... [2022-03-15 19:24:50,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700d1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:24:50, skipping insertion in model container [2022-03-15 19:24:50,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:24:50" (2/3) ... [2022-03-15 19:24:50,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700d1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:24:50, skipping insertion in model container [2022-03-15 19:24:50,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:24:50" (3/3) ... [2022-03-15 19:24:50,913 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-03-15 19:24:50,916 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:24:50,916 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:24:50,916 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:24:50,916 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:24:50,945 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,945 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,945 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,945 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,946 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,946 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,947 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,948 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,949 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,950 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,950 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,952 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,952 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,952 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,953 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,954 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,954 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,954 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,955 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,955 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,955 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,955 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,956 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,956 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,956 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,958 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,958 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,958 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,958 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,958 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,958 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,959 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,959 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,959 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,959 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,961 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,968 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,968 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,968 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,969 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,969 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,969 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,970 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,970 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,970 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:24:50,973 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:24:51,017 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:24:51,023 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:24:51,024 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:24:51,039 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:24:51,045 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 153 transitions, 330 flow [2022-03-15 19:24:51,047 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 153 transitions, 330 flow [2022-03-15 19:24:51,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-03-15 19:24:51,114 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-03-15 19:24:51,115 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:24:51,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-03-15 19:24:51,120 INFO L116 LiptonReduction]: Number of co-enabled transitions 1320 [2022-03-15 19:24:54,918 INFO L131 LiptonReduction]: Checked pairs total: 1624 [2022-03-15 19:24:54,918 INFO L133 LiptonReduction]: Total number of compositions: 150 [2022-03-15 19:24:54,929 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-03-15 19:24:54,972 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:24:54,984 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:54,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:54,999 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash 28944940, now seen corresponding path program 1 times [2022-03-15 19:24:55,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:55,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988475230] [2022-03-15 19:24:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:55,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:55,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988475230] [2022-03-15 19:24:55,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988475230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:24:55,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:24:55,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:24:55,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [376089604] [2022-03-15 19:24:55,181 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:55,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:55,206 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 244 transitions. [2022-03-15 19:24:55,206 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:55,641 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:24:55,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:24:55,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:24:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:24:55,657 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:55,692 INFO L93 Difference]: Finished difference Result 108 states and 328 transitions. [2022-03-15 19:24:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:24:55,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:24:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:55,700 INFO L225 Difference]: With dead ends: 108 [2022-03-15 19:24:55,700 INFO L226 Difference]: Without dead ends: 108 [2022-03-15 19:24:55,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:24:55,703 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:55,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:24:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-15 19:24:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-03-15 19:24:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 3.0654205607476634) internal successors, (328), 107 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 328 transitions. [2022-03-15 19:24:55,731 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 328 transitions. Word has length 20 [2022-03-15 19:24:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:55,731 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 328 transitions. [2022-03-15 19:24:55,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 328 transitions. [2022-03-15 19:24:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:24:55,732 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:55,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:55,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:24:55,733 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash -198446294, now seen corresponding path program 1 times [2022-03-15 19:24:55,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:55,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71957352] [2022-03-15 19:24:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:55,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:55,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71957352] [2022-03-15 19:24:55,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71957352] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:55,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800023253] [2022-03-15 19:24:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:55,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:55,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:55,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:24:55,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:24:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:55,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:24:55,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:55,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:55,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800023253] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:56,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:24:56,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-03-15 19:24:56,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [543623590] [2022-03-15 19:24:56,001 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:56,003 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:56,031 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 245 transitions. [2022-03-15 19:24:56,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:56,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:24:56,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:24:56,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:24:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:24:56,448 INFO L87 Difference]: Start difference. First operand 108 states and 328 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:56,503 INFO L93 Difference]: Finished difference Result 134 states and 413 transitions. [2022-03-15 19:24:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:24:56,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:24:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:56,505 INFO L225 Difference]: With dead ends: 134 [2022-03-15 19:24:56,505 INFO L226 Difference]: Without dead ends: 134 [2022-03-15 19:24:56,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:24:56,506 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:56,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 7 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:24:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-03-15 19:24:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-03-15 19:24:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-03-15 19:24:56,514 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 21 [2022-03-15 19:24:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:56,515 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-03-15 19:24:56,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-03-15 19:24:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:24:56,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:56,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:56,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:24:56,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:56,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1636597741, now seen corresponding path program 1 times [2022-03-15 19:24:56,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:56,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093638189] [2022-03-15 19:24:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:56,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:56,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093638189] [2022-03-15 19:24:56,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093638189] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:56,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951621213] [2022-03-15 19:24:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:56,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:56,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:56,840 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) [2022-03-15 19:24:56,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:24:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:56,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:24:56,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:56,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:24:57,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951621213] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:57,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:24:57,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-03-15 19:24:57,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275684963] [2022-03-15 19:24:57,064 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:57,068 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:57,086 INFO L252 McrAutomatonBuilder]: Finished intersection with 124 states and 292 transitions. [2022-03-15 19:24:57,086 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:24:57,960 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1372#(or (< 0 ~M~0) (< ~M~0 ~N~0)), 1367#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 1369#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 1368#(< 0 ~M~0), 1371#(or (<= (+ ~M~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 1370#(or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0))] [2022-03-15 19:24:57,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:24:57,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:24:57,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:24:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:24:57,962 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:24:58,130 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2022-03-15 19:24:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:24:58,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:24:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:24:58,133 INFO L225 Difference]: With dead ends: 166 [2022-03-15 19:24:58,133 INFO L226 Difference]: Without dead ends: 166 [2022-03-15 19:24:58,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:24:58,135 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:24:58,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 23 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:24:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-15 19:24:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-03-15 19:24:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2022-03-15 19:24:58,154 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2022-03-15 19:24:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:24:58,154 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2022-03-15 19:24:58,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 12 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:24:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2022-03-15 19:24:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:24:58,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:24:58,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:24:58,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:24:58,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-15 19:24:58,358 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:24:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:24:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash 110041974, now seen corresponding path program 1 times [2022-03-15 19:24:58,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:24:58,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322842635] [2022-03-15 19:24:58,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:24:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:58,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:24:58,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322842635] [2022-03-15 19:24:58,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322842635] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:24:58,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468586872] [2022-03-15 19:24:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:24:58,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:24:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:24:58,644 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) [2022-03-15 19:24:58,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:24:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:24:58,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:24:58,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:24:59,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:24:59,022 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:24:59,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 39 [2022-03-15 19:24:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:59,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:24:59,243 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:24:59,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 87 treesize of output 55 [2022-03-15 19:24:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:24:59,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468586872] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:24:59,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:24:59,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2022-03-15 19:24:59,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1672740762] [2022-03-15 19:24:59,438 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:24:59,442 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:24:59,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 382 transitions. [2022-03-15 19:24:59,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:13,538 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 52 new interpolants: [2046#(and (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min2~0 ~min1~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (= ~min2~0 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= 1 ~N~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0))), 2075#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (< 0 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0)) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< 0 ~M~0) (= ~min2~0 ~min1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 2048#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)), 2071#(or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 2087#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= ~min2~0 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (= ~min2~0 ~min1~0))), 2085#(and (or (= ~min2~0 0) (< 0 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0))) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~A~0.offset 0) (< 0 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0)))), 2058#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0))), 2062#(and (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= 1 ~N~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~min2~0 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 2082#(and (or (< 0 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0))) (or (< 0 ~M~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)))), 2049#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 2076#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= ~min2~0 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min2~0 ~min1~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)))), 2061#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 2040#(and (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~min2~0 ~min1~0))), 2079#(and (or (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~min2~0 ~min1~0))), 2042#(and (or (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)))), 2055#(and (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 2038#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 2065#(and (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0))) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)))), 2086#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= thread1Thread1of1ForFork2_~i~0 0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~M~0 0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0))), 2078#(and (or (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0))), 2064#(and (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)))), 2045#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~M~0 0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 2036#(or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 2072#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)))), 2044#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 2080#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~A~0.offset 0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (= ~min2~0 0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= 1 ~N~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))), 2063#(and (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= 1 ~N~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (= ~min2~0 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 2059#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 2068#(or (< 0 ~M~0) (= ~min2~0 ~min1~0)), 2050#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 2047#(and (or (= ~A~0.offset 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0))) (or (<= (+ ~A~0.offset (* ~M~0 4)) 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~min2~0 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< 1 ~N~0) (not (< 0 ~N~0)))), 2039#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 2041#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (= ~min2~0 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= 1 ~N~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))), 2057#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 2073#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< 0 ~M~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< 0 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< 0 ~M~0) (<= 1 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))), 2083#(and (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0)))), 2066#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 2069#(or (< 0 ~M~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 2052#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)))), 2084#(and (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< 0 ~M~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< 0 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< 0 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< 0 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 2043#(and (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0)))), 2051#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 2081#(and (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= 1 ~N~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~min2~0 0) (< 0 ~M~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0))), 2037#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 2056#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0)) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 2077#(and (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 2054#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 2067#(and (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< 1 ~N~0) (not (< 0 ~N~0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 1 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 0 ~N~0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (< 1 ~N~0) (not (< 0 ~N~0)))), 2053#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0))), 2074#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< 0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 2070#(or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 2060#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))))] [2022-03-15 19:25:13,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 19:25:13,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:13,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 19:25:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=5336, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:25:13,544 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 63 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:30,636 INFO L93 Difference]: Finished difference Result 1570 states and 4823 transitions. [2022-03-15 19:25:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-03-15 19:25:30,636 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 63 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:25:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:30,647 INFO L225 Difference]: With dead ends: 1570 [2022-03-15 19:25:30,647 INFO L226 Difference]: Without dead ends: 1542 [2022-03-15 19:25:30,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12333 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=4838, Invalid=34168, Unknown=0, NotChecked=0, Total=39006 [2022-03-15 19:25:30,656 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1176 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 7193 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 7529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 7193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:30,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1176 Valid, 428 Invalid, 7529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 7193 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 19:25:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-03-15 19:25:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 328. [2022-03-15 19:25:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 3.3577981651376145) internal successors, (1098), 327 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 1098 transitions. [2022-03-15 19:25:30,690 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 1098 transitions. Word has length 23 [2022-03-15 19:25:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:30,690 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 1098 transitions. [2022-03-15 19:25:30,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 63 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 1098 transitions. [2022-03-15 19:25:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:25:30,692 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:30,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:30,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:30,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:30,910 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2040720530, now seen corresponding path program 2 times [2022-03-15 19:25:30,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:30,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164463] [2022-03-15 19:25:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:31,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:31,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164463] [2022-03-15 19:25:31,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:31,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742834163] [2022-03-15 19:25:31,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:25:31,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:31,249 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) [2022-03-15 19:25:31,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:25:31,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:25:31,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:31,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:25:31,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:31,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:31,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-03-15 19:25:31,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:31,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 46 [2022-03-15 19:25:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:31,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:32,128 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_197 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0)))) (<= (+ 2 c_~M~0) c_~N~0)) is different from false [2022-03-15 19:25:32,165 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:32,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 143 treesize of output 111 [2022-03-15 19:25:32,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 60 [2022-03-15 19:25:32,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 54 [2022-03-15 19:25:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:25:32,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742834163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:25:32,529 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:25:32,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2022-03-15 19:25:32,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66017748] [2022-03-15 19:25:32,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:25:32,532 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:25:32,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 240 transitions. [2022-03-15 19:25:32,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:25:36,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [4722#(and (or (<= (+ ~M~0 1) 0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ ~M~0 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 1)) (or (<= (+ ~M~0 1) 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 4723#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)))), 4719#(or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 4721#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 1)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2))), 4724#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0)) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 4720#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0))] [2022-03-15 19:25:36,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:25:36,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:25:36,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:25:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1071, Unknown=1, NotChecked=68, Total=1332 [2022-03-15 19:25:36,150 INFO L87 Difference]: Start difference. First operand 328 states and 1098 transitions. Second operand has 17 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:25:36,909 INFO L93 Difference]: Finished difference Result 631 states and 2036 transitions. [2022-03-15 19:25:36,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:25:36,909 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:25:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:25:36,912 INFO L225 Difference]: With dead ends: 631 [2022-03-15 19:25:36,912 INFO L226 Difference]: Without dead ends: 624 [2022-03-15 19:25:36,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 83 SyntacticMatches, 19 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1481, Unknown=1, NotChecked=80, Total=1806 [2022-03-15 19:25:36,914 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:25:36,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 78 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:25:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-03-15 19:25:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 351. [2022-03-15 19:25:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 3.32) internal successors, (1162), 350 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1162 transitions. [2022-03-15 19:25:36,926 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1162 transitions. Word has length 23 [2022-03-15 19:25:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:25:36,927 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 1162 transitions. [2022-03-15 19:25:36,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:25:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1162 transitions. [2022-03-15 19:25:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:25:36,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:25:36,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:25:36,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:25:37,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:37,143 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:25:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:25:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash -611085098, now seen corresponding path program 3 times [2022-03-15 19:25:37,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:25:37,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509056947] [2022-03-15 19:25:37,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:25:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:25:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:25:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:37,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:25:37,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509056947] [2022-03-15 19:25:37,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509056947] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:25:37,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846767674] [2022-03-15 19:25:37,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:25:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:25:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:25:37,496 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:25:37,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:25:37,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:25:37,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:25:37,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:25:37,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:25:37,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-03-15 19:25:37,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-03-15 19:25:37,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:37,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-03-15 19:25:37,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:25:37,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-03-15 19:25:37,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:25:38,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:38,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 39 [2022-03-15 19:25:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:25:38,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:25:38,144 WARN L838 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_246 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (forall ((v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0)))))) is different from false [2022-03-15 19:25:38,166 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0)))) is different from false [2022-03-15 19:25:38,220 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse2 (forall ((v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (.cse0 (< .cse3 c_~min1~0))) (and (or .cse0 (and (forall ((v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~min1~0 .cse1) (not (< .cse1 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) .cse2))) (or (and (or (= c_~min2~0 .cse3) .cse2) (forall ((v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) .cse4) (not (< .cse4 c_~min2~0)))))) (not .cse0))))) is different from false [2022-03-15 19:25:38,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:38,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 185 [2022-03-15 19:25:38,830 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:38,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3559 treesize of output 3339 [2022-03-15 19:25:38,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3294 treesize of output 3246 [2022-03-15 19:25:38,901 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:38,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3246 treesize of output 3185 [2022-03-15 19:25:38,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3172 treesize of output 3076 [2022-03-15 19:25:38,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3076 treesize of output 2884 [2022-03-15 19:25:38,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2884 treesize of output 2788 [2022-03-15 19:25:38,989 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:25:38,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2788 treesize of output 2705 [2022-03-15 19:25:39,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2692 treesize of output 2596 [2022-03-15 19:25:39,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2596 treesize of output 2548 [2022-03-15 19:25:39,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2548 treesize of output 2404 [2022-03-15 19:25:39,091 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 19:25:39,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2404 treesize of output 2332 [2022-03-15 19:26:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:26:00,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846767674] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:00,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:00,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2022-03-15 19:26:00,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1334898461] [2022-03-15 19:26:00,495 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:00,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:00,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 228 transitions. [2022-03-15 19:26:00,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:05,763 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [6250#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0))), 6245#(or (< 0 ~M~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 6256#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= thread2Thread1of1ForFork0_~i~1 0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6261#(and (or (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6248#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0)) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 6260#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6240#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0))), 6254#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (< 0 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0)) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< 0 ~M~0) (= ~min2~0 ~min1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 6233#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 6241#(and (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 6246#(or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 6251#(and (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6238#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 6258#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 6232#(or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 6249#(and (or (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0)) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)))), 6242#(and (or (= ~min2~0 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)))), 6252#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)))), 6243#(or (< 0 ~M~0) (= ~min2~0 ~min1~0)), 6259#(and (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~A~0.offset 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6257#(and (= ~min2~0 0) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~A~0.offset 0) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min2~0 ~min1~0)) (<= 1 ~N~0)), 6234#(and (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0))), 6236#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0) (<= (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0)), 6253#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< 0 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) 0) (< 0 ~M~0) (= ~min2~0 ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (= ~min2~0 0) (< 0 ~M~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))) (or (< 0 ~M~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0)) (or (< 0 ~M~0) (<= 1 ~N~0) (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 0))), 6239#(and (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)))), 6255#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= ~min2~0 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min2~0 ~min1~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (< 0 ~M~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)))), 6244#(or (< 0 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 6235#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (= ~min2~0 ~min1~0)), 6237#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 6247#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~M~0 0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~min2~0 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= 1 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)))] [2022-03-15 19:26:05,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:26:05,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:05,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:26:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2812, Unknown=4, NotChecked=336, Total=3540 [2022-03-15 19:26:05,764 INFO L87 Difference]: Start difference. First operand 351 states and 1162 transitions. Second operand has 43 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 41 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:07,826 INFO L93 Difference]: Finished difference Result 940 states and 3022 transitions. [2022-03-15 19:26:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:26:07,827 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 41 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:26:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:07,831 INFO L225 Difference]: With dead ends: 940 [2022-03-15 19:26:07,831 INFO L226 Difference]: Without dead ends: 933 [2022-03-15 19:26:07,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=718, Invalid=4692, Unknown=4, NotChecked=438, Total=5852 [2022-03-15 19:26:07,833 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 434 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:07,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 98 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:26:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-03-15 19:26:07,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 353. [2022-03-15 19:26:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 3.3125) internal successors, (1166), 352 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1166 transitions. [2022-03-15 19:26:07,842 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1166 transitions. Word has length 23 [2022-03-15 19:26:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:07,842 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 1166 transitions. [2022-03-15 19:26:07,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.3333333333333335) internal successors, (140), 41 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1166 transitions. [2022-03-15 19:26:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:26:07,843 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:07,844 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:07,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:08,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:08,050 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1205420464, now seen corresponding path program 4 times [2022-03-15 19:26:08,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:08,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995333058] [2022-03-15 19:26:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:08,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:08,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995333058] [2022-03-15 19:26:08,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995333058] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:08,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523513606] [2022-03-15 19:26:08,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:26:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:08,122 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:08,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:26:08,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:26:08,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:08,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:26:08,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:08,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:08,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523513606] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:08,329 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:08,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:26:08,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266081582] [2022-03-15 19:26:08,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:08,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:08,347 INFO L252 McrAutomatonBuilder]: Finished intersection with 111 states and 241 transitions. [2022-03-15 19:26:08,348 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:08,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:26:08,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:26:08,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:26:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:26:08,843 INFO L87 Difference]: Start difference. First operand 353 states and 1166 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:08,955 INFO L93 Difference]: Finished difference Result 684 states and 2269 transitions. [2022-03-15 19:26:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:26:08,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:26:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:08,958 INFO L225 Difference]: With dead ends: 684 [2022-03-15 19:26:08,958 INFO L226 Difference]: Without dead ends: 684 [2022-03-15 19:26:08,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:26:08,959 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:08,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:26:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-03-15 19:26:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 442. [2022-03-15 19:26:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.3401360544217686) internal successors, (1473), 441 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1473 transitions. [2022-03-15 19:26:08,968 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1473 transitions. Word has length 24 [2022-03-15 19:26:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:08,969 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 1473 transitions. [2022-03-15 19:26:08,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1473 transitions. [2022-03-15 19:26:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:26:08,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:08,970 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:08,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 19:26:09,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:09,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1578701709, now seen corresponding path program 5 times [2022-03-15 19:26:09,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:09,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803355860] [2022-03-15 19:26:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:09,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:09,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:09,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803355860] [2022-03-15 19:26:09,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803355860] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:09,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4690102] [2022-03-15 19:26:09,285 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:26:09,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:09,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:09,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:09,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:26:09,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:26:09,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:09,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:26:09,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:09,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:09,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4690102] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:09,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:09,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 19:26:09,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225714845] [2022-03-15 19:26:09,515 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:09,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:09,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 188 states and 472 transitions. [2022-03-15 19:26:09,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:10,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [9822#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 9824#(or (<= ~N~0 (+ ~M~0 1)) (< (+ 2 ~M~0) ~N~0)), 9823#(or (< (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 (+ thread3Thread1of1ForFork1_~i~2 1))), 9821#(< thread3Thread1of1ForFork1_~i~2 ~N~0)] [2022-03-15 19:26:10,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:26:10,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:10,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:26:10,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:26:10,604 INFO L87 Difference]: Start difference. First operand 442 states and 1473 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:10,774 INFO L93 Difference]: Finished difference Result 602 states and 1916 transitions. [2022-03-15 19:26:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:26:10,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:26:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:10,777 INFO L225 Difference]: With dead ends: 602 [2022-03-15 19:26:10,777 INFO L226 Difference]: Without dead ends: 582 [2022-03-15 19:26:10,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 174 SyntacticMatches, 24 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:26:10,778 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 112 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:10,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 32 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:26:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-03-15 19:26:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 526. [2022-03-15 19:26:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 3.295238095238095) internal successors, (1730), 525 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1730 transitions. [2022-03-15 19:26:10,793 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1730 transitions. Word has length 24 [2022-03-15 19:26:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:10,793 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 1730 transitions. [2022-03-15 19:26:10,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:10,793 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1730 transitions. [2022-03-15 19:26:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:26:10,795 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:10,796 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:10,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:11,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:11,012 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1025970719, now seen corresponding path program 6 times [2022-03-15 19:26:11,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:11,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96807518] [2022-03-15 19:26:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:11,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:11,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96807518] [2022-03-15 19:26:11,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96807518] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:11,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859766477] [2022-03-15 19:26:11,071 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:26:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:11,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:11,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:26:11,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:26:11,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:11,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:26:11,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:11,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:11,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859766477] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:11,327 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:11,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-03-15 19:26:11,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1919049542] [2022-03-15 19:26:11,329 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:11,331 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:11,381 INFO L252 McrAutomatonBuilder]: Finished intersection with 183 states and 460 transitions. [2022-03-15 19:26:11,381 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:12,616 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [11643#(or (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= ~N~0 thread1Thread1of1ForFork2_~i~0)), 11644#(or (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)), 11645#(or (<= ~N~0 1) (< 2 ~N~0)), 11642#(< thread1Thread1of1ForFork2_~i~0 ~N~0)] [2022-03-15 19:26:12,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:26:12,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:26:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:26:12,617 INFO L87 Difference]: Start difference. First operand 526 states and 1730 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:12,762 INFO L93 Difference]: Finished difference Result 554 states and 1691 transitions. [2022-03-15 19:26:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:26:12,762 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:26:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:12,765 INFO L225 Difference]: With dead ends: 554 [2022-03-15 19:26:12,765 INFO L226 Difference]: Without dead ends: 509 [2022-03-15 19:26:12,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:26:12,765 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 123 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:12,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 45 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:26:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-03-15 19:26:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 471. [2022-03-15 19:26:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 3.125531914893617) internal successors, (1469), 470 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1469 transitions. [2022-03-15 19:26:12,774 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1469 transitions. Word has length 24 [2022-03-15 19:26:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:12,774 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 1469 transitions. [2022-03-15 19:26:12,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1469 transitions. [2022-03-15 19:26:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:26:12,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:12,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:12,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:12,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-15 19:26:12,993 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1018948493, now seen corresponding path program 1 times [2022-03-15 19:26:12,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:12,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813515764] [2022-03-15 19:26:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:13,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:13,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813515764] [2022-03-15 19:26:13,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813515764] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:13,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362120761] [2022-03-15 19:26:13,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:13,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:13,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:13,071 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:13,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:26:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:13,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:26:13,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:13,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:13,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362120761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:13,308 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:13,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 19:26:13,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1156274709] [2022-03-15 19:26:13,309 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:13,311 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:13,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 378 transitions. [2022-03-15 19:26:13,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:14,649 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [13312#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 13314#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 13307#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13305#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13308#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 13306#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13311#(or (<= ~M~0 0) (< 1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13310#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~M~0 0) (< 1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 13304#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 13317#(or (<= ~N~0 ~M~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 13313#(or (< (+ ~M~0 1) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 ~M~0)), 13303#(< thread3Thread1of1ForFork1_~i~2 ~N~0), 13302#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 13315#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0)), 13309#(or (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 13316#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 ~M~0)), 13318#(or (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0))] [2022-03-15 19:26:14,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:26:14,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:26:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:26:14,651 INFO L87 Difference]: Start difference. First operand 471 states and 1469 transitions. Second operand has 25 states, 25 states have (on average 5.0) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:15,300 INFO L93 Difference]: Finished difference Result 637 states and 1880 transitions. [2022-03-15 19:26:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:26:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.0) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:26:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:15,302 INFO L225 Difference]: With dead ends: 637 [2022-03-15 19:26:15,302 INFO L226 Difference]: Without dead ends: 529 [2022-03-15 19:26:15,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=466, Invalid=1886, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:26:15,303 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 298 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:15,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 104 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:26:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-03-15 19:26:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 429. [2022-03-15 19:26:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.100467289719626) internal successors, (1327), 428 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1327 transitions. [2022-03-15 19:26:15,313 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1327 transitions. Word has length 24 [2022-03-15 19:26:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:15,313 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 1327 transitions. [2022-03-15 19:26:15,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.0) internal successors, (125), 24 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1327 transitions. [2022-03-15 19:26:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:26:15,314 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:15,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:15,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:15,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:26:15,528 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:15,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1067965837, now seen corresponding path program 2 times [2022-03-15 19:26:15,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:15,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304359700] [2022-03-15 19:26:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:15,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:15,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:15,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304359700] [2022-03-15 19:26:15,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304359700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:15,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50795820] [2022-03-15 19:26:15,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:26:15,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:15,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:15,589 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:15,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:26:15,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:26:15,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:15,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:26:15,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:15,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:26:15,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50795820] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:15,775 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:15,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 19:26:15,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457029688] [2022-03-15 19:26:15,775 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:15,777 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:15,799 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 348 transitions. [2022-03-15 19:26:15,799 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:16,743 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [15010#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 15002#(< thread3Thread1of1ForFork1_~i~2 ~N~0), 15005#(or (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 15003#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 15008#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (<= ~M~0 0) (< 1 ~M~0)), 15014#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (<= ~M~0 0) (< 1 ~M~0)), 15006#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 15009#(<= ~M~0 0), 15013#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0) (< (+ thread2Thread1of1ForFork0_~i~1 1) ~M~0) (<= ~M~0 thread2Thread1of1ForFork0_~i~1)), 15012#(<= (+ ~N~0 ~M~0) (+ thread3Thread1of1ForFork1_~i~2 1)), 15011#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (<= ~M~0 0) (< 1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 15004#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 15007#(or (<= ~M~0 0) (< 1 ~M~0))] [2022-03-15 19:26:16,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:26:16,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:26:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:26:16,744 INFO L87 Difference]: Start difference. First operand 429 states and 1327 transitions. Second operand has 21 states, 21 states have (on average 4.809523809523809) internal successors, (101), 20 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:17,032 INFO L93 Difference]: Finished difference Result 383 states and 1154 transitions. [2022-03-15 19:26:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:26:17,032 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.809523809523809) internal successors, (101), 20 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:26:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:17,033 INFO L225 Difference]: With dead ends: 383 [2022-03-15 19:26:17,033 INFO L226 Difference]: Without dead ends: 278 [2022-03-15 19:26:17,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 138 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:26:17,034 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 144 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:17,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 71 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:26:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-03-15 19:26:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 266. [2022-03-15 19:26:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 3.2641509433962264) internal successors, (865), 265 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 865 transitions. [2022-03-15 19:26:17,042 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 865 transitions. Word has length 24 [2022-03-15 19:26:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:17,042 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 865 transitions. [2022-03-15 19:26:17,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.809523809523809) internal successors, (101), 20 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 865 transitions. [2022-03-15 19:26:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:26:17,043 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:17,043 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:17,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 19:26:17,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 19:26:17,262 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1422873571, now seen corresponding path program 7 times [2022-03-15 19:26:17,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:17,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808924354] [2022-03-15 19:26:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:17,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:17,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808924354] [2022-03-15 19:26:17,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808924354] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:17,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928832754] [2022-03-15 19:26:17,319 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:26:17,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:17,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:17,320 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:17,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:26:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:17,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:26:17,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:17,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:17,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928832754] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:17,513 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:17,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-03-15 19:26:17,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445422068] [2022-03-15 19:26:17,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:17,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:17,549 INFO L252 McrAutomatonBuilder]: Finished intersection with 184 states and 461 transitions. [2022-03-15 19:26:17,549 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:19,235 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [16106#(< thread2Thread1of1ForFork0_~i~1 ~M~0), 16112#(or (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 16107#(< 0 ~M~0), 16118#(or (< 0 ~M~0) (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0)), 16117#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< 0 ~M~0)), 16113#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 16114#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 16108#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0)), 16109#(or (< 0 ~M~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0)), 16115#(or (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 16111#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< thread2Thread1of1ForFork0_~i~1 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 16116#(or (< (+ thread3Thread1of1ForFork1_~i~2 1) ~N~0) (< 0 ~M~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)), 16119#(or (< 0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 16110#(or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2))] [2022-03-15 19:26:19,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:26:19,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:26:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:26:19,236 INFO L87 Difference]: Start difference. First operand 266 states and 865 transitions. Second operand has 23 states, 23 states have (on average 5.739130434782608) internal successors, (132), 22 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:19,816 INFO L93 Difference]: Finished difference Result 444 states and 1431 transitions. [2022-03-15 19:26:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:26:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.739130434782608) internal successors, (132), 22 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:26:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:19,819 INFO L225 Difference]: With dead ends: 444 [2022-03-15 19:26:19,819 INFO L226 Difference]: Without dead ends: 444 [2022-03-15 19:26:19,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 177 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1719, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:26:19,819 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 210 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:19,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 116 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:26:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-03-15 19:26:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 319. [2022-03-15 19:26:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 3.251572327044025) internal successors, (1034), 318 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1034 transitions. [2022-03-15 19:26:19,825 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 1034 transitions. Word has length 25 [2022-03-15 19:26:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:19,826 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 1034 transitions. [2022-03-15 19:26:19,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.739130434782608) internal successors, (132), 22 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 1034 transitions. [2022-03-15 19:26:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:26:19,826 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:19,826 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:19,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:20,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:26:20,031 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:26:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash 858609130, now seen corresponding path program 3 times [2022-03-15 19:26:20,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:20,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478107606] [2022-03-15 19:26:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:20,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:20,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478107606] [2022-03-15 19:26:20,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478107606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:20,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068152236] [2022-03-15 19:26:20,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:26:20,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:20,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:20,427 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:26:20,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:26:20,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:26:20,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:20,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:26:20,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:20,924 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:26:20,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 99 [2022-03-15 19:26:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:21,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:22,346 INFO L353 Elim1Store]: treesize reduction 26, result has 67.1 percent of original size [2022-03-15 19:26:22,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 309 treesize of output 169 [2022-03-15 19:26:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:26,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068152236] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:26,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:26,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 28 [2022-03-15 19:26:26,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979175584] [2022-03-15 19:26:26,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:26,046 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:26,079 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 458 transitions. [2022-03-15 19:26:26,080 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:03,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 43 new interpolants: [17450#(and (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (= ~A~0.offset 0) (<= ~N~0 1) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0)) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 1) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (not (< 1 ~N~0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< 2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 1) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (<= ~N~0 1) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0)) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (not (< 1 ~N~0)) (< 2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (<= ~N~0 1) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0))), 17434#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)))) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) ~min2~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0)) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= ~N~0 2))), 17438#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= 2 ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0)) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)))) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= ~N~0 2))), 17422#(and (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)))) (= ~A~0.offset 0) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (<= ~N~0 2)) (or (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (<= 2 ~N~0))), 17442#(and (= ~A~0.offset 0) (or (not (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) 4)) (= ~min2~0 ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (not (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (not (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) 4)) (<= 2 ~N~0)) (<= ~N~0 2) (< 3 (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))), 17452#(and (or (= ~A~0.offset 0) (<= ~N~0 1) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (<= ~N~0 1) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0)) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (< 2 ~N~0)) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (not (< 1 ~N~0)) (< 2 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (not (< 1 ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 1) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0))), 17432#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 2)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0))), 17441#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~N~0 2)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0)) (or (= ~A~0.offset 0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))))), 17433#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 2)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)))), 17443#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (<= 2 ~N~0) (<= ~N~0 2) (= thread1Thread1of1ForFork2_~i~0 0) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) 1) 0) (= ~min2~0 ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))), 17440#(and (or (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~N~0 2)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (= ~A~0.offset 0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)))) (or (= (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 4))) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0)) (or (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= 2 ~N~0))), 17414#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 17444#(and (or (not (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 ~min1~0)) (= ~A~0.offset 0) (or (not (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0))) (or (not (= (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset) 4)) (<= 2 ~N~0)) (<= ~N~0 2) (< 3 (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))), 17424#(and (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (<= ~N~0 2)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= 2 ~N~0))), 17436#(and (or (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (= ~A~0.offset 0) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)))) (<= 2 ~N~0) (<= ~N~0 2) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)))), 17428#(and (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 2)) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0))), 17449#(and (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (< 2 ~N~0)) (or (= ~A~0.offset 0) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< 2 ~N~0)) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (<= ~N~0 1) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 2 ~N~0))), 17413#(or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 17430#(and (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)))) (or (= ~A~0.offset 0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~N~0 2)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= 2 ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 17418#(and (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 2)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0))), 17453#(and (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 1) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0)) (or (= ~A~0.offset 0) (<= ~N~0 1) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (<= ~N~0 1) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< 2 ~N~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0)) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (< 2 ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4)))), 17415#(and (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~min2~0 ~min1~0))), 17416#(and (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)))), 17448#(and (or (= ~A~0.offset 0) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 2 ~N~0)) (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0)) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (not (< 1 ~N~0)) (< 2 ~N~0))), 17429#(and (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (<= ~N~0 2)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 ~min1~0)) (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= 2 ~N~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 17417#(and (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0))), 17420#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (= ~A~0.offset 0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= 2 ~N~0)) (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~N~0 2)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 17437#(and (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 2)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)))) (or (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0))), 17446#(and (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0)) (or (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0)) (not (< 1 ~N~0)) (< 2 ~N~0))), 17451#(and (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0)) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 1) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (<= ~N~0 1) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (<= ~N~0 1) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0)) (or (= ~A~0.offset 0) (<= ~N~0 1) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 4)) (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) (< 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (<= ~N~0 1) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 4)) (< 2 ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) ~min2~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (< 2 ~N~0)) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (< 2 ~N~0)) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (<= ~N~0 1) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< 2 ~N~0))), 17447#(and (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (< 2 ~N~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0) (= ~min2~0 ~min1~0) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (< thread3Thread1of1ForFork1_~i~2 ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) ~min1~0)) (not (< 1 ~N~0)) (< 2 ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< thread3Thread1of1ForFork1_~i~2 ~N~0) (not (< 1 ~N~0)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2 ~N~0))), 17423#(and (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (= ~A~0.offset 0) (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~N~0 2)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)))) (or (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (< thread1Thread1of1ForFork2_~i~0 ~N~0) (<= 2 ~N~0))), 17439#(and (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)))) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (= ~A~0.offset 0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~N~0 2)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) ~min2~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)))) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= 2 ~N~0))), 17435#(and (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= 2 ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= ~N~0 2))), 17427#(and (= ~A~0.offset 0) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 ~min1~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (<= ~N~0 2)) (or (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (<= 2 ~N~0))), 17351#(or (not (< thread3Thread1of1ForFork1_~i~2 ~N~0)) (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0)) (or (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0))))), 17425#(and (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= ~A~0.offset 0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0)) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (or (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~N~0 2)) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) ~min1~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (= ~min2~0 ~min1~0) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= 2 ~N~0)) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (<= (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset 4))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 (+ thread1Thread1of1ForFork2_~i~0 1)) (< (+ 2 thread1Thread1of1ForFork2_~i~0) ~N~0) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 17412#(or (< thread1Thread1of1ForFork2_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 17426#(and (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0)) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2))), 17419#(and (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4) (<= ~N~0 2)) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (= ~min2~0 ~min1~0)) (or (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 1) ~min2~0) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0)) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)))) (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (= (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset) 4)) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (= ~A~0.offset 0) (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0)) (or (not (< thread1Thread1of1ForFork2_~i~0 ~N~0)) (< 3 (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (< (+ thread1Thread1of1ForFork2_~i~0 1) ~N~0) (<= 2 ~N~0))), 17445#(and (= ~min1~0 0) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) ~min1~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~A~0.offset 0) (<= 2 ~N~0) (<= ~N~0 2) (= thread1Thread1of1ForFork2_~i~0 0) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset)) 1) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 ~min1~0)) (or (<= 0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min2~0) (= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~A~0.offset))))), 17421#(and (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0) (= ~min2~0 ~min1~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) ~min2~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (<= ~N~0 thread3Thread1of1ForFork1_~i~2)) (or (<= (+ 2 thread3Thread1of1ForFork1_~i~2) ~N~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (<= ~N~0 thread3Thread1of1ForFork1_~i~2))), 17431#(and (or (<= ~min2~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (= ~A~0.offset 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 4)) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 4))) (or (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* (div (+ ~A~0.offset (- 4)) (- 4)) 4) ~A~0.offset)) 1) (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (= ~min1~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset))) (not (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0))) (<= 2 ~N~0) (or (= ~min2~0 ~min1~0) (<= (+ (select (select |#memory_int| ~A~0.base) 4) 1) ~min2~0) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) ~min2~0)) (<= ~N~0 2))] [2022-03-15 19:27:03,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 19:27:03,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 19:27:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=4659, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:27:03,996 INFO L87 Difference]: Start difference. First operand 319 states and 1034 transitions. Second operand has 57 states, 56 states have (on average 3.642857142857143) internal successors, (204), 56 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:30:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:30:32,658 INFO L93 Difference]: Finished difference Result 5686 states and 16833 transitions. [2022-03-15 19:30:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 368 states. [2022-03-15 19:30:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.642857142857143) internal successors, (204), 56 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:30:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:30:32,682 INFO L225 Difference]: With dead ends: 5686 [2022-03-15 19:30:32,683 INFO L226 Difference]: Without dead ends: 5518 [2022-03-15 19:30:32,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 113 SyntacticMatches, 28 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76638 ImplicationChecksByTransitivity, 203.0s TimeCoverageRelationStatistics Valid=21517, Invalid=163813, Unknown=0, NotChecked=0, Total=185330 [2022-03-15 19:30:32,702 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2370 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 10401 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 10941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 10401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:30:32,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2370 Valid, 893 Invalid, 10941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 10401 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-03-15 19:30:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2022-03-15 19:30:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 1169. [2022-03-15 19:30:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 3.988013698630137) internal successors, (4658), 1168 states have internal predecessors, (4658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:30:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 4658 transitions. [2022-03-15 19:30:32,792 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 4658 transitions. Word has length 26 [2022-03-15 19:30:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:30:32,792 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 4658 transitions. [2022-03-15 19:30:32,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.642857142857143) internal successors, (204), 56 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:30:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 4658 transitions. [2022-03-15 19:30:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:30:32,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:30:32,796 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:30:32,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:30:33,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:30:33,012 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:30:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:30:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash -361991574, now seen corresponding path program 4 times [2022-03-15 19:30:33,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:30:33,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87011247] [2022-03-15 19:30:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:30:33,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:30:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:30:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:30:33,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:30:33,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87011247] [2022-03-15 19:30:33,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87011247] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:30:33,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170668662] [2022-03-15 19:30:33,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:30:33,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:30:33,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:30:33,739 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:30:33,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:30:33,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:30:33,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:30:33,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:30:33,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:30:33,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-03-15 19:30:33,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-03-15 19:30:34,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-03-15 19:30:34,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-03-15 19:30:34,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:30:34,702 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:30:34,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 81 [2022-03-15 19:30:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:30:34,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:30:39,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= 2 ~M~0) (and (forall ((v_ArrVal_619 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~A~0.base))) (let ((.cse6 (select .cse10 c_~A~0.offset))) (or (let ((.cse9 (select .cse10 (+ (* c_thread2Thread1of1ForFork0_~i~1 4) c_~A~0.offset))) (.cse5 (select .cse10 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse7 (< .cse9 .cse5)) (.cse3 (select .cse10 (+ c_~A~0.offset 4)))) (let ((.cse0 (< .cse3 .cse6)) (.cse1 (not .cse7)) (.cse2 (< .cse5 c_~min2~0))) (and (or (not .cse0) (and .cse1 (or .cse2 (= c_~min2~0 .cse3)))) (or .cse0 (let ((.cse4 (= .cse9 .cse6))) (and (or (and (or .cse1 .cse4) (or (= .cse5 .cse6) .cse7)) (not .cse2)) (or .cse2 (let ((.cse8 (< .cse9 c_~min2~0))) (and (or (= c_~min2~0 .cse6) .cse8) (or .cse4 (not .cse8)))))))))))) (not (< .cse6 c_~min1~0)))))) (forall ((v_ArrVal_619 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~A~0.base))) (or (< (select .cse11 c_~A~0.offset) c_~min1~0) (let ((.cse18 (select .cse11 (+ (* c_thread2Thread1of1ForFork0_~i~1 4) c_~A~0.offset))) (.cse13 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse14 (< .cse18 .cse13)) (.cse20 (select .cse11 (+ c_~A~0.offset 4)))) (let ((.cse19 (< .cse20 c_~min1~0)) (.cse15 (not .cse14)) (.cse12 (< .cse13 c_~min2~0))) (and (or (let ((.cse16 (= c_~min1~0 .cse18))) (and (or (not .cse12) (and (or (= c_~min1~0 .cse13) .cse14) (or .cse15 .cse16))) (or .cse12 (let ((.cse17 (< .cse18 c_~min2~0))) (and (or (not .cse17) .cse16) (or (= c_~min2~0 c_~min1~0) .cse17)))))) .cse19) (or (not .cse19) (and .cse15 (or .cse12 (= c_~min2~0 .cse20)))))))))))) (<= ~M~0 0))) is different from false [2022-03-15 19:30:46,646 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:30:46,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 755 treesize of output 468 [2022-03-15 19:30:46,708 INFO L353 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-03-15 19:30:46,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36009 treesize of output 34337 [2022-03-15 19:30:47,065 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-03-15 19:30:47,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34308 treesize of output 33321 [2022-03-15 19:30:47,381 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-03-15 19:30:47,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 33316 treesize of output 31337 [2022-03-15 19:30:47,661 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-03-15 19:30:47,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 31332 treesize of output 27369 [2022-03-15 19:30:47,987 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-03-15 19:30:47,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27364 treesize of output 26921 [2022-03-15 19:30:48,292 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-03-15 19:30:48,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 26916 treesize of output 26809 [2022-03-15 19:30:48,416 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 19:30:48,602 INFO L353 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-03-15 19:30:48,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 26804 treesize of output 26585 [2022-03-15 19:30:49,000 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 19:30:49,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 19:30:49,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:30:49,214 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-03-15 19:30:49,217 INFO L158 Benchmark]: Toolchain (without parser) took 358977.73ms. Allocated memory was 197.1MB in the beginning and 857.7MB in the end (delta: 660.6MB). Free memory was 144.9MB in the beginning and 583.7MB in the end (delta: -438.8MB). Peak memory consumption was 550.3MB. Max. memory is 8.0GB. [2022-03-15 19:30:49,217 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:30:49,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.98ms. Allocated memory is still 197.1MB. Free memory was 144.7MB in the beginning and 170.8MB in the end (delta: -26.1MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. [2022-03-15 19:30:49,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.30ms. Allocated memory is still 197.1MB. Free memory was 170.8MB in the beginning and 169.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:30:49,218 INFO L158 Benchmark]: Boogie Preprocessor took 17.29ms. Allocated memory is still 197.1MB. Free memory was 169.1MB in the beginning and 167.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:30:49,218 INFO L158 Benchmark]: RCFGBuilder took 323.02ms. Allocated memory is still 197.1MB. Free memory was 167.6MB in the beginning and 149.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-15 19:30:49,218 INFO L158 Benchmark]: TraceAbstraction took 358308.24ms. Allocated memory was 197.1MB in the beginning and 857.7MB in the end (delta: 660.6MB). Free memory was 148.8MB in the beginning and 583.7MB in the end (delta: -434.9MB). Peak memory consumption was 554.8MB. Max. memory is 8.0GB. [2022-03-15 19:30:49,219 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.98ms. Allocated memory is still 197.1MB. Free memory was 144.7MB in the beginning and 170.8MB in the end (delta: -26.1MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.30ms. Allocated memory is still 197.1MB. Free memory was 170.8MB in the beginning and 169.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.29ms. Allocated memory is still 197.1MB. Free memory was 169.1MB in the beginning and 167.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 323.02ms. Allocated memory is still 197.1MB. Free memory was 167.6MB in the beginning and 149.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 358308.24ms. Allocated memory was 197.1MB in the beginning and 857.7MB in the end (delta: 660.6MB). Free memory was 148.8MB in the beginning and 583.7MB in the end (delta: -434.9MB). Peak memory consumption was 554.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 151 PlacesBefore, 34 PlacesAfterwards, 153 TransitionsBefore, 28 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 8 FixpointIterations, 92 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 150 TotalNumberOfCompositions, 1624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1472, positive: 1436, positive conditional: 0, positive unconditional: 1436, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 709, positive: 698, positive conditional: 0, positive unconditional: 698, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1472, positive: 738, positive conditional: 0, positive unconditional: 738, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 709, unknown conditional: 0, unknown unconditional: 709] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 19:30:49,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...