/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:46:23,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:46:23,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:46:23,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:46:23,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:46:23,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:46:23,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:46:23,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:46:23,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:46:23,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:46:23,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:46:23,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:46:23,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:46:23,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:46:23,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:46:23,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:46:23,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:46:23,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:46:23,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:46:23,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:46:23,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:46:23,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:46:23,845 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:46:23,845 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:46:23,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2025-04-13 18:46:25,090 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd841cd8/3e3da0f29dc4479c99a94f81a434e246/FLAG1b0d6394c [2025-04-13 18:46:25,272 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:46:25,273 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2025-04-13 18:46:25,278 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd841cd8/3e3da0f29dc4479c99a94f81a434e246/FLAG1b0d6394c [2025-04-13 18:46:26,290 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd841cd8/3e3da0f29dc4479c99a94f81a434e246 [2025-04-13 18:46:26,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:46:26,293 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:46:26,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:46:26,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:46:26,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:46:26,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5fee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26, skipping insertion in model container [2025-04-13 18:46:26,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:46:26,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2862,2875] [2025-04-13 18:46:26,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:46:26,468 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:46:26,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2862,2875] [2025-04-13 18:46:26,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:46:26,513 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:46:26,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26 WrapperNode [2025-04-13 18:46:26,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:46:26,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:46:26,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:46:26,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:46:26,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,549 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-04-13 18:46:26,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:46:26,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:46:26,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:46:26,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:46:26,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,580 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-13 18:46:26,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:46:26,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:46:26,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:46:26,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:46:26,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (1/1) ... [2025-04-13 18:46:26,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:46:26,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:26,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:46:26,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:46:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:46:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:46:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:46:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:46:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:46:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:46:26,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:46:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:46:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:46:26,644 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:46:26,726 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:46:26,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:46:27,074 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:46:27,075 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:46:27,075 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:46:27,352 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:46:27,356 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:46:27,359 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:46:27,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:46:27 BoogieIcfgContainer [2025-04-13 18:46:27,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:46:27,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:46:27,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:46:27,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:46:27,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:46:26" (1/3) ... [2025-04-13 18:46:27,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fa4664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:46:27, skipping insertion in model container [2025-04-13 18:46:27,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:46:26" (2/3) ... [2025-04-13 18:46:27,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fa4664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:46:27, skipping insertion in model container [2025-04-13 18:46:27,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:46:27" (3/3) ... [2025-04-13 18:46:27,366 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-04-13 18:46:27,377 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:46:27,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 29 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 18:46:27,379 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:46:27,430 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:46:27,452 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 38 transitions, 97 flow [2025-04-13 18:46:27,490 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:27,516 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:46:27,525 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dbf0c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:46:27,526 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:46:27,529 INFO L278 IsEmpty]: Start isEmpty. Operand has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:27,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:46:27,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:27,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:27,539 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:27,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1315393323, now seen corresponding path program 1 times [2025-04-13 18:46:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:27,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393236437] [2025-04-13 18:46:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:27,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:46:27,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:46:27,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:27,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:27,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:27,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393236437] [2025-04-13 18:46:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393236437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:27,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:46:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846660549] [2025-04-13 18:46:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:27,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:46:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:27,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:46:27,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:46:27,905 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 0 states have call successors, (0), 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.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:28,015 INFO L93 Difference]: Finished difference Result 421 states and 1633 transitions. [2025-04-13 18:46:28,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:46:28,016 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 18:46:28,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:28,026 INFO L225 Difference]: With dead ends: 421 [2025-04-13 18:46:28,027 INFO L226 Difference]: Without dead ends: 212 [2025-04-13 18:46:28,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:46:28,033 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:28,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-04-13 18:46:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-04-13 18:46:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 3.876777251184834) internal successors, (818), 211 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 818 transitions. [2025-04-13 18:46:28,076 INFO L79 Accepts]: Start accepts. Automaton has 212 states and 818 transitions. Word has length 18 [2025-04-13 18:46:28,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:28,076 INFO L485 AbstractCegarLoop]: Abstraction has 212 states and 818 transitions. [2025-04-13 18:46:28,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,076 INFO L278 IsEmpty]: Start isEmpty. Operand 212 states and 818 transitions. [2025-04-13 18:46:28,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:46:28,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:28,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:28,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:46:28,079 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:28,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:28,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1046613936, now seen corresponding path program 1 times [2025-04-13 18:46:28,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:28,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939121365] [2025-04-13 18:46:28,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:28,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:46:28,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:46:28,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:28,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:46:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:28,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939121365] [2025-04-13 18:46:28,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939121365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:28,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:28,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:46:28,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499803793] [2025-04-13 18:46:28,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:28,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:46:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:28,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:46:28,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:28,230 INFO L87 Difference]: Start difference. First operand 212 states and 818 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:28,325 INFO L93 Difference]: Finished difference Result 422 states and 1634 transitions. [2025-04-13 18:46:28,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:46:28,326 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-04-13 18:46:28,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:28,329 INFO L225 Difference]: With dead ends: 422 [2025-04-13 18:46:28,330 INFO L226 Difference]: Without dead ends: 214 [2025-04-13 18:46:28,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:46:28,332 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:28,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-13 18:46:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-04-13 18:46:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 3.8497652582159625) internal successors, (820), 213 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 820 transitions. [2025-04-13 18:46:28,351 INFO L79 Accepts]: Start accepts. Automaton has 214 states and 820 transitions. Word has length 19 [2025-04-13 18:46:28,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:28,351 INFO L485 AbstractCegarLoop]: Abstraction has 214 states and 820 transitions. [2025-04-13 18:46:28,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,352 INFO L278 IsEmpty]: Start isEmpty. Operand 214 states and 820 transitions. [2025-04-13 18:46:28,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:46:28,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:28,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:28,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:46:28,355 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:28,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash -633809020, now seen corresponding path program 1 times [2025-04-13 18:46:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:28,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898593141] [2025-04-13 18:46:28,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:28,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:46:28,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:46:28,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:28,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:46:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:28,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898593141] [2025-04-13 18:46:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898593141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:28,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:28,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:46:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275498375] [2025-04-13 18:46:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:28,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:46:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:28,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:46:28,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:46:28,516 INFO L87 Difference]: Start difference. First operand 214 states and 820 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:28,598 INFO L93 Difference]: Finished difference Result 332 states and 1271 transitions. [2025-04-13 18:46:28,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:46:28,599 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 [2025-04-13 18:46:28,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:28,602 INFO L225 Difference]: With dead ends: 332 [2025-04-13 18:46:28,602 INFO L226 Difference]: Without dead ends: 301 [2025-04-13 18:46:28,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:46:28,603 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:28,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-13 18:46:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2025-04-13 18:46:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.800738007380074) internal successors, (1030), 271 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 1030 transitions. [2025-04-13 18:46:28,625 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 1030 transitions. Word has length 21 [2025-04-13 18:46:28,626 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:28,626 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 1030 transitions. [2025-04-13 18:46:28,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,626 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 1030 transitions. [2025-04-13 18:46:28,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:46:28,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:28,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:28,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:46:28,629 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:28,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1335626316, now seen corresponding path program 1 times [2025-04-13 18:46:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:28,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091004401] [2025-04-13 18:46:28,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:28,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 18:46:28,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 18:46:28,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:28,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:46:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:28,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091004401] [2025-04-13 18:46:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091004401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:46:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417440102] [2025-04-13 18:46:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:28,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:46:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:28,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:46:28,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:46:28,722 INFO L87 Difference]: Start difference. First operand 272 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:28,800 INFO L93 Difference]: Finished difference Result 402 states and 1379 transitions. [2025-04-13 18:46:28,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:46:28,800 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 [2025-04-13 18:46:28,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:28,802 INFO L225 Difference]: With dead ends: 402 [2025-04-13 18:46:28,802 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 18:46:28,803 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:46:28,803 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:28,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 18:46:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 272. [2025-04-13 18:46:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.7527675276752768) internal successors, (1017), 271 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 1017 transitions. [2025-04-13 18:46:28,823 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 1017 transitions. Word has length 25 [2025-04-13 18:46:28,823 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:28,823 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 1017 transitions. [2025-04-13 18:46:28,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,823 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 1017 transitions. [2025-04-13 18:46:28,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 18:46:28,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:28,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:28,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:46:28,825 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:28,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1057684042, now seen corresponding path program 2 times [2025-04-13 18:46:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:28,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994241380] [2025-04-13 18:46:28,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:46:28,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:28,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 18:46:28,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-04-13 18:46:28,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:46:28,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:46:28,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:28,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994241380] [2025-04-13 18:46:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994241380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:28,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:28,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:46:28,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199315269] [2025-04-13 18:46:28,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:28,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:46:28,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:28,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:46:28,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:28,896 INFO L87 Difference]: Start difference. First operand 272 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:28,994 INFO L93 Difference]: Finished difference Result 388 states and 1415 transitions. [2025-04-13 18:46:28,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:46:28,995 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 [2025-04-13 18:46:28,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:28,997 INFO L225 Difference]: With dead ends: 388 [2025-04-13 18:46:28,997 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 18:46:28,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:28,998 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:29,001 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 18:46:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 272. [2025-04-13 18:46:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.5719557195571956) internal successors, (968), 271 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 968 transitions. [2025-04-13 18:46:29,019 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 968 transitions. Word has length 25 [2025-04-13 18:46:29,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:29,019 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 968 transitions. [2025-04-13 18:46:29,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:29,019 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 968 transitions. [2025-04-13 18:46:29,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:46:29,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:29,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:29,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:46:29,022 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:29,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2052188279, now seen corresponding path program 1 times [2025-04-13 18:46:29,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:29,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031735156] [2025-04-13 18:46:29,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:29,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:29,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:46:29,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:29,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:29,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:46:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:29,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031735156] [2025-04-13 18:46:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031735156] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:29,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368646791] [2025-04-13 18:46:29,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:29,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:29,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:29,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:46:29,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:46:29,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:46:29,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:46:29,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:29,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:29,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:46:29,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:46:29,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:46:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:46:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368646791] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:46:29,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:46:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-13 18:46:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223718109] [2025-04-13 18:46:29,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:46:29,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:46:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:29,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:46:29,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:46:29,381 INFO L87 Difference]: Start difference. First operand 272 states and 968 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:29,539 INFO L93 Difference]: Finished difference Result 546 states and 1942 transitions. [2025-04-13 18:46:29,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:46:29,539 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 18:46:29,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:29,541 INFO L225 Difference]: With dead ends: 546 [2025-04-13 18:46:29,541 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 18:46:29,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:46:29,542 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:29,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 18:46:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-04-13 18:46:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.5437956204379564) internal successors, (971), 274 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 971 transitions. [2025-04-13 18:46:29,557 INFO L79 Accepts]: Start accepts. Automaton has 275 states and 971 transitions. Word has length 27 [2025-04-13 18:46:29,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:29,557 INFO L485 AbstractCegarLoop]: Abstraction has 275 states and 971 transitions. [2025-04-13 18:46:29,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:29,558 INFO L278 IsEmpty]: Start isEmpty. Operand 275 states and 971 transitions. [2025-04-13 18:46:29,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:46:29,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:29,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:29,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:46:29,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 18:46:29,763 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:29,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 651307670, now seen corresponding path program 2 times [2025-04-13 18:46:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:29,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393647758] [2025-04-13 18:46:29,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:46:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:29,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:46:29,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-13 18:46:29,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:46:29,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:46:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:29,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393647758] [2025-04-13 18:46:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393647758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:29,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:46:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766901820] [2025-04-13 18:46:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:29,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:46:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:29,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:46:29,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:29,860 INFO L87 Difference]: Start difference. First operand 275 states and 971 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:29,988 INFO L93 Difference]: Finished difference Result 574 states and 1969 transitions. [2025-04-13 18:46:29,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:46:29,989 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2025-04-13 18:46:29,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:29,991 INFO L225 Difference]: With dead ends: 574 [2025-04-13 18:46:29,991 INFO L226 Difference]: Without dead ends: 421 [2025-04-13 18:46:29,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:29,992 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:29,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 14 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-13 18:46:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 307. [2025-04-13 18:46:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 3.5359477124183005) internal successors, (1082), 306 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 1082 transitions. [2025-04-13 18:46:30,020 INFO L79 Accepts]: Start accepts. Automaton has 307 states and 1082 transitions. Word has length 30 [2025-04-13 18:46:30,021 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:30,021 INFO L485 AbstractCegarLoop]: Abstraction has 307 states and 1082 transitions. [2025-04-13 18:46:30,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,021 INFO L278 IsEmpty]: Start isEmpty. Operand 307 states and 1082 transitions. [2025-04-13 18:46:30,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:46:30,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:30,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:30,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:46:30,022 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:30,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1876698422, now seen corresponding path program 3 times [2025-04-13 18:46:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:30,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822638225] [2025-04-13 18:46:30,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:46:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:30,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:46:30,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-13 18:46:30,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:46:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:46:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:30,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822638225] [2025-04-13 18:46:30,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822638225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:30,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:30,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:46:30,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366408459] [2025-04-13 18:46:30,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:30,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:46:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:30,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:46:30,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:46:30,128 INFO L87 Difference]: Start difference. First operand 307 states and 1082 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:30,284 INFO L93 Difference]: Finished difference Result 525 states and 1986 transitions. [2025-04-13 18:46:30,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:46:30,285 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2025-04-13 18:46:30,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:30,288 INFO L225 Difference]: With dead ends: 525 [2025-04-13 18:46:30,288 INFO L226 Difference]: Without dead ends: 453 [2025-04-13 18:46:30,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:46:30,289 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:30,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 16 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-04-13 18:46:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 349. [2025-04-13 18:46:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.5833333333333335) internal successors, (1247), 348 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1247 transitions. [2025-04-13 18:46:30,316 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1247 transitions. Word has length 30 [2025-04-13 18:46:30,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:30,317 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1247 transitions. [2025-04-13 18:46:30,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,317 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1247 transitions. [2025-04-13 18:46:30,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 18:46:30,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:30,320 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:30,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:46:30,321 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:30,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1971302266, now seen corresponding path program 4 times [2025-04-13 18:46:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:30,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75666303] [2025-04-13 18:46:30,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:46:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:30,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 18:46:30,342 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 18:46:30,343 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:46:30,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 18:46:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:30,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75666303] [2025-04-13 18:46:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75666303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:46:30,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:46:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:46:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871258353] [2025-04-13 18:46:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:46:30,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:46:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:30,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:46:30,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:46:30,370 INFO L87 Difference]: Start difference. First operand 349 states and 1247 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:30,499 INFO L93 Difference]: Finished difference Result 531 states and 1927 transitions. [2025-04-13 18:46:30,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:46:30,500 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2025-04-13 18:46:30,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:30,503 INFO L225 Difference]: With dead ends: 531 [2025-04-13 18:46:30,503 INFO L226 Difference]: Without dead ends: 459 [2025-04-13 18:46:30,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:46:30,504 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:30,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:46:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-04-13 18:46:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 349. [2025-04-13 18:46:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.5833333333333335) internal successors, (1247), 348 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1247 transitions. [2025-04-13 18:46:30,533 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1247 transitions. Word has length 30 [2025-04-13 18:46:30,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:30,533 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1247 transitions. [2025-04-13 18:46:30,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:46:30,534 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1247 transitions. [2025-04-13 18:46:30,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:46:30,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:30,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:46:30,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:46:30,535 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:46:30,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1261861341, now seen corresponding path program 1 times [2025-04-13 18:46:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:30,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161954147] [2025-04-13 18:46:30,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:30,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:46:30,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:46:30,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:30,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:32,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161954147] [2025-04-13 18:46:32,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161954147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:32,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185818484] [2025-04-13 18:46:32,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:46:32,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:32,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:32,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:46:32,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:46:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:46:33,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:46:33,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:33,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:33,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 18:46:33,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:33,563 INFO L325 Elim1Store]: treesize reduction 80, result has 60.2 percent of original size [2025-04-13 18:46:33,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 171 [2025-04-13 18:46:48,539 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse33 (+ c_~C~0.offset 8)) (.cse506 (select |c_#memory_int#1| c_~C~0.base)) (.cse21 (+ c_~C~0.offset 4))) (let ((.cse2 (select .cse506 .cse21)) (.cse18 (select .cse506 c_~C~0.offset)) (.cse0 (select .cse506 .cse33))) (let ((.cse180 (* 2 .cse0)) (.cse477 (* .cse18 2)) (.cse504 (+ .cse0 1)) (.cse4 (+ .cse2 1)) (.cse505 (+ c_~maxa~0 c_~maxb~0)) (.cse65 (div (* (- 1) .cse2) 2))) (let ((.cse443 (= .cse18 c_~maxa~0)) (.cse478 (+ .cse65 c_~maxa~0)) (.cse51 (<= .cse4 .cse505)) (.cse49 (<= .cse18 c_~maxb~0)) (.cse23 (= .cse505 .cse2)) (.cse233 (<= .cse504 c_~maxa~0)) (.cse183 (+ c_~maxa~0 .cse0)) (.cse230 (= c_~maxa~0 .cse0)) (.cse280 (<= .cse477 .cse2)) (.cse8 (<= .cse18 c_~maxa~0)) (.cse483 (+ .cse18 c_~maxa~0)) (.cse281 (+ .cse18 1)) (.cse100 (+ .cse18 c_~maxb~0)) (.cse181 (* 2 c_~maxb~0)) (.cse37 (+ .cse0 c_~maxc~0)) (.cse48 (+ .cse18 .cse0)) (.cse485 (<= .cse2 .cse180)) (.cse35 (= c_~maxb~0 .cse0)) (.cse41 (<= .cse504 c_~maxb~0)) (.cse484 (+ c_~maxb~0 .cse0))) (let ((.cse10 (or (and .cse485 .cse35) (and .cse41 (<= .cse2 .cse484)))) (.cse6 (<= .cse48 .cse2)) (.cse11 (<= .cse37 (+ .cse18 .cse2))) (.cse182 (* 2 c_~maxa~0)) (.cse52 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse502 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse501 (select |c_#memory_int#1| ~A~0.base)) (.cse503 (+ ~B~0.offset 4)) (.cse500 (select .cse502 ~B~0.offset))) (and (<= .cse500 c_~maxb~0) (= (+ c_~maxb~0 (select .cse501 (+ ~A~0.offset 4))) .cse2) (= .cse500 (select .cse501 ~A~0.offset)) (= (+ .cse500 c_~maxb~0) .cse2) (not (= ~A~0.base ~B~0.base)) (= c_~maxb~0 (select .cse502 .cse503)) (not (= ~A~0.offset .cse503)) (<= c_~maxc~0 (* .cse500 2))))))) (.cse90 (= .cse2 .cse181)) (.cse96 (= .cse100 .cse2)) (.cse86 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse499 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse498 (select |c_#memory_int#1| ~A~0.base)) (.cse497 (select .cse499 ~B~0.offset))) (and (= .cse497 c_~maxb~0) (= (+ c_~maxb~0 (select .cse498 (+ ~A~0.offset 4))) .cse2) (= .cse497 (select .cse498 ~A~0.offset)) (= (+ .cse497 c_~maxb~0) .cse2) (not (= ~B~0.offset ~A~0.offset)) (= c_~maxb~0 (select .cse499 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse497 2))))))) (.cse220 (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse496 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse495 (select .cse496 ~A~0.offset))) (and (= .cse2 (+ .cse0 .cse495)) (not (= ~A~0.offset .cse21)) (<= .cse495 c_~maxb~0) (<= c_~maxc~0 (* 2 .cse495)) (= (+ (select .cse496 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse41)) (.cse223 (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse494 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse493 (select .cse494 ~A~0.offset))) (and (= .cse2 (+ .cse0 .cse493)) (not (= ~A~0.offset .cse21)) (<= .cse493 .cse0) (<= c_~maxc~0 (* 2 .cse493)) (= (+ (select .cse494 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35)) (.cse251 (<= .cse281 c_~maxb~0)) (.cse252 (or (and .cse280 (= .cse483 .cse2)) (and .cse8 (<= .cse4 .cse483)))) (.cse160 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse492 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse491 (select |c_#memory_int#1| ~A~0.base)) (.cse490 (select .cse492 ~B~0.offset))) (and (= .cse490 c_~maxb~0) (= (+ c_~maxb~0 (select .cse491 (+ ~A~0.offset 4))) .cse2) (= .cse490 (select .cse491 ~A~0.offset)) (= (+ .cse490 c_~maxb~0) .cse2) (not (= ~A~0.base ~B~0.base)) (= c_~maxb~0 (select .cse492 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse490 2))))))) (.cse22 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse488 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse487 (select |c_#memory_int#1| ~A~0.base)) (.cse489 (+ ~B~0.offset 4)) (.cse486 (select .cse488 ~B~0.offset))) (and (<= .cse486 c_~maxb~0) (= (+ c_~maxb~0 (select .cse487 (+ ~A~0.offset 4))) .cse2) (= .cse486 (select .cse487 ~A~0.offset)) (= (+ .cse486 c_~maxb~0) .cse2) (not (= ~B~0.offset ~A~0.offset)) (= c_~maxb~0 (select .cse488 .cse489)) (not (= ~A~0.offset .cse489)) (<= c_~maxc~0 (* .cse486 2))))))) (.cse194 (+ c_~maxa~0 c_~maxc~0)) (.cse159 (= .cse484 .cse2)) (.cse157 (or (and .cse233 (<= .cse2 .cse183)) (and .cse485 .cse230))) (.cse158 (<= .cse4 .cse484)) (.cse414 (or (and .cse51 .cse49) (and (<= .cse483 .cse2) .cse23))) (.cse9 (<= .cse4 .cse183)) (.cse7 (= .cse183 .cse2)) (.cse404 (or (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse480 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse479 (select .cse480 ~A~0.offset))) (and (= .cse2 (+ .cse0 .cse479)) (not (= ~A~0.base c_~C~0.base)) (<= .cse479 c_~maxb~0) (<= c_~maxc~0 (* 2 .cse479)) (= (+ (select .cse480 (+ ~A~0.offset 4)) .cse0) .cse2)))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse482 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse481 (select .cse482 ~A~0.offset))) (and (= .cse2 (+ .cse0 .cse481)) (not (= ~A~0.base c_~C~0.base)) (<= .cse481 .cse0) (<= c_~maxc~0 (* 2 .cse481)) (= (+ (select .cse482 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35))) (.cse57 (= .cse478 0)) (.cse55 (<= 1 .cse478)) (.cse53 (<= (+ .cse65 .cse2 1) c_~maxb~0)) (.cse82 (= (mod .cse2 2) 0)) (.cse301 (or .cse443 (< .cse18 c_~maxa~0))) (.cse303 (= .cse477 .cse2)) (.cse279 (<= .cse4 .cse100)) (.cse50 (<= c_~maxc~0 .cse477))) (or (exists ((~B~0.base Int)) (and (not (= c_~C~0.base ~B~0.base)) (exists ((~B~0.offset Int)) (let ((.cse5 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse3 (select .cse5 ~B~0.offset)) (.cse1 (select .cse5 (+ ~B~0.offset 4)))) (and (= (+ .cse0 .cse1) .cse2) (<= c_~maxc~0 (+ .cse3 c_~maxa~0)) (<= .cse3 .cse1) (<= .cse4 (+ c_~maxa~0 .cse1)) (= c_~maxb~0 .cse1))))))) (and (or (and .cse6 .cse7) (and .cse8 .cse9)) .cse10 .cse11) (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse14 (select |c_#memory_int#1| ~B~0.base)) (.cse16 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse13 (select .cse16 ~A~0.offset)) (.cse12 (select .cse14 ~B~0.offset)) (.cse15 (+ ~B~0.offset 4))) (and (<= .cse12 c_~maxb~0) (<= .cse13 c_~maxa~0) (= (+ .cse12 (select .cse14 .cse15)) .cse2) (= .cse12 (select .cse16 (+ ~A~0.offset 4))) (<= c_~maxc~0 (+ .cse12 .cse13)) (<= .cse4 (+ .cse12 c_~maxb~0)) (<= (+ .cse12 1) c_~maxa~0) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse15)))))) (exists ((~B~0.offset Int)) (and (exists ((~B~0.base Int)) (let ((.cse20 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse17 (select .cse20 ~B~0.offset)) (.cse19 (select .cse20 (+ ~B~0.offset 4)))) (and (<= c_~maxc~0 (+ .cse17 .cse18)) (<= (+ .cse18 .cse19) .cse2) (<= .cse17 .cse19) (= (+ c_~maxa~0 .cse19) .cse2) (= c_~maxb~0 .cse19))))) (not (= ~B~0.offset c_~C~0.offset)) (not (= ~B~0.offset .cse21)))) (and .cse22 .cse23) (and .cse23 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse27 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse24 (+ ~A~0.offset 4)) (.cse26 (select |c_#memory_int#1| ~A~0.base)) (.cse28 (+ ~B~0.offset 4)) (.cse25 (select .cse27 ~B~0.offset))) (and (not (= .cse24 ~B~0.offset)) (<= .cse25 c_~maxb~0) (<= (+ .cse25 c_~maxb~0) .cse2) (= (+ c_~maxb~0 (select .cse26 .cse24)) .cse2) (= .cse25 (select .cse26 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (= c_~maxb~0 (select .cse27 .cse28)) (not (= ~A~0.offset .cse28)) (<= c_~maxc~0 (* .cse25 2))))))) (and .cse8 (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse31 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse29 (select .cse31 ~B~0.offset)) (.cse30 (select .cse31 (+ ~B~0.offset 4)))) (and (<= c_~maxc~0 (+ .cse29 .cse18)) (not (= c_~C~0.base ~B~0.base)) (<= .cse29 .cse30) (<= .cse4 (+ c_~maxa~0 .cse30)) (= c_~maxb~0 .cse30)))))) (and (or (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse34 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse32 (select .cse34 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse32 c_~maxa~0) (not (= .cse33 ~A~0.offset)) (<= c_~maxc~0 (+ .cse0 .cse32)) (= (+ (select .cse34 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse38 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse36 (select .cse38 ~A~0.offset))) (and (not (= ~A~0.offset .cse21)) (<= .cse36 c_~maxa~0) (not (= .cse33 ~A~0.offset)) (<= .cse37 (+ .cse36 .cse2)) (= (+ (select .cse38 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse10) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse40 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse39 (select .cse40 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse39 c_~maxa~0) (<= c_~maxc~0 (+ .cse0 .cse39)) (= (+ (select .cse40 (+ ~A~0.offset 4)) .cse0) .cse2) (= .cse0 .cse39))))) .cse35) (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse43 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse42 (select .cse43 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse42 c_~maxa~0) (<= c_~maxc~0 (+ c_~maxb~0 .cse42)) (not (= .cse33 ~A~0.offset)) (= (+ (select .cse43 (+ ~A~0.offset 4)) .cse0) .cse2)))))) (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse45 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse44 (select .cse45 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse44 c_~maxa~0) (<= c_~maxc~0 (+ c_~maxb~0 .cse44)) (= (+ (select .cse45 (+ ~A~0.offset 4)) .cse0) .cse2) (= .cse0 .cse44)))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse47 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse46 (select .cse47 ~A~0.offset))) (and (not (= ~A~0.offset .cse21)) (<= .cse46 c_~maxa~0) (<= .cse37 (+ .cse46 .cse2)) (= (+ (select .cse47 (+ ~A~0.offset 4)) .cse0) .cse2) (= .cse0 .cse46))))) .cse10)) .cse9) (and (= .cse48 .cse2) .cse8 (or (and (<= .cse18 .cse0) .cse35) (and .cse41 .cse49)) .cse50) (and .cse51 .cse52) (and .cse53 (let ((.cse61 (+ .cse65 .cse2))) (let ((.cse58 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse78 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse81 (select |c_#memory_int#1| ~A~0.base)) (.cse79 (+ ~B~0.offset 4)) (.cse80 (select .cse78 ~B~0.offset))) (and (= (select .cse78 .cse79) .cse61) (= .cse80 (select .cse81 ~A~0.offset)) (= (+ .cse65 (select .cse81 (+ ~A~0.offset 4))) 0) (= (+ .cse80 .cse65) 0) (not (= ~A~0.offset .cse79)) (<= c_~maxc~0 (* .cse80 2))))))) (.cse54 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse75 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse77 (select |c_#memory_int#1| ~A~0.base)) (.cse76 (select .cse75 ~B~0.offset))) (and (= (select .cse75 (+ ~B~0.offset 4)) .cse61) (= .cse76 (select .cse77 ~A~0.offset)) (= (+ .cse65 (select .cse77 (+ ~A~0.offset 4))) 0) (= (+ .cse76 .cse65) 0) (<= c_~maxc~0 (* .cse76 2))))))) (.cse56 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse71 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse74 (select |c_#memory_int#1| ~A~0.base)) (.cse72 (+ ~A~0.offset 4)) (.cse73 (select .cse71 ~B~0.offset))) (and (= (select .cse71 (+ ~B~0.offset 4)) .cse61) (not (= .cse72 ~B~0.offset)) (= .cse73 (select .cse74 ~A~0.offset)) (= (+ .cse65 (select .cse74 .cse72)) 0) (= .cse73 .cse61) (<= c_~maxc~0 (* .cse73 2)))))))) (or (and .cse54 .cse55) (and .cse56 .cse57) (and .cse58 .cse57) (and (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse59 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse64 (select |c_#memory_int#1| ~A~0.base)) (.cse62 (+ ~A~0.offset 4)) (.cse60 (+ ~B~0.offset 4)) (.cse63 (select .cse59 ~B~0.offset))) (and (= (select .cse59 .cse60) .cse61) (not (= .cse62 ~B~0.offset)) (<= .cse63 c_~maxb~0) (<= .cse63 c_~maxa~0) (= .cse63 (select .cse64 ~A~0.offset)) (= (+ .cse65 (select .cse64 .cse62)) 0) (not (= ~A~0.offset .cse60)) (<= c_~maxc~0 (* .cse63 2)))))) .cse55) (and .cse58 .cse55) (and (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse66 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse70 (select |c_#memory_int#1| ~A~0.base)) (.cse68 (+ ~A~0.offset 4)) (.cse67 (+ ~B~0.offset 4)) (.cse69 (select .cse66 ~B~0.offset))) (and (= (select .cse66 .cse67) .cse61) (not (= .cse68 ~B~0.offset)) (= .cse69 (select .cse70 ~A~0.offset)) (<= (+ .cse69 .cse65) 0) (= (+ .cse65 (select .cse70 .cse68)) 0) (not (= ~A~0.offset .cse67)) (<= c_~maxc~0 (* .cse69 2)))))) .cse57) (and .cse54 .cse57) (and .cse56 .cse55)))) .cse82) (exists ((~A~0.base Int)) (and (not (= ~A~0.base c_~C~0.base)) (exists ((~A~0.offset Int)) (let ((.cse85 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse84 (select .cse85 ~A~0.offset)) (.cse83 (select .cse85 (+ ~A~0.offset 4)))) (and (<= (+ .cse18 .cse83) .cse2) (<= .cse84 c_~maxa~0) (= (+ c_~maxb~0 .cse83) .cse2) (<= c_~maxc~0 (+ .cse18 .cse84)) (<= (+ .cse83 1) c_~maxa~0))))))) (and .cse51 .cse86) (and (let ((.cse87 (= .cse18 c_~maxb~0))) (or (and .cse87 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse89 (+ ~A~0.offset 4)) (.cse88 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset c_~C~0.offset)) (= (+ c_~maxb~0 (select .cse88 .cse89)) .cse2) (not (= .cse89 c_~C~0.offset)) (= .cse18 (select .cse88 ~A~0.offset)))))) .cse90 (and .cse87 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse92 (+ ~A~0.offset 4)) (.cse91 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.base c_~C~0.base)) (= (+ c_~maxb~0 (select .cse91 .cse92)) .cse2) (not (= .cse92 c_~C~0.offset)) (= .cse18 (select .cse91 ~A~0.offset)))))) (exists ((~A~0.base Int)) (and (not (= ~A~0.base c_~C~0.base)) (exists ((~A~0.offset Int)) (let ((.cse94 (+ ~A~0.offset 4)) (.cse93 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset .cse21)) (= (+ c_~maxb~0 (select .cse93 .cse94)) .cse2) (not (= .cse94 c_~C~0.offset)) (= .cse18 (select .cse93 ~A~0.offset))))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse95 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (= (+ c_~maxb~0 (select .cse95 (+ ~A~0.offset 4))) .cse2) (= .cse18 (select .cse95 ~A~0.offset))))) .cse96) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse98 (+ ~A~0.offset 4)) (.cse97 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (= (+ c_~maxb~0 (select .cse97 .cse98)) .cse2) (not (= .cse98 c_~C~0.offset)) (= .cse18 (select .cse97 ~A~0.offset))))) (and (exists ((~A~0.base Int)) (and (not (= ~A~0.base c_~C~0.base)) (exists ((~A~0.offset Int)) (let ((.cse99 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset .cse21)) (= (+ c_~maxb~0 (select .cse99 (+ ~A~0.offset 4))) .cse2) (= .cse18 (select .cse99 ~A~0.offset))))))) .cse96))) .cse49 .cse50 (or (and .cse51 .cse8) (and (<= .cse100 .cse2) .cse23))) (exists ((~B~0.base Int)) (and (not (= c_~C~0.base ~B~0.base)) (exists ((~B~0.offset Int)) (let ((.cse103 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse102 (select .cse103 ~B~0.offset)) (.cse101 (select .cse103 (+ ~B~0.offset 4)))) (and (<= (+ .cse101 c_~maxc~0) (+ .cse102 .cse2)) (= (+ .cse0 .cse101) .cse2) (<= .cse102 c_~maxb~0) (<= (+ .cse101 1) c_~maxb~0) (= (+ c_~maxa~0 .cse101) .cse2))))))) (exists ((~A~0.offset Int) (~B~0.offset Int)) (let ((.cse104 (+ ~A~0.offset 4))) (and (not (= .cse104 ~B~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (exists ((~B~0.base Int) (~A~0.base Int)) (let ((.cse107 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse106 (select |c_#memory_int#1| ~A~0.base)) (.cse105 (select .cse107 ~B~0.offset))) (and (<= (+ .cse105 1) c_~maxb~0) (<= .cse105 c_~maxa~0) (<= .cse4 (+ .cse105 c_~maxa~0)) (= .cse105 (select .cse106 ~A~0.offset)) (= (+ .cse105 (select .cse106 .cse104)) .cse2) (= .cse105 (select .cse107 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse105 2))))))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse112 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse108 (select .cse112 ~B~0.offset))) (and (<= .cse108 c_~maxb~0) (exists ((~A~0.base Int)) (and (exists ((~A~0.offset Int)) (let ((.cse111 (select |c_#memory_int#1| ~A~0.base)) (.cse109 (+ ~A~0.offset 4))) (let ((.cse110 (select .cse111 .cse109)) (.cse113 (+ ~B~0.offset 4))) (and (not (= .cse109 ~B~0.offset)) (<= .cse4 (+ c_~maxb~0 .cse110)) (= .cse108 (select .cse111 ~A~0.offset)) (= (+ .cse110 (select .cse112 .cse113)) .cse2) (<= .cse108 .cse110) (= c_~maxa~0 .cse110) (not (= ~A~0.offset .cse113)))))) (not (= ~A~0.base ~B~0.base)))) (<= c_~maxc~0 (* .cse108 2)))))) (and (or (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse119 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse114 (select .cse119 ~B~0.offset)) (.cse118 (+ ~B~0.offset 4))) (and (<= .cse114 c_~maxb~0) (exists ((~A~0.offset Int)) (let ((.cse115 (+ ~A~0.offset 4))) (and (not (= .cse115 ~B~0.offset)) (exists ((~A~0.base Int)) (let ((.cse117 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse116 (select .cse117 ~A~0.offset))) (and (<= .cse116 c_~maxa~0) (<= c_~maxc~0 (+ .cse114 .cse116)) (= (+ c_~maxb~0 (select .cse117 .cse115)) .cse2))))) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse118))))) (= c_~maxb~0 (select .cse119 .cse118)))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse123 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse120 (select .cse123 ~B~0.offset))) (and (<= .cse120 c_~maxb~0) (= (+ .cse120 c_~maxb~0) .cse2) (exists ((~A~0.offset Int)) (and (exists ((~A~0.base Int)) (let ((.cse122 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse121 (select .cse122 ~A~0.offset))) (and (<= .cse121 c_~maxa~0) (= c_~maxb~0 .cse121) (<= c_~maxc~0 (+ .cse120 .cse121)) (= (+ c_~maxb~0 (select .cse122 (+ ~A~0.offset 4))) .cse2))))) (not (= ~B~0.offset ~A~0.offset)))) (= c_~maxb~0 (select .cse123 (+ ~B~0.offset 4))))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse128 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse124 (select .cse128 ~B~0.offset))) (and (<= .cse124 c_~maxb~0) (exists ((~A~0.offset Int)) (let ((.cse125 (+ ~A~0.offset 4))) (and (not (= .cse125 ~B~0.offset)) (exists ((~A~0.base Int)) (let ((.cse127 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse126 (select .cse127 ~A~0.offset))) (and (<= .cse126 c_~maxa~0) (= c_~maxb~0 .cse126) (<= c_~maxc~0 (+ .cse124 .cse126)) (= (+ c_~maxb~0 (select .cse127 .cse125)) .cse2))))) (not (= ~B~0.offset ~A~0.offset))))) (= c_~maxb~0 (select .cse128 (+ ~B~0.offset 4))))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse133 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse130 (select .cse133 ~B~0.offset)) (.cse132 (+ ~B~0.offset 4))) (and (exists ((~A~0.offset Int)) (and (exists ((~A~0.base Int)) (let ((.cse131 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse129 (select .cse131 ~A~0.offset))) (and (<= .cse129 c_~maxa~0) (<= c_~maxc~0 (+ .cse130 .cse129)) (= (+ c_~maxb~0 (select .cse131 (+ ~A~0.offset 4))) .cse2))))) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse132)))) (<= .cse130 c_~maxb~0) (= (+ .cse130 c_~maxb~0) .cse2) (= c_~maxb~0 (select .cse133 .cse132))))))) .cse51) (and (or (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse135 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse134 (select .cse135 ~B~0.offset)) (.cse136 (+ ~B~0.offset 4))) (and (<= (+ .cse134 c_~maxa~0) .cse2) (= (+ c_~maxa~0 (select .cse135 .cse136)) .cse2) (exists ((~A~0.offset Int)) (let ((.cse137 (+ ~A~0.offset 4))) (and (not (= .cse137 ~B~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (exists ((~A~0.base Int)) (let ((.cse139 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse138 (select .cse139 ~A~0.offset))) (and (<= .cse138 c_~maxa~0) (<= c_~maxc~0 (+ .cse134 .cse138)) (= c_~maxa~0 (select .cse139 .cse137)))))) (not (= ~A~0.offset .cse136))))))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse141 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse140 (select .cse141 ~B~0.offset)) (.cse142 (+ ~B~0.offset 4))) (and (<= (+ .cse140 c_~maxa~0) .cse2) (= .cse140 c_~maxa~0) (= (+ c_~maxa~0 (select .cse141 .cse142)) .cse2) (exists ((~A~0.offset Int)) (and (not (= ~B~0.offset ~A~0.offset)) (exists ((~A~0.base Int)) (let ((.cse144 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse143 (select .cse144 ~A~0.offset))) (and (<= .cse143 c_~maxa~0) (<= c_~maxc~0 (+ .cse140 .cse143)) (= c_~maxa~0 (select .cse144 (+ ~A~0.offset 4))))))) (not (= ~A~0.offset .cse142)))))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse148 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse145 (select .cse148 ~B~0.offset))) (and (<= (+ .cse145 c_~maxa~0) .cse2) (exists ((~A~0.offset Int)) (and (exists ((~A~0.base Int)) (let ((.cse147 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse146 (select .cse147 ~A~0.offset))) (and (<= .cse146 c_~maxa~0) (<= c_~maxc~0 (+ .cse145 .cse146)) (= (+ c_~maxa~0 .cse146) .cse2) (= c_~maxa~0 (select .cse147 (+ ~A~0.offset 4))))))) (not (= ~B~0.offset ~A~0.offset)))) (= .cse145 c_~maxa~0) (= (+ c_~maxa~0 (select .cse148 (+ ~B~0.offset 4))) .cse2))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse153 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse149 (select .cse153 ~B~0.offset))) (and (<= (+ .cse149 c_~maxa~0) .cse2) (exists ((~A~0.offset Int)) (let ((.cse150 (+ ~A~0.offset 4))) (and (not (= .cse150 ~B~0.offset)) (exists ((~A~0.base Int)) (let ((.cse152 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse151 (select .cse152 ~A~0.offset))) (and (<= .cse151 c_~maxa~0) (<= c_~maxc~0 (+ .cse149 .cse151)) (= (+ c_~maxa~0 .cse151) .cse2) (= c_~maxa~0 (select .cse152 .cse150)))))) (not (= ~B~0.offset ~A~0.offset))))) (= (+ c_~maxa~0 (select .cse153 (+ ~B~0.offset 4))) .cse2)))))) .cse23) (and .cse8 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse156 (select |c_#memory_int#1| ~A~0.base)) (.cse155 (+ ~A~0.offset 4))) (let ((.cse154 (select .cse156 .cse155))) (and (not (= ~A~0.offset c_~C~0.offset)) (<= .cse4 (+ c_~maxb~0 .cse154)) (not (= ~A~0.offset .cse21)) (not (= .cse155 c_~C~0.offset)) (<= (+ .cse154 1) c_~maxa~0) (= .cse18 (select .cse156 ~A~0.offset)))))) .cse49 .cse50) (and .cse157 (or (and .cse49 .cse158) (and .cse159 .cse6)) .cse11) (and .cse23 .cse160) (and .cse51 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse164 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse162 (+ ~A~0.offset 4)) (.cse163 (select |c_#memory_int#1| ~A~0.base)) (.cse161 (select .cse164 ~B~0.offset))) (and (= .cse161 c_~maxb~0) (not (= .cse162 ~B~0.offset)) (<= .cse161 c_~maxa~0) (= (+ c_~maxb~0 (select .cse163 .cse162)) .cse2) (= .cse161 (select .cse163 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (= c_~maxb~0 (select .cse164 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse161 2))))))) (and .cse23 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse168 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse166 (+ ~A~0.offset 4)) (.cse167 (select |c_#memory_int#1| ~A~0.base)) (.cse165 (select .cse168 ~B~0.offset))) (and (= .cse165 c_~maxb~0) (not (= .cse166 ~B~0.offset)) (<= (+ .cse165 c_~maxb~0) .cse2) (= (+ c_~maxb~0 (select .cse167 .cse166)) .cse2) (= .cse165 (select .cse167 ~A~0.offset)) (not (= ~A~0.base ~B~0.base)) (= c_~maxb~0 (select .cse168 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse165 2))))))) (exists ((~A~0.offset Int)) (let ((.cse169 (+ ~A~0.offset 4))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= .cse169 c_~C~0.offset)) (exists ((~A~0.base Int)) (let ((.cse170 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse171 (select .cse170 ~A~0.offset))) (and (= (+ (select .cse170 .cse169) .cse171) .cse2) (<= .cse171 c_~maxa~0) (= c_~maxb~0 .cse171) (<= .cse4 (+ c_~maxa~0 .cse171)) (<= c_~maxc~0 (+ .cse18 .cse171)) (<= .cse18 .cse171)))))))) (and (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse175 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse173 (+ ~A~0.offset 4)) (.cse174 (select |c_#memory_int#1| ~A~0.base)) (.cse172 (select .cse175 ~B~0.offset))) (and (= .cse172 c_~maxb~0) (not (= .cse173 ~B~0.offset)) (<= (+ .cse172 c_~maxb~0) .cse2) (= (+ c_~maxb~0 (select .cse174 .cse173)) .cse2) (= .cse172 (select .cse174 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (= c_~maxb~0 (select .cse175 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse172 2)))))) .cse23) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse178 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse176 (select .cse178 ~B~0.offset))) (let ((.cse179 (* .cse176 2))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse177 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse176 (select .cse177 (+ ~A~0.offset 4))) (= .cse176 (select .cse177 ~A~0.offset)) (not (= ~A~0.base ~B~0.base))))) (= (+ .cse176 (select .cse178 (+ ~B~0.offset 4))) .cse2) (= .cse176 c_~maxa~0) (<= .cse4 (+ .cse176 c_~maxb~0)) (= .cse179 .cse2) (<= c_~maxc~0 .cse179)))))) (and (= .cse180 .cse2) (or (and .cse41 (<= c_~maxc~0 .cse181) (<= c_~maxc~0 .cse182) .cse9) (and (or .cse7 (< .cse2 .cse183)) (<= (+ .cse180 c_~maxc~0) (* 2 .cse2)) (or (< .cse0 c_~maxb~0) .cse35)))) (exists ((~B~0.base Int) (~A~0.base Int)) (and (not (= ~A~0.base ~B~0.base)) (exists ((~A~0.offset Int) (~B~0.offset Int)) (let ((.cse188 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse185 (select .cse188 ~B~0.offset))) (let ((.cse186 (select |c_#memory_int#1| ~A~0.base)) (.cse184 (+ ~A~0.offset 4)) (.cse187 (* .cse185 2))) (and (not (= .cse184 ~B~0.offset)) (<= (+ .cse185 1) c_~maxb~0) (= .cse185 (select .cse186 ~A~0.offset)) (<= .cse187 .cse2) (= (+ .cse185 c_~maxa~0) .cse2) (= (+ .cse185 (select .cse186 .cse184)) .cse2) (= .cse185 (select .cse188 (+ ~B~0.offset 4))) (<= c_~maxc~0 .cse187)))))))) (and .cse7 (let ((.cse191 (or (and .cse51 (<= c_~maxa~0 c_~maxb~0)) (and (<= .cse182 .cse2) .cse23)))) (or (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse190 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse189 (select .cse190 ~A~0.offset))) (and (not (= ~A~0.offset .cse21)) (<= .cse189 c_~maxa~0) (<= c_~maxc~0 (+ c_~maxa~0 .cse189)) (not (= .cse33 ~A~0.offset)) (= c_~maxa~0 (select .cse190 (+ ~A~0.offset 4))))))) .cse191) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse193 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse192 (select .cse193 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse192 c_~maxa~0) (= (+ c_~maxa~0 .cse192) .cse2) (= c_~maxa~0 (select .cse193 (+ ~A~0.offset 4))) (<= .cse194 (+ .cse192 .cse2)))))) .cse23) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse196 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse195 (select .cse196 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse195 c_~maxa~0) (not (= .cse33 ~A~0.offset)) (= c_~maxa~0 (select .cse196 (+ ~A~0.offset 4))) (<= .cse194 (+ .cse195 .cse2)))))) .cse23) (and .cse51 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse198 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse197 (select .cse198 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse197 c_~maxa~0) (<= c_~maxc~0 (+ c_~maxb~0 .cse197)) (not (= .cse33 ~A~0.offset)) (= c_~maxa~0 (select .cse198 (+ ~A~0.offset 4)))))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse201 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse199 (select .cse201 ~A~0.offset))) (let ((.cse200 (+ c_~maxa~0 .cse199))) (and (not (= ~A~0.offset .cse21)) (<= .cse199 c_~maxa~0) (<= c_~maxc~0 .cse200) (= .cse200 .cse2) (= c_~maxa~0 (select .cse201 (+ ~A~0.offset 4)))))))) .cse191) (and .cse51 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse203 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse202 (select .cse203 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse202 c_~maxa~0) (<= c_~maxc~0 (+ c_~maxb~0 .cse202)) (= (+ c_~maxa~0 .cse202) .cse2) (= c_~maxa~0 (select .cse203 (+ ~A~0.offset 4))))))))))) (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse209 (+ ~B~0.offset 4)) (.cse207 (select |c_#memory_int#1| ~A~0.base)) (.cse210 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse205 (select .cse210 ~B~0.offset)) (.cse206 (select .cse207 ~A~0.offset)) (.cse204 (+ ~A~0.offset 4)) (.cse208 (select .cse210 .cse209))) (and (not (= .cse204 ~B~0.offset)) (<= .cse205 c_~maxb~0) (<= .cse206 c_~maxa~0) (<= c_~maxc~0 (+ .cse205 .cse206)) (= (+ (select .cse207 .cse204) .cse208) .cse2) (<= (+ .cse208 1) c_~maxb~0) (<= .cse4 (+ c_~maxa~0 .cse208)) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse209)))))) (exists ((~B~0.base Int)) (and (not (= c_~C~0.base ~B~0.base)) (exists ((~B~0.offset Int)) (let ((.cse213 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse212 (select .cse213 ~B~0.offset)) (.cse211 (select .cse213 (+ ~B~0.offset 4)))) (and (<= (+ .cse211 c_~maxc~0) (+ .cse212 .cse2)) (= (+ .cse0 .cse211) .cse2) (<= .cse212 .cse211) (= (+ c_~maxa~0 .cse211) .cse2) (= c_~maxb~0 .cse211))))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse218 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse214 (select .cse218 ~B~0.offset))) (and (<= .cse214 c_~maxb~0) (<= .cse214 c_~maxa~0) (exists ((~A~0.base Int)) (and (not (= ~A~0.base ~B~0.base)) (exists ((~A~0.offset Int)) (let ((.cse217 (select |c_#memory_int#1| ~A~0.base)) (.cse215 (+ ~A~0.offset 4))) (let ((.cse216 (select .cse217 .cse215)) (.cse219 (+ ~B~0.offset 4))) (and (not (= .cse215 ~B~0.offset)) (<= .cse4 (+ c_~maxb~0 .cse216)) (= .cse214 (select .cse217 ~A~0.offset)) (= (+ .cse216 (select .cse218 .cse219)) .cse2) (<= (+ .cse216 1) c_~maxa~0) (not (= ~A~0.offset .cse219)))))))) (<= c_~maxc~0 (* .cse214 2)))))) (and (or .cse220 (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse222 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse221 (select .cse222 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse221 c_~maxa~0) (<= .cse221 c_~maxb~0) (<= c_~maxc~0 (* 2 .cse221)) (= (+ (select .cse222 (+ ~A~0.offset 4)) .cse0) .cse2)))))) .cse223 (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse225 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse224 (select .cse225 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse224 c_~maxa~0) (<= .cse224 .cse0) (<= c_~maxc~0 (* 2 .cse224)) (= (+ (select .cse225 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35)) .cse9) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse227 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse228 (+ ~B~0.offset 4)) (.cse226 (select .cse227 ~B~0.offset))) (and (<= .cse226 c_~maxb~0) (= (+ .cse226 (select .cse227 .cse228)) .cse2) (exists ((~A~0.base Int)) (and (not (= ~A~0.base ~B~0.base)) (exists ((~A~0.offset Int)) (let ((.cse229 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse226 (select .cse229 (+ ~A~0.offset 4))) (= .cse226 (select .cse229 ~A~0.offset)) (not (= ~A~0.offset .cse228))))))) (= .cse226 c_~maxa~0) (<= .cse4 (+ .cse226 c_~maxb~0)) (<= c_~maxc~0 (* .cse226 2)))))) (and .cse52 .cse23) (and .cse159 (or (and .cse230 (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse231 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse232 (+ (select .cse231 ~B~0.offset) .cse0))) (and (= (+ .cse0 (select .cse231 (+ ~B~0.offset 4))) .cse2) (<= .cse232 .cse2) (<= c_~maxc~0 .cse232) (not (= ~B~0.offset c_~C~0.offset)) (not (= ~B~0.offset .cse21))))))) (and .cse233 (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse234 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse235 (select .cse234 ~B~0.offset))) (and (= (+ .cse0 (select .cse234 (+ ~B~0.offset 4))) .cse2) (<= c_~maxc~0 (+ .cse235 c_~maxa~0)) (<= (+ .cse235 .cse0) .cse2) (not (= ~B~0.offset c_~C~0.offset)) (not (= ~B~0.offset .cse21))))))))) (exists ((~B~0.base Int)) (and (not (= c_~C~0.base ~B~0.base)) (exists ((~B~0.offset Int)) (let ((.cse238 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse236 (select .cse238 ~B~0.offset)) (.cse237 (select .cse238 (+ ~B~0.offset 4)))) (and (<= .cse236 c_~maxb~0) (<= c_~maxc~0 (+ .cse236 .cse18)) (<= (+ .cse18 .cse237) .cse2) (<= (+ .cse237 1) c_~maxb~0) (= (+ c_~maxa~0 .cse237) .cse2))))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse239 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse240 (+ ~A~0.offset 4)) (.cse241 (select .cse239 ~A~0.offset))) (and (= (+ (select .cse239 .cse240) .cse241) .cse2) (not (= ~A~0.offset c_~C~0.offset)) (<= .cse241 c_~maxa~0) (<= .cse4 (+ c_~maxa~0 .cse241)) (not (= .cse240 c_~C~0.offset)) (<= c_~maxc~0 (+ .cse18 .cse241)) (<= (+ .cse241 1) c_~maxb~0))))) .cse49) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse243 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse244 (+ ~B~0.offset 4)) (.cse242 (select .cse243 ~B~0.offset))) (and (<= .cse242 c_~maxb~0) (= (+ .cse242 (select .cse243 .cse244)) .cse2) (<= .cse4 (+ .cse242 c_~maxb~0)) (<= (+ .cse242 1) c_~maxa~0) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse245 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse242 (select .cse245 (+ ~A~0.offset 4))) (= .cse242 (select .cse245 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse244))))) (<= c_~maxc~0 (* .cse242 2)))))) (and .cse49 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse248 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse247 (select .cse248 ~A~0.offset)) (.cse246 (select .cse248 (+ ~A~0.offset 4)))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse4 (+ c_~maxb~0 .cse246)) (<= .cse247 c_~maxa~0) (<= c_~maxc~0 (+ .cse18 .cse247)) (<= (+ .cse246 1) c_~maxa~0)))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse250 (select |c_#memory_int#1| ~A~0.base)) (.cse249 (+ ~A~0.offset 4))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= .cse249 c_~C~0.offset)) (= .cse18 (select .cse250 ~A~0.offset)) (= .cse2 (+ .cse18 (select .cse250 .cse249)))))) .cse251 .cse50 .cse252) (and .cse90 (let ((.cse254 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse275 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse273 (+ ~A~0.offset 4)) (.cse274 (select |c_#memory_int#1| ~A~0.base)) (.cse272 (select .cse275 ~B~0.offset))) (and (= .cse272 c_~maxb~0) (not (= .cse273 ~B~0.offset)) (= (+ c_~maxb~0 (select .cse274 .cse273)) .cse2) (= .cse272 (select .cse274 ~A~0.offset)) (= c_~maxb~0 (select .cse275 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse272 2))))))) (.cse253 (or (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse267 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse265 (select .cse267 ~B~0.offset))) (and (= (+ .cse265 c_~maxb~0) .cse2) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse266 (select |c_#memory_int#1| ~A~0.base))) (and (= (+ c_~maxb~0 (select .cse266 (+ ~A~0.offset 4))) .cse2) (= .cse265 (select .cse266 ~A~0.offset))))) (= c_~maxb~0 (select .cse267 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse265 2)))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse271 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse270 (+ ~B~0.offset 4)) (.cse268 (select .cse271 ~B~0.offset))) (and (= (+ .cse268 c_~maxb~0) .cse2) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse269 (select |c_#memory_int#1| ~A~0.base))) (and (= (+ c_~maxb~0 (select .cse269 (+ ~A~0.offset 4))) .cse2) (= .cse268 (select .cse269 ~A~0.offset)) (not (= ~A~0.offset .cse270))))) (= c_~maxb~0 (select .cse271 .cse270)) (<= c_~maxc~0 (* .cse268 2))))))))) (or (and .cse253 .cse23) (and .cse254 .cse23) (and .cse51 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse258 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse255 (+ ~A~0.offset 4)) (.cse257 (select |c_#memory_int#1| ~A~0.base)) (.cse259 (+ ~B~0.offset 4)) (.cse256 (select .cse258 ~B~0.offset))) (and (not (= .cse255 ~B~0.offset)) (<= .cse256 c_~maxb~0) (= (+ c_~maxb~0 (select .cse257 .cse255)) .cse2) (= .cse256 (select .cse257 ~A~0.offset)) (= c_~maxb~0 (select .cse258 .cse259)) (not (= ~A~0.offset .cse259)) (<= c_~maxc~0 (* .cse256 2))))))) (and (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse263 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse260 (+ ~A~0.offset 4)) (.cse262 (select |c_#memory_int#1| ~A~0.base)) (.cse264 (+ ~B~0.offset 4)) (.cse261 (select .cse263 ~B~0.offset))) (and (not (= .cse260 ~B~0.offset)) (<= (+ .cse261 c_~maxb~0) .cse2) (= (+ c_~maxb~0 (select .cse262 .cse260)) .cse2) (= .cse261 (select .cse262 ~A~0.offset)) (= c_~maxb~0 (select .cse263 .cse264)) (not (= ~A~0.offset .cse264)) (<= c_~maxc~0 (* .cse261 2)))))) .cse23) (and .cse51 .cse254) (and .cse51 .cse253)))) (and .cse8 (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse278 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse276 (select .cse278 ~B~0.offset)) (.cse277 (select .cse278 (+ ~B~0.offset 4)))) (and (<= .cse276 c_~maxb~0) (<= c_~maxc~0 (+ .cse276 .cse18)) (not (= c_~C~0.base ~B~0.base)) (<= (+ .cse277 1) c_~maxb~0) (<= .cse4 (+ c_~maxa~0 .cse277))))))) (and (or (and .cse279 .cse49) (and .cse280 .cse96)) (<= .cse281 c_~maxa~0) (or (exists ((~A~0.offset Int)) (and (not (= ~A~0.offset c_~C~0.offset)) (exists ((~A~0.base Int)) (let ((.cse284 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse282 (select .cse284 ~A~0.offset))) (let ((.cse283 (+ .cse18 .cse282))) (and (<= .cse282 c_~maxa~0) (= .cse283 .cse2) (<= c_~maxc~0 .cse283) (= .cse18 (select .cse284 (+ ~A~0.offset 4)))))))))) (exists ((~A~0.offset Int)) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (exists ((~A~0.base Int)) (let ((.cse286 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse285 (select .cse286 ~A~0.offset))) (and (<= .cse285 c_~maxa~0) (<= c_~maxc~0 (+ .cse18 .cse285)) (= .cse18 (select .cse286 (+ ~A~0.offset 4))))))))))) (and .cse86 .cse23) (and (or (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse288 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse287 (select .cse288 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (not (= ~A~0.offset c_~C~0.offset)) (<= .cse287 c_~maxb~0) (<= c_~maxc~0 (* 2 .cse287)) (<= (+ .cse0 .cse287) .cse2) (= (+ (select .cse288 (+ ~A~0.offset 4)) .cse0) .cse2)))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse290 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse289 (select .cse290 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (not (= ~A~0.offset c_~C~0.offset)) (<= .cse289 .cse0) (<= c_~maxc~0 (* 2 .cse289)) (<= (+ .cse0 .cse289) .cse2) (= (+ (select .cse290 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35)) .cse7) (exists ((~B~0.base Int)) (and (not (= c_~C~0.base ~B~0.base)) (exists ((~B~0.offset Int)) (let ((.cse293 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse292 (select .cse293 ~B~0.offset)) (.cse291 (select .cse293 (+ ~B~0.offset 4)))) (and (= (+ .cse0 .cse291) .cse2) (<= .cse292 c_~maxb~0) (<= (+ .cse291 1) c_~maxb~0) (<= c_~maxc~0 (+ .cse292 c_~maxa~0)) (<= .cse4 (+ c_~maxa~0 .cse291)))))))) (and .cse49 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse296 (select |c_#memory_int#1| ~A~0.base)) (.cse295 (+ ~A~0.offset 4))) (let ((.cse294 (select .cse296 .cse295))) (and (not (= ~A~0.offset c_~C~0.offset)) (<= .cse4 (+ c_~maxb~0 .cse294)) (not (= ~A~0.offset .cse21)) (not (= .cse295 c_~C~0.offset)) (<= .cse18 .cse294) (= .cse18 (select .cse296 ~A~0.offset)) (= c_~maxa~0 .cse294))))) .cse50) (and .cse7 (or .cse220 .cse223 (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse298 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse297 (select .cse298 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse297 .cse0) (<= c_~maxc~0 (* 2 .cse297)) (<= (+ .cse0 .cse297) .cse2) (= (+ (select .cse298 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35) (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse300 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse299 (select .cse300 ~A~0.offset))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (<= .cse299 c_~maxb~0) (<= c_~maxc~0 (* 2 .cse299)) (<= (+ .cse0 .cse299) .cse2) (= (+ (select .cse300 (+ ~A~0.offset 4)) .cse0) .cse2)))))))) (and .cse301 (or (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse302 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.base c_~C~0.base)) (= .cse18 (select .cse302 ~A~0.offset)) (= .cse18 (select .cse302 (+ ~A~0.offset 4)))))) .cse303) (exists ((~A~0.base Int)) (and (not (= ~A~0.base c_~C~0.base)) (exists ((~A~0.offset Int)) (let ((.cse304 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset .cse21)) (= .cse18 (select .cse304 ~A~0.offset)) (= .cse18 (select .cse304 (+ ~A~0.offset 4))))))))) .cse279 .cse49 .cse50) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse306 (select |c_#memory_int#1| ~A~0.base)) (.cse305 (+ ~A~0.offset 4))) (and (not (= ~A~0.base c_~C~0.base)) (not (= .cse305 c_~C~0.offset)) (= .cse18 (select .cse306 ~A~0.offset)) (= .cse2 (+ .cse18 (select .cse306 .cse305)))))) .cse251 .cse50 .cse252) (and .cse51 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse310 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse307 (+ ~A~0.offset 4)) (.cse309 (select |c_#memory_int#1| ~A~0.base)) (.cse311 (+ ~B~0.offset 4)) (.cse308 (select .cse310 ~B~0.offset))) (and (not (= .cse307 ~B~0.offset)) (<= .cse308 c_~maxb~0) (<= .cse308 c_~maxa~0) (= (+ c_~maxb~0 (select .cse309 .cse307)) .cse2) (= .cse308 (select .cse309 ~A~0.offset)) (not (= ~A~0.base ~B~0.base)) (= c_~maxb~0 (select .cse310 .cse311)) (not (= ~A~0.offset .cse311)) (<= c_~maxc~0 (* .cse308 2))))))) (and .cse51 .cse160) (and .cse51 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse315 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse313 (+ ~A~0.offset 4)) (.cse314 (select |c_#memory_int#1| ~A~0.base)) (.cse312 (select .cse315 ~B~0.offset))) (and (= .cse312 c_~maxb~0) (not (= .cse313 ~B~0.offset)) (<= .cse312 c_~maxa~0) (= (+ c_~maxb~0 (select .cse314 .cse313)) .cse2) (= .cse312 (select .cse314 ~A~0.offset)) (not (= ~A~0.base ~B~0.base)) (= c_~maxb~0 (select .cse315 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse312 2))))))) (and .cse51 .cse22) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse318 (select |c_#memory_int#1| ~A~0.base)) (.cse317 (+ ~A~0.offset 4))) (let ((.cse316 (select .cse318 .cse317))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse4 (+ c_~maxb~0 .cse316)) (not (= ~A~0.offset .cse21)) (not (= .cse317 c_~C~0.offset)) (<= .cse18 .cse316) (= .cse18 (select .cse318 ~A~0.offset)) (= c_~maxa~0 .cse316))))) .cse49 .cse50) (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse319 (select |c_#memory_int#1| ~A~0.base)) (.cse323 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse320 (+ ~A~0.offset 4)) (.cse322 (select .cse323 ~B~0.offset)) (.cse321 (select .cse319 ~A~0.offset))) (and (= (+ (select .cse319 .cse320) .cse321) .cse2) (not (= .cse320 ~B~0.offset)) (<= .cse322 c_~maxb~0) (<= .cse321 c_~maxa~0) (<= .cse4 (+ c_~maxa~0 .cse321)) (<= c_~maxc~0 (+ .cse322 .cse321)) (= (select .cse323 (+ ~B~0.offset 4)) .cse321) (not (= ~B~0.offset ~A~0.offset)) (<= (+ .cse321 1) c_~maxb~0))))) (and .cse9 (or (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse325 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse324 (select .cse325 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (not (= ~A~0.offset c_~C~0.offset)) (<= .cse324 c_~maxa~0) (<= .cse324 .cse0) (<= c_~maxc~0 (* 2 .cse324)) (= (+ (select .cse325 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35) (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse327 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse326 (select .cse327 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (not (= ~A~0.offset c_~C~0.offset)) (<= .cse326 c_~maxa~0) (<= .cse326 c_~maxb~0) (<= c_~maxc~0 (* 2 .cse326)) (= (+ (select .cse327 (+ ~A~0.offset 4)) .cse0) .cse2)))))))) (and (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse331 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse328 (+ ~A~0.offset 4)) (.cse330 (select |c_#memory_int#1| ~A~0.base)) (.cse332 (+ ~B~0.offset 4)) (.cse329 (select .cse331 ~B~0.offset))) (and (not (= .cse328 ~B~0.offset)) (<= .cse329 c_~maxb~0) (<= (+ .cse329 c_~maxb~0) .cse2) (= (+ c_~maxb~0 (select .cse330 .cse328)) .cse2) (= .cse329 (select .cse330 ~A~0.offset)) (not (= ~A~0.base ~B~0.base)) (= c_~maxb~0 (select .cse331 .cse332)) (not (= ~A~0.offset .cse332)) (<= c_~maxc~0 (* .cse329 2)))))) .cse23) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse334 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse333 (select .cse334 ~B~0.offset))) (let ((.cse336 (* .cse333 2))) (and (= (+ .cse333 (select .cse334 (+ ~B~0.offset 4))) .cse2) (<= .cse4 (+ .cse333 c_~maxb~0)) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse335 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse333 (select .cse335 (+ ~A~0.offset 4))) (= .cse333 (select .cse335 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset))))) (<= (+ .cse333 1) c_~maxa~0) (= .cse336 .cse2) (<= c_~maxc~0 .cse336)))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse339 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse337 (select .cse339 ~B~0.offset))) (let ((.cse340 (* .cse337 2))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse338 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse337 (select .cse338 (+ ~A~0.offset 4))) (= .cse337 (select .cse338 ~A~0.offset)) (not (= ~A~0.base ~B~0.base))))) (= (+ .cse337 (select .cse339 (+ ~B~0.offset 4))) .cse2) (<= .cse4 (+ .cse337 c_~maxb~0)) (<= (+ .cse337 1) c_~maxa~0) (= .cse340 .cse2) (<= c_~maxc~0 .cse340)))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse342 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse343 (+ ~B~0.offset 4)) (.cse341 (select .cse342 ~B~0.offset))) (and (<= .cse341 c_~maxb~0) (= (+ .cse341 (select .cse342 .cse343)) .cse2) (exists ((~A~0.base Int)) (and (not (= ~A~0.base ~B~0.base)) (exists ((~A~0.offset Int)) (let ((.cse344 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse341 (select .cse344 (+ ~A~0.offset 4))) (= .cse341 (select .cse344 ~A~0.offset)) (not (= ~A~0.offset .cse343))))))) (<= .cse4 (+ .cse341 c_~maxb~0)) (<= (+ .cse341 1) c_~maxa~0) (<= c_~maxc~0 (* .cse341 2)))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse349 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse345 (select .cse349 ~B~0.offset))) (and (<= .cse345 c_~maxb~0) (exists ((~A~0.offset Int)) (let ((.cse346 (+ ~A~0.offset 4)) (.cse350 (+ ~B~0.offset 4))) (and (not (= .cse346 ~B~0.offset)) (exists ((~A~0.base Int)) (let ((.cse348 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse347 (select .cse348 .cse346))) (and (<= .cse4 (+ c_~maxb~0 .cse347)) (= .cse345 (select .cse348 ~A~0.offset)) (= (+ .cse347 (select .cse349 .cse350)) .cse2) (<= .cse345 .cse347) (= c_~maxa~0 .cse347))))) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse350))))) (<= c_~maxc~0 (* .cse345 2)))))) (exists ((~B~0.base Int)) (and (not (= c_~C~0.base ~B~0.base)) (exists ((~B~0.offset Int)) (let ((.cse353 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse351 (select .cse353 ~B~0.offset)) (.cse352 (select .cse353 (+ ~B~0.offset 4)))) (and (<= c_~maxc~0 (+ .cse351 .cse18)) (<= (+ .cse18 .cse352) .cse2) (<= .cse351 .cse352) (= (+ c_~maxa~0 .cse352) .cse2) (= c_~maxb~0 .cse352))))))) (and .cse51 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse357 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse354 (+ ~A~0.offset 4)) (.cse356 (select |c_#memory_int#1| ~A~0.base)) (.cse358 (+ ~B~0.offset 4)) (.cse355 (select .cse357 ~B~0.offset))) (and (not (= .cse354 ~B~0.offset)) (<= .cse355 c_~maxb~0) (<= .cse355 c_~maxa~0) (= (+ c_~maxb~0 (select .cse356 .cse354)) .cse2) (= .cse355 (select .cse356 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (= c_~maxb~0 (select .cse357 .cse358)) (not (= ~A~0.offset .cse358)) (<= c_~maxc~0 (* .cse355 2))))))) (and .cse51 (or (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse363 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse359 (select .cse363 ~B~0.offset))) (and (<= .cse359 c_~maxb~0) (exists ((~A~0.offset Int)) (let ((.cse360 (+ ~A~0.offset 4))) (and (not (= .cse360 ~B~0.offset)) (exists ((~A~0.base Int)) (let ((.cse362 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse361 (select .cse362 ~A~0.offset))) (and (<= .cse361 c_~maxa~0) (<= c_~maxc~0 (+ .cse359 .cse361)) (= (+ c_~maxa~0 .cse361) .cse2) (= c_~maxa~0 (select .cse362 .cse360)))))) (not (= ~B~0.offset ~A~0.offset))))) (= (+ c_~maxa~0 (select .cse363 (+ ~B~0.offset 4))) .cse2))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse367 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse364 (select .cse367 ~B~0.offset))) (and (<= .cse364 c_~maxb~0) (exists ((~A~0.offset Int)) (and (exists ((~A~0.base Int)) (let ((.cse366 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse365 (select .cse366 ~A~0.offset))) (and (<= .cse365 c_~maxa~0) (<= c_~maxc~0 (+ .cse364 .cse365)) (= (+ c_~maxa~0 .cse365) .cse2) (= c_~maxa~0 (select .cse366 (+ ~A~0.offset 4))))))) (not (= ~B~0.offset ~A~0.offset)))) (= .cse364 c_~maxa~0) (= (+ c_~maxa~0 (select .cse367 (+ ~B~0.offset 4))) .cse2))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse369 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse368 (select .cse369 ~B~0.offset)) (.cse370 (+ ~B~0.offset 4))) (and (<= .cse368 c_~maxb~0) (= (+ c_~maxa~0 (select .cse369 .cse370)) .cse2) (exists ((~A~0.offset Int)) (let ((.cse371 (+ ~A~0.offset 4))) (and (not (= .cse371 ~B~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (exists ((~A~0.base Int)) (let ((.cse373 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse372 (select .cse373 ~A~0.offset))) (and (<= .cse372 c_~maxa~0) (<= c_~maxc~0 (+ .cse368 .cse372)) (= c_~maxa~0 (select .cse373 .cse371)))))) (not (= ~A~0.offset .cse370))))))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse375 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse374 (select .cse375 ~B~0.offset)) (.cse376 (+ ~B~0.offset 4))) (and (<= .cse374 c_~maxb~0) (= .cse374 c_~maxa~0) (= (+ c_~maxa~0 (select .cse375 .cse376)) .cse2) (exists ((~A~0.offset Int)) (and (not (= ~B~0.offset ~A~0.offset)) (exists ((~A~0.base Int)) (let ((.cse378 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse377 (select .cse378 ~A~0.offset))) (and (<= .cse377 c_~maxa~0) (<= c_~maxc~0 (+ .cse374 .cse377)) (= c_~maxa~0 (select .cse378 (+ ~A~0.offset 4))))))) (not (= ~A~0.offset .cse376)))))))))) (exists ((~A~0.offset Int) (~B~0.offset Int)) (let ((.cse382 (+ ~A~0.offset 4))) (and (exists ((~B~0.base Int) (~A~0.base Int)) (let ((.cse383 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse379 (select .cse383 ~B~0.offset))) (let ((.cse380 (select |c_#memory_int#1| ~A~0.base)) (.cse381 (* .cse379 2))) (and (<= (+ .cse379 1) c_~maxb~0) (= .cse379 (select .cse380 ~A~0.offset)) (<= .cse381 .cse2) (= (+ .cse379 c_~maxa~0) .cse2) (= (+ .cse379 (select .cse380 .cse382)) .cse2) (= .cse379 (select .cse383 (+ ~B~0.offset 4))) (<= c_~maxc~0 .cse381)))))) (not (= .cse382 ~B~0.offset)) (not (= ~B~0.offset ~A~0.offset))))) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse385 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse384 (select .cse385 ~B~0.offset))) (let ((.cse387 (* .cse384 2))) (and (= (+ .cse384 (select .cse385 (+ ~B~0.offset 4))) .cse2) (= .cse384 c_~maxa~0) (<= .cse4 (+ .cse384 c_~maxb~0)) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse386 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse384 (select .cse386 (+ ~A~0.offset 4))) (= .cse384 (select .cse386 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset))))) (= .cse387 .cse2) (<= c_~maxc~0 .cse387)))))) (exists ((~B~0.base Int) (~A~0.base Int)) (and (exists ((~A~0.offset Int) (~B~0.offset Int)) (let ((.cse391 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse390 (select |c_#memory_int#1| ~A~0.base)) (.cse388 (+ ~A~0.offset 4)) (.cse389 (select .cse391 ~B~0.offset))) (and (not (= .cse388 ~B~0.offset)) (<= (+ .cse389 1) c_~maxb~0) (<= .cse389 c_~maxa~0) (<= .cse4 (+ .cse389 c_~maxa~0)) (= .cse389 (select .cse390 ~A~0.offset)) (= (+ .cse389 (select .cse390 .cse388)) .cse2) (= .cse389 (select .cse391 (+ ~B~0.offset 4))) (<= c_~maxc~0 (* .cse389 2)))))) (not (= ~A~0.base ~B~0.base)))) (and (or (and .cse23 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse393 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse392 (select .cse393 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse392 c_~maxa~0) (= c_~maxa~0 (select .cse393 (+ ~A~0.offset 4))) (<= .cse194 (+ .cse392 .cse2))))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse395 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse394 (select .cse395 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse394 c_~maxa~0) (<= c_~maxc~0 (+ c_~maxb~0 .cse394)) (= c_~maxa~0 (select .cse395 (+ ~A~0.offset 4))))))) .cse51)) .cse7) (exists ((~A~0.offset Int)) (let ((.cse399 (+ ~A~0.offset 4))) (and (exists ((~A~0.base Int)) (let ((.cse398 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse397 (select .cse398 ~A~0.offset)) (.cse396 (select .cse398 .cse399))) (and (<= (+ .cse18 .cse396) .cse2) (<= .cse397 c_~maxa~0) (= (+ c_~maxb~0 .cse396) .cse2) (<= c_~maxc~0 (+ .cse18 .cse397)) (<= (+ .cse396 1) c_~maxa~0))))) (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (not (= .cse399 c_~C~0.offset))))) (and (or (and (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse400 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse401 (select .cse400 ~B~0.offset))) (and (= (+ .cse0 (select .cse400 (+ ~B~0.offset 4))) .cse2) (<= .cse401 c_~maxb~0) (<= .cse37 (+ .cse401 .cse2)) (not (= ~B~0.offset .cse21)))))) .cse158) (and .cse159 (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse402 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse403 (select .cse402 ~B~0.offset))) (and (= (+ .cse0 (select .cse402 (+ ~B~0.offset 4))) .cse2) (<= .cse37 (+ .cse403 .cse2)) (<= (+ .cse403 .cse0) .cse2) (not (= ~B~0.offset .cse21)))))))) .cse157) (and .cse9 .cse404) (and (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse407 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse405 (select .cse407 ~B~0.offset)) (.cse406 (select .cse407 (+ ~B~0.offset 4)))) (and (<= .cse405 c_~maxb~0) (<= c_~maxc~0 (+ .cse405 .cse18)) (<= (+ .cse406 1) c_~maxb~0) (<= .cse4 (+ c_~maxa~0 .cse406)) (not (= ~B~0.offset c_~C~0.offset)) (not (= ~B~0.offset .cse21)))))) .cse8) (and (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse411 (select |c_#memory_int#1| ~A~0.base)) (.cse410 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse408 (select .cse410 ~B~0.offset)) (.cse409 (select .cse411 ~A~0.offset))) (and (<= (+ .cse408 c_~maxa~0) .cse2) (<= .cse409 c_~maxa~0) (<= c_~maxc~0 (+ .cse408 .cse409)) (not (= ~A~0.base ~B~0.base)) (= (+ c_~maxa~0 (select .cse410 (+ ~B~0.offset 4))) .cse2) (= c_~maxa~0 (select .cse411 (+ ~A~0.offset 4))))))) .cse23) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse413 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse412 (select .cse413 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse412 c_~maxa~0) (<= c_~maxc~0 (+ .cse18 .cse412)) (= c_~maxa~0 (select .cse413 (+ ~A~0.offset 4))))))) .cse414) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse417 (+ ~A~0.offset 4)) (.cse418 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse416 (select .cse418 ~A~0.offset)) (.cse415 (select .cse418 .cse417))) (and (not (= ~A~0.offset c_~C~0.offset)) (<= .cse4 (+ c_~maxb~0 .cse415)) (not (= ~A~0.offset .cse21)) (<= .cse416 c_~maxa~0) (not (= .cse417 c_~C~0.offset)) (<= c_~maxc~0 (+ .cse18 .cse416)) (<= (+ .cse415 1) c_~maxa~0))))) .cse49) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse420 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse421 (+ ~B~0.offset 4)) (.cse419 (select .cse420 ~B~0.offset))) (and (<= .cse419 c_~maxb~0) (= (+ .cse419 (select .cse420 .cse421)) .cse2) (= .cse419 c_~maxa~0) (<= .cse4 (+ .cse419 c_~maxb~0)) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse422 (select |c_#memory_int#1| ~A~0.base))) (and (= .cse419 (select .cse422 (+ ~A~0.offset 4))) (= .cse419 (select .cse422 ~A~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse421))))) (<= c_~maxc~0 (* .cse419 2)))))) (and .cse51 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse426 (select |c_#memory_int#1| ~A~0.base)) (.cse425 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse423 (select .cse425 ~B~0.offset)) (.cse424 (select .cse426 ~A~0.offset))) (and (<= .cse423 c_~maxb~0) (<= .cse424 c_~maxa~0) (<= c_~maxc~0 (+ .cse423 .cse424)) (not (= ~A~0.base ~B~0.base)) (= (+ c_~maxa~0 (select .cse425 (+ ~B~0.offset 4))) .cse2) (= c_~maxa~0 (select .cse426 (+ ~A~0.offset 4)))))))) (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse427 (select |c_#memory_int#1| ~A~0.base)) (.cse431 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse429 (select .cse431 ~B~0.offset)) (.cse428 (select .cse427 ~A~0.offset))) (let ((.cse430 (+ .cse429 .cse428))) (and (= (+ (select .cse427 (+ ~A~0.offset 4)) .cse428) .cse2) (<= .cse429 c_~maxb~0) (<= .cse428 c_~maxa~0) (= .cse430 .cse2) (<= .cse4 (+ c_~maxa~0 .cse428)) (<= c_~maxc~0 .cse430) (= (select .cse431 (+ ~B~0.offset 4)) .cse428) (not (= ~B~0.offset ~A~0.offset)) (<= (+ .cse428 1) c_~maxb~0)))))) (and .cse8 (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse434 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse432 (select .cse434 ~B~0.offset)) (.cse433 (select .cse434 (+ ~B~0.offset 4)))) (and (<= c_~maxc~0 (+ .cse432 .cse18)) (<= .cse432 .cse433) (<= .cse4 (+ c_~maxa~0 .cse433)) (not (= ~B~0.offset c_~C~0.offset)) (= c_~maxb~0 .cse433) (not (= ~B~0.offset .cse21))))))) (and .cse158 (or (and (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse435 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse436 (select .cse435 ~B~0.offset))) (and (= (+ .cse0 (select .cse435 (+ ~B~0.offset 4))) .cse2) (<= .cse436 c_~maxb~0) (<= c_~maxc~0 (+ .cse436 .cse0)) (not (= ~B~0.offset c_~C~0.offset)) (not (= ~B~0.offset .cse21)))))) .cse230) (and (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse437 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse438 (select .cse437 ~B~0.offset))) (and (= (+ .cse0 (select .cse437 (+ ~B~0.offset 4))) .cse2) (<= .cse438 c_~maxb~0) (<= c_~maxc~0 (+ .cse438 c_~maxa~0)) (not (= ~B~0.offset c_~C~0.offset)) (not (= ~B~0.offset .cse21)))))) .cse233))) (and (or (and (or (exists ((~A~0.offset Int)) (and (not (= ~A~0.offset c_~C~0.offset)) (exists ((~A~0.base Int)) (let ((.cse440 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse439 (select .cse440 ~A~0.offset))) (and (<= .cse439 c_~maxa~0) (<= c_~maxc~0 (+ .cse18 .cse439)) (= (+ c_~maxa~0 .cse439) .cse2) (= c_~maxa~0 (select .cse440 (+ ~A~0.offset 4))))))))) (exists ((~A~0.offset Int)) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (exists ((~A~0.base Int)) (let ((.cse442 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse441 (select .cse442 ~A~0.offset))) (and (<= .cse441 c_~maxa~0) (<= c_~maxc~0 (+ .cse18 .cse441)) (= c_~maxa~0 (select .cse442 (+ ~A~0.offset 4)))))))))) .cse443) (exists ((~A~0.offset Int)) (let ((.cse444 (+ ~A~0.offset 4))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= .cse444 c_~C~0.offset)) (exists ((~A~0.base Int)) (let ((.cse446 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse445 (select .cse446 ~A~0.offset))) (and (<= .cse445 c_~maxa~0) (<= c_~maxc~0 (+ .cse18 .cse445)) (= (+ c_~maxa~0 .cse445) .cse2) (= c_~maxa~0 (select .cse446 .cse444))))))))) (exists ((~A~0.offset Int)) (let ((.cse447 (+ ~A~0.offset 4))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (not (= .cse447 c_~C~0.offset)) (exists ((~A~0.base Int)) (let ((.cse449 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse448 (select .cse449 ~A~0.offset))) (and (<= .cse448 c_~maxa~0) (<= c_~maxc~0 (+ .cse18 .cse448)) (= c_~maxa~0 (select .cse449 .cse447)))))))))) .cse414) (and .cse51 (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse452 (select |c_#memory_int#1| ~A~0.base)) (.cse453 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse450 (select .cse453 ~B~0.offset)) (.cse451 (select .cse452 ~A~0.offset))) (and (<= .cse450 c_~maxb~0) (<= .cse451 c_~maxa~0) (<= c_~maxc~0 (+ .cse450 .cse451)) (= (+ c_~maxb~0 (select .cse452 (+ ~A~0.offset 4))) .cse2) (not (= ~A~0.base ~B~0.base)) (= c_~maxb~0 (select .cse453 (+ ~B~0.offset 4)))))))) (exists ((~A~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~A~0.base Int)) (let ((.cse456 (select |c_#memory_int#1| ~A~0.base)) (.cse458 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse454 (select .cse458 ~B~0.offset)) (.cse455 (select .cse456 ~A~0.offset)) (.cse457 (select .cse458 (+ ~B~0.offset 4)))) (and (<= .cse454 c_~maxb~0) (<= .cse455 c_~maxa~0) (<= c_~maxc~0 (+ .cse454 .cse455)) (= (+ (select .cse456 (+ ~A~0.offset 4)) .cse457) .cse2) (not (= ~A~0.base ~B~0.base)) (<= (+ .cse457 1) c_~maxb~0) (<= .cse4 (+ c_~maxa~0 .cse457)))))) (and (or (and .cse41 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse460 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse459 (select .cse460 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse459 c_~maxa~0) (<= c_~maxc~0 (+ c_~maxb~0 .cse459)) (= (+ (select .cse460 (+ ~A~0.offset 4)) .cse0) .cse2)))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse462 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse461 (select .cse462 ~A~0.offset))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse461 c_~maxa~0) (<= c_~maxc~0 (+ .cse0 .cse461)) (= (+ (select .cse462 (+ ~A~0.offset 4)) .cse0) .cse2))))) .cse35)) .cse9) (and .cse7 .cse404) (and .cse8 (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse465 (select |c_#memory_int#1| ~A~0.base)) (.cse464 (+ ~A~0.offset 4))) (let ((.cse463 (select .cse465 .cse464))) (and (not (= ~A~0.base c_~C~0.base)) (<= .cse4 (+ c_~maxb~0 .cse463)) (not (= ~A~0.offset .cse21)) (not (= .cse464 c_~C~0.offset)) (<= (+ .cse463 1) c_~maxa~0) (= .cse18 (select .cse465 ~A~0.offset)))))) .cse49 .cse50) (exists ((~B~0.offset Int)) (and (exists ((~B~0.base Int)) (let ((.cse468 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse466 (select .cse468 ~B~0.offset)) (.cse467 (select .cse468 (+ ~B~0.offset 4)))) (and (<= .cse466 c_~maxb~0) (<= c_~maxc~0 (+ .cse466 .cse18)) (<= (+ .cse18 .cse467) .cse2) (<= (+ .cse467 1) c_~maxb~0) (= (+ c_~maxa~0 .cse467) .cse2))))) (not (= ~B~0.offset c_~C~0.offset)) (not (= ~B~0.offset .cse21)))) (and (or (and (<= (+ .cse18 .cse65) 0) .cse57) (and .cse8 .cse55)) .cse53 .cse49 .cse50 .cse82) (exists ((~B~0.offset Int) (~B~0.base Int)) (let ((.cse472 (select |c_#memory_int#1| ~B~0.base))) (let ((.cse469 (select .cse472 ~B~0.offset))) (and (<= .cse469 c_~maxb~0) (<= .cse469 c_~maxa~0) (exists ((~A~0.offset Int)) (let ((.cse474 (+ ~A~0.offset 4)) (.cse473 (+ ~B~0.offset 4))) (and (exists ((~A~0.base Int)) (let ((.cse471 (select |c_#memory_int#1| ~A~0.base))) (let ((.cse470 (select .cse471 .cse474))) (and (<= .cse4 (+ c_~maxb~0 .cse470)) (= .cse469 (select .cse471 ~A~0.offset)) (= (+ .cse470 (select .cse472 .cse473)) .cse2) (<= (+ .cse470 1) c_~maxa~0))))) (not (= .cse474 ~B~0.offset)) (not (= ~B~0.offset ~A~0.offset)) (not (= ~A~0.offset .cse473))))) (<= c_~maxc~0 (* .cse469 2)))))) (and .cse301 (or (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse475 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset c_~C~0.offset)) (not (= ~A~0.offset .cse21)) (= .cse18 (select .cse475 ~A~0.offset)) (= .cse18 (select .cse475 (+ ~A~0.offset 4)))))) (and (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse476 (select |c_#memory_int#1| ~A~0.base))) (and (not (= ~A~0.offset c_~C~0.offset)) (= .cse18 (select .cse476 ~A~0.offset)) (= .cse18 (select .cse476 (+ ~A~0.offset 4)))))) .cse303)) .cse279 .cse49 .cse50))))))) is different from true [2025-04-13 18:47:59,074 WARN L286 SmtUtils]: Spent 18.41s on a formula simplification. DAG size of input: 755 DAG size of output: 755 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 18:49:09,398 WARN L286 SmtUtils]: Spent 18.42s on a formula simplification that was a NOOP. DAG size: 758 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)