/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/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --icfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false --traceabstraction.dfs.order.used.in.por BY_SERIAL_NUMBER --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL --traceabstraction.commutativity.condition.synthesis NONE -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-race.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-04aa6ae-m [2025-04-16 00:57:43,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-16 00:57:43,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-16 00:57:43,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-16 00:57:43,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-16 00:57:43,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-16 00:57:43,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-16 00:57:43,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-16 00:57:43,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-16 00:57:43,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * Use SBE=true [2025-04-16 00:57:43,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-16 00:57:43,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-16 00:57:43,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 00:57:43,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 00:57:43,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 00:57:43,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-16 00:57:43,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Only consider context switches at boundaries of atomic blocks -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> BY_SERIAL_NUMBER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-04-16 00:57:43,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-16 00:57:43,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-16 00:57:43,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-16 00:57:43,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-16 00:57:43,351 INFO L274 PluginConnector]: CDTParser initialized [2025-04-16 00:57:43,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2025-04-16 00:57:44,681 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c730719/6c0583baef154ea0b3cba8d0de2fd4ff/FLAG25b519fba [2025-04-16 00:57:44,941 INFO L389 CDTParser]: Found 1 translation units. [2025-04-16 00:57:44,942 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2025-04-16 00:57:44,958 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c730719/6c0583baef154ea0b3cba8d0de2fd4ff/FLAG25b519fba [2025-04-16 00:57:45,682 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58c730719/6c0583baef154ea0b3cba8d0de2fd4ff [2025-04-16 00:57:45,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-16 00:57:45,685 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-16 00:57:45,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-16 00:57:45,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-16 00:57:45,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-16 00:57:45,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 12:57:45" (1/1) ... [2025-04-16 00:57:45,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687feca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:45, skipping insertion in model container [2025-04-16 00:57:45,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 12:57:45" (1/1) ... [2025-04-16 00:57:45,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-16 00:57:45,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 00:57:45,970 INFO L200 MainTranslator]: Completed pre-run [2025-04-16 00:57:46,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 00:57:46,040 INFO L204 MainTranslator]: Completed translation [2025-04-16 00:57:46,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46 WrapperNode [2025-04-16 00:57:46,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-16 00:57:46,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-16 00:57:46,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-16 00:57:46,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-16 00:57:46,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,087 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 195 [2025-04-16 00:57:46,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-16 00:57:46,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-16 00:57:46,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-16 00:57:46,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-16 00:57:46,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-16 00:57:46,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-16 00:57:46,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-16 00:57:46,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-16 00:57:46,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (1/1) ... [2025-04-16 00:57:46,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 00:57:46,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:57:46,161 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-16 00:57:46,166 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-16 00:57:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-16 00:57:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-16 00:57:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-16 00:57:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-16 00:57:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-16 00:57:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-16 00:57:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-16 00:57:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-16 00:57:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-16 00:57:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-16 00:57:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-16 00:57:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-16 00:57:46,181 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-16 00:57:46,288 INFO L234 CfgBuilder]: Building ICFG [2025-04-16 00:57:46,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-16 00:57:46,533 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-16 00:57:46,534 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-16 00:57:46,534 INFO L294 CfgBuilder]: Performing block encoding [2025-04-16 00:57:46,612 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-16 00:57:46,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 12:57:46 BoogieIcfgContainer [2025-04-16 00:57:46,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-16 00:57:46,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-16 00:57:46,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-16 00:57:46,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-16 00:57:46,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.04 12:57:45" (1/3) ... [2025-04-16 00:57:46,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfe524b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 12:57:46, skipping insertion in model container [2025-04-16 00:57:46,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:57:46" (2/3) ... [2025-04-16 00:57:46,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfe524b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 12:57:46, skipping insertion in model container [2025-04-16 00:57:46,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 12:57:46" (3/3) ... [2025-04-16 00:57:46,620 INFO L128 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-race.i [2025-04-16 00:57:46,629 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-16 00:57:46,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 37_stack_lock_p0_vs_concur-race.i that has 2 procedures, 190 locations, 194 edges, 1 initial locations, 2 loop locations, and 15 error locations. [2025-04-16 00:57:46,631 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-16 00:57:46,695 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 00:57:46,729 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-16 00:57:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:57:46,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-16 00:57:46,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-16 00:57:46,792 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:57:46,815 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-04-16 00:57:46,823 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=PARTIAL_ORDER_FA, 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;@37afac9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:46,823 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-16 00:57:46,991 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:46,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1970220188, now seen corresponding path program 1 times [2025-04-16 00:57:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:47,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722322197] [2025-04-16 00:57:47,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:47,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-16 00:57:47,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-16 00:57:47,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:47,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:47,227 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-16 00:57:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:47,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722322197] [2025-04-16 00:57:47,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722322197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:47,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:47,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 00:57:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475023619] [2025-04-16 00:57:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:47,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 00:57:47,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:47,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 00:57:47,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 00:57:47,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:47,252 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:47,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 95.0) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 00:57:47,253 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:47,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:47,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-16 00:57:47,311 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:47,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 147726981, now seen corresponding path program 1 times [2025-04-16 00:57:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:47,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401403654] [2025-04-16 00:57:47,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:47,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:47,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-16 00:57:47,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-16 00:57:47,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:47,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:48,040 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-16 00:57:48,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:48,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401403654] [2025-04-16 00:57:48,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401403654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:48,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:48,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-16 00:57:48,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73841710] [2025-04-16 00:57:48,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:48,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 00:57:48,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:48,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 00:57:48,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-16 00:57:48,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,044 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:48,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 00:57:48,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:48,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:48,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-16 00:57:48,245 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:48,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1364480363, now seen corresponding path program 1 times [2025-04-16 00:57:48,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:48,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151562129] [2025-04-16 00:57:48,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-16 00:57:48,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-16 00:57:48,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:48,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:48,338 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-16 00:57:48,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:48,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151562129] [2025-04-16 00:57:48,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151562129] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:48,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:48,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-16 00:57:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103259717] [2025-04-16 00:57:48,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:48,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-16 00:57:48,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:48,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-16 00:57:48,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-16 00:57:48,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,340 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:48,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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-16 00:57:48,340 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,340 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:48,340 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:48,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:48,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:48,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-16 00:57:48,540 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:48,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -230313452, now seen corresponding path program 1 times [2025-04-16 00:57:48,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:48,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115609981] [2025-04-16 00:57:48,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:48,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-04-16 00:57:48,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-04-16 00:57:48,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:48,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:48,672 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-16 00:57:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:48,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115609981] [2025-04-16 00:57:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115609981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:57:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621987545] [2025-04-16 00:57:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:48,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:57:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:48,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:57:48,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:57:48,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,675 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:48,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 56.5) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-16 00:57:48,675 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,675 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:48,675 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:48,675 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:48,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:48,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:48,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:48,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-16 00:57:48,851 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:48,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1393408163, now seen corresponding path program 1 times [2025-04-16 00:57:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:48,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312419234] [2025-04-16 00:57:48,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:48,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-16 00:57:48,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-16 00:57:48,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:48,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:48,930 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-16 00:57:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:48,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312419234] [2025-04-16 00:57:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312419234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:48,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:57:48,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686108516] [2025-04-16 00:57:48,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:48,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:57:48,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:48,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:57:48,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:57:48,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,932 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:48,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 59.5) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-16 00:57:48,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:48,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:48,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:48,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:48,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:49,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:49,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-16 00:57:49,019 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:49,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash -217559610, now seen corresponding path program 1 times [2025-04-16 00:57:49,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:49,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096530378] [2025-04-16 00:57:49,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:49,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-04-16 00:57:49,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-04-16 00:57:49,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:49,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:49,148 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-16 00:57:49,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:49,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096530378] [2025-04-16 00:57:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096530378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:49,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:49,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:57:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297970329] [2025-04-16 00:57:49,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:49,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:57:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:49,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:57:49,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:57:49,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,150 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:49,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 65.0) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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-16 00:57:49,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:49,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:49,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:49,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:49,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:49,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-16 00:57:49,378 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:49,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:49,379 INFO L85 PathProgramCache]: Analyzing trace with hash 388675406, now seen corresponding path program 1 times [2025-04-16 00:57:49,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:49,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896848729] [2025-04-16 00:57:49,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:49,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-16 00:57:49,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-16 00:57:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:49,455 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-16 00:57:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:49,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896848729] [2025-04-16 00:57:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896848729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:57:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138920844] [2025-04-16 00:57:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:49,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:57:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:49,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:57:49,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:57:49,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,459 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:49,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 71.0) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-16 00:57:49,459 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,459 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:49,459 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:49,459 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,459 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,459 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,459 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:49,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:49,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:49,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:57:49,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:57:49,852 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-16 00:57:49,852 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-16 00:57:49,853 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-16 00:57:49,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-16 00:57:49,860 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-16 00:57:49,862 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2025-04-16 00:57:49,867 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:49,867 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:57:49,868 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 00:57:49,868 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=PARTIAL_ORDER_FA, 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;@37afac9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:49,868 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 00:57:49,919 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 00:57:49,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1927380908, now seen corresponding path program 1 times [2025-04-16 00:57:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:49,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492673564] [2025-04-16 00:57:49,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:49,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-16 00:57:49,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-16 00:57:49,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:49,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:57:49,937 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 00:57:49,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-16 00:57:49,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-16 00:57:49,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:49,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:57:49,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 00:57:49,965 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 00:57:49,965 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 00:57:49,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-16 00:57:49,966 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 00:57:49,966 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-04-16 00:57:49,967 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 00:57:49,967 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-16 00:57:50,010 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 00:57:50,014 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:50,021 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:57:50,021 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 00:57:50,022 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=PARTIAL_ORDER_FA, 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;@37afac9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:50,022 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 00:57:50,090 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 00:57:50,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1385704566, now seen corresponding path program 1 times [2025-04-16 00:57:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:50,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118607965] [2025-04-16 00:57:50,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-16 00:57:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-16 00:57:50,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:50,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:57:50,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 00:57:50,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-16 00:57:50,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-16 00:57:50,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:50,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:57:50,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 00:57:50,125 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 00:57:50,125 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 00:57:50,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-16 00:57:50,126 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 00:57:50,127 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-04-16 00:57:50,127 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 00:57:50,127 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-16 00:57:50,170 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 00:57:50,176 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:50,190 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:57:50,190 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-04-16 00:57:50,190 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=PARTIAL_ORDER_FA, 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;@37afac9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:57:50,190 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-16 00:57:54,847 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:54,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1773470124, now seen corresponding path program 1 times [2025-04-16 00:57:54,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:54,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904574418] [2025-04-16 00:57:54,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:54,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-16 00:57:54,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-16 00:57:54,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:54,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:54,887 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-16 00:57:54,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:54,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904574418] [2025-04-16 00:57:54,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904574418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:54,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:54,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 00:57:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639580618] [2025-04-16 00:57:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:54,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 00:57:54,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:54,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 00:57:54,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 00:57:54,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:54,890 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:54,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 99.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 00:57:54,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:55,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:55,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-16 00:57:55,019 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:55,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1163017629, now seen corresponding path program 1 times [2025-04-16 00:57:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:55,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84743446] [2025-04-16 00:57:55,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:55,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:55,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-04-16 00:57:55,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-04-16 00:57:55,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:55,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:55,321 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-16 00:57:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:55,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84743446] [2025-04-16 00:57:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84743446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:55,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-16 00:57:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012353488] [2025-04-16 00:57:55,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:55,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 00:57:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:55,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 00:57:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-16 00:57:55,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:55,323 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:55,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 00:57:55,323 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:55,323 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:55,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:55,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:55,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:55,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:55,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-16 00:57:55,947 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:57:55,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:57:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash -993310835, now seen corresponding path program 1 times [2025-04-16 00:57:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:57:55,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743040756] [2025-04-16 00:57:55,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:57:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:57:55,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-04-16 00:57:55,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-04-16 00:57:55,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:57:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:57:56,007 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-16 00:57:56,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:57:56,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743040756] [2025-04-16 00:57:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743040756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:57:56,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:57:56,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-16 00:57:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9223579] [2025-04-16 00:57:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:57:56,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-16 00:57:56,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:57:56,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-16 00:57:56,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-16 00:57:56,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:56,009 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:57:56,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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-16 00:57:56,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:56,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:57:56,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:57:56,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:57:56,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:07,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:07,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:07,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:07,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-16 00:58:07,893 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:58:07,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash 391301100, now seen corresponding path program 1 times [2025-04-16 00:58:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:07,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403369959] [2025-04-16 00:58:07,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:07,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-16 00:58:07,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-16 00:58:07,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:07,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:07,950 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-16 00:58:07,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:07,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403369959] [2025-04-16 00:58:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403369959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:07,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:07,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025072567] [2025-04-16 00:58:07,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:07,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:07,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:07,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:07,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:07,952 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:07,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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-16 00:58:07,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:07,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:07,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:07,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:07,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:07,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:08,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:08,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:08,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:08,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:08,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-16 00:58:08,703 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:58:08,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash 158076565, now seen corresponding path program 1 times [2025-04-16 00:58:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:08,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097555050] [2025-04-16 00:58:08,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-16 00:58:08,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-16 00:58:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:08,738 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-16 00:58:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:08,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097555050] [2025-04-16 00:58:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097555050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:08,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:08,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523318871] [2025-04-16 00:58:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:08,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:08,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:08,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:08,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:08,740 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:08,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 61.5) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-16 00:58:08,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:08,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:08,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:08,741 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:08,741 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:09,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:09,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:09,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:09,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:09,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:09,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-16 00:58:09,932 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:58:09,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1764172105, now seen corresponding path program 1 times [2025-04-16 00:58:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:09,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267055179] [2025-04-16 00:58:09,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:09,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-16 00:58:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-16 00:58:09,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:09,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:09,990 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-16 00:58:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:09,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267055179] [2025-04-16 00:58:09,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267055179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:09,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321506098] [2025-04-16 00:58:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:09,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:09,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:09,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:09,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:09,993 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:09,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 67.0) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-16 00:58:09,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:09,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:09,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:09,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:09,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:09,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:10,006 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:10,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:11,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:11,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:11,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:11,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:11,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:11,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:11,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-16 00:58:11,038 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:58:11,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash 546129279, now seen corresponding path program 1 times [2025-04-16 00:58:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:11,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544545010] [2025-04-16 00:58:11,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:11,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-16 00:58:11,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-16 00:58:11,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:11,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:11,077 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-16 00:58:11,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:11,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544545010] [2025-04-16 00:58:11,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544545010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:11,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:11,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:11,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009618121] [2025-04-16 00:58:11,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:11,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:11,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:11,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:11,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:11,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:11,079 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:11,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 73.0) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-16 00:58:11,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:11,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:11,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:11,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:11,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:11,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:11,079 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:11,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:11,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:12,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:12,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:12,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:12,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:12,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:12,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:12,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:12,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-16 00:58:12,407 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:58:12,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash -223047790, now seen corresponding path program 1 times [2025-04-16 00:58:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:12,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850804656] [2025-04-16 00:58:12,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:12,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-04-16 00:58:12,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-04-16 00:58:12,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-16 00:58:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:12,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850804656] [2025-04-16 00:58:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850804656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-16 00:58:12,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939520992] [2025-04-16 00:58:12,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:12,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 00:58:12,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:58:12,963 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-16 00:58:12,964 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-16 00:58:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-04-16 00:58:13,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-04-16 00:58:13,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:13,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:13,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-16 00:58:13,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-16 00:58:13,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-16 00:58:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-16 00:58:13,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-16 00:58:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939520992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:13,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-16 00:58:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-04-16 00:58:13,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631006229] [2025-04-16 00:58:13,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:13,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:13,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:13,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-16 00:58:13,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:13,367 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:13,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:13,367 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:15,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:15,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:15,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:15,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-16 00:58:15,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-16 00:58:15,294 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:58:15,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash 116023058, now seen corresponding path program 2 times [2025-04-16 00:58:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:15,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719705660] [2025-04-16 00:58:15,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-16 00:58:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:15,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 361 statements into 2 equivalence classes. [2025-04-16 00:58:15,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 231 of 361 statements. [2025-04-16 00:58:15,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-16 00:58:15,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-04-16 00:58:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:15,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719705660] [2025-04-16 00:58:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719705660] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:15,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:15,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 00:58:15,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587594928] [2025-04-16 00:58:15,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:15,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 00:58:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:15,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 00:58:15,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-16 00:58:15,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:15,723 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:15,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.666666666666664) internal successors, (304), 6 states have internal predecessors, (304), 0 states have call successors, (0), 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-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:15,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:15,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:16,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:27,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-16 00:58:27,074 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:58:27,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash 869629675, now seen corresponding path program 1 times [2025-04-16 00:58:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:27,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58831469] [2025-04-16 00:58:27,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:27,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-04-16 00:58:27,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-04-16 00:58:27,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:27,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-16 00:58:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:27,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58831469] [2025-04-16 00:58:27,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58831469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-16 00:58:27,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624011378] [2025-04-16 00:58:27,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:27,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 00:58:27,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:58:27,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-16 00:58:27,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-16 00:58:27,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-04-16 00:58:28,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-04-16 00:58:28,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:28,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:28,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-16 00:58:28,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-16 00:58:28,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:58:28,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:58:28,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-16 00:58:28,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-16 00:58:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-16 00:58:28,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-16 00:58:28,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:58:28,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 164 [2025-04-16 00:58:28,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:28,479 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:58:28,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 159 [2025-04-16 00:58:28,658 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:58:28,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 159 [2025-04-16 00:58:28,667 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:58:28,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 153 [2025-04-16 00:58:28,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 94 [2025-04-16 00:58:28,721 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:58:28,721 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2025-04-16 00:58:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-16 00:58:28,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624011378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-16 00:58:28,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-16 00:58:28,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-16 00:58:28,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015972534] [2025-04-16 00:58:28,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-16 00:58:28,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-16 00:58:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:28,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-16 00:58:28,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-16 00:58:28,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:28,785 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:28,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 34.53333333333333) internal successors, (518), 15 states have internal predecessors, (518), 0 states have call successors, (0), 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-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:28,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:28,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:29,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:58:39,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:58:39,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:58:41,247 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:58:41,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:58:49,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:58:49,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:58:52,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:58:52,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:59:02,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:59:02,204 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:59:05,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:59:05,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2025-04-16 00:59:15,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:15,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-16 00:59:15,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-16 00:59:15,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 00:59:15,661 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:59:15,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash -47750206, now seen corresponding path program 3 times [2025-04-16 00:59:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:15,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686861086] [2025-04-16 00:59:15,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-16 00:59:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:15,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2051 statements into 7 equivalence classes. [2025-04-16 00:59:16,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 751 of 2051 statements. [2025-04-16 00:59:16,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-16 00:59:16,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2025-04-16 00:59:38,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:38,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686861086] [2025-04-16 00:59:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686861086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:38,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:38,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2025-04-16 00:59:38,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338716185] [2025-04-16 00:59:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:38,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-16 00:59:38,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:38,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-16 00:59:38,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2439, Unknown=0, NotChecked=0, Total=2652 [2025-04-16 00:59:38,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:38,197 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:38,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 16.115384615384617) internal successors, (838), 52 states have internal predecessors, (838), 0 states have call successors, (0), 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-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-16 00:59:38,198 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:38,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:59:38,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:44,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-16 00:59:44,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-16 00:59:44,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-16 00:59:44,006 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:59:44,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:44,006 INFO L85 PathProgramCache]: Analyzing trace with hash -630034848, now seen corresponding path program 1 times [2025-04-16 00:59:44,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:44,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590369977] [2025-04-16 00:59:44,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:44,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-04-16 00:59:44,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-04-16 00:59:44,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:44,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2025-04-16 00:59:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:44,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590369977] [2025-04-16 00:59:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590369977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-16 00:59:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728222770] [2025-04-16 00:59:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:44,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-16 00:59:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:44,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-16 00:59:44,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-16 00:59:44,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:44,311 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:44,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 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-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-16 00:59:44,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-16 00:59:46,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-16 00:59:46,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:46,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-16 00:59:46,317 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:59:46,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1123499855, now seen corresponding path program 1 times [2025-04-16 00:59:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:46,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990253944] [2025-04-16 00:59:46,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:46,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-04-16 00:59:46,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-04-16 00:59:46,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:46,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2025-04-16 00:59:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:46,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990253944] [2025-04-16 00:59:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990253944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-16 00:59:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331276602] [2025-04-16 00:59:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:46,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-16 00:59:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:46,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-16 00:59:46,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-16 00:59:46,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:46,520 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:46,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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-16 00:59:46,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:46,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:46,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:46,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,520 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:46,521 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:46,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:59:46,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-16 00:59:48,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-16 00:59:48,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:48,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:48,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-16 00:59:48,770 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:59:48,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:48,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1075135871, now seen corresponding path program 1 times [2025-04-16 00:59:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:48,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456423204] [2025-04-16 00:59:48,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:48,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-04-16 00:59:48,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-04-16 00:59:48,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:48,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 0 proven. 1060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-16 00:59:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:51,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456423204] [2025-04-16 00:59:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456423204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-16 00:59:51,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721504069] [2025-04-16 00:59:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:51,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 00:59:51,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:59:51,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-16 00:59:51,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-16 00:59:51,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-04-16 00:59:51,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-04-16 00:59:51,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:51,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:51,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 2040 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-16 00:59:51,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-16 00:59:51,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-16 00:59:51,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2025-04-16 00:59:52,124 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-16 00:59:52,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-16 00:59:52,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:59:52,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:59:52,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:59:52,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:59:52,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-16 00:59:52,459 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-16 00:59:52,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-16 00:59:52,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:59:52,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-04-16 00:59:52,812 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-16 00:59:52,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-16 00:59:52,831 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:52,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 10 [2025-04-16 00:59:52,834 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-16 00:59:52,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-16 00:59:52,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-16 00:59:52,962 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:52,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-04-16 00:59:52,990 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:52,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-04-16 00:59:53,025 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-16 01:00:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 0 proven. 1060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-16 01:00:05,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-16 01:00:09,272 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse10 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse0 (< c_~next_alloc_idx~0 65)) (.cse5 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (or .cse0 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse1)) (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse1)) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_17 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse1)))))) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_19 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse4 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse4 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse5) 0) (not (= .cse4 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) .cse3) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse7)) (not (= .cse7 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= .cse7 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_18 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse8 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (not (= .cse8 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse8)) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_22 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse9)) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse10) 0) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse9)) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse9))))) .cse0) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_21 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse11)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse11)) (not (= .cse11 (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse10) 0)))) .cse3) (or .cse0 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= .cse12 (select v_DerPreprocessor_20 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse5) 0) (not (= .cse12 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse12 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))))))))) is different from false [2025-04-16 01:00:09,403 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse2 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse8 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse11 0))) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_21 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse0)) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse0)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= .cse0 (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) .cse3) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_22 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse4)) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse4)) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse4)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0)))) .cse5) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) .cse3) (or .cse5 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= .cse7 (select v_DerPreprocessor_20 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse8) 0) (not (= .cse7 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse7 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))))))) (or .cse5 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse9)) (not (= .cse9 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= .cse9 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))))))) (or .cse5 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse10)) (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse10)) (not (= (select v_DerPreprocessor_17 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse10)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse11) 0))))) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_19 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse12 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse12 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse12 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse8) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_18 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse13 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (not (= .cse13 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse11) 0) (not (= (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse13))))) .cse3)))) is different from false [2025-04-16 01:00:09,657 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse11 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse7 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse4 (< 64 c_~next_alloc_idx~0)) (.cse0 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1 0) .cse11 0)))) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= .cse2 (select v_DerPreprocessor_20 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= .cse2 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse2 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1))))))) .cse3) (or .cse4 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse5 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= .cse5 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse5 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_21 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse6)) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse6)) (not (= .cse6 (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) .cse4) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse8)) (not (= .cse8 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= .cse8 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or .cse4 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_19 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse9 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse9 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse9 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse10)) (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse10)) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse11) 0) (not (= (select v_DerPreprocessor_17 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse10))))) .cse3) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_DerPreprocessor_22 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse12)) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse12)) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse12))))) .cse3) (or .cse4 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_18 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse11) 0) (not (= .cse13 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (not (= .cse13 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse13))))))))) is different from false [2025-04-16 01:00:13,754 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse1 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse7 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse5 (< 64 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse0 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (store (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse9 0) .cse1 0) .cse7 0)))) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= .cse2 (select v_DerPreprocessor_20 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= .cse2 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse2 (select v_DerPreprocessor_20 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1))))))) .cse3) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_19 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_19 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse4 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse4 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse4 (select v_DerPreprocessor_19 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0)))) .cse5) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse6)) (not (= (select v_DerPreprocessor_17 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse6)) (not (= (select v_DerPreprocessor_17 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse6)) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0)))) .cse3) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_21 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse8)) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse9) 0) (not (= (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse8)) (not (= .cse8 (select v_DerPreprocessor_21 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) .cse5) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (not (= (select v_DerPreprocessor_22 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse10)) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse10)) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse9) 0) (not (= (select v_DerPreprocessor_22 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse10))))) .cse3) (or (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_18 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse11 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (not (= .cse11 (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_DerPreprocessor_18 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse11))))) .cse5) (or .cse5 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= .cse12 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse12 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse12 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))))))) (or .cse3 (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (or (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse13)) (not (= .cse13 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= .cse13 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))))))) is different from false [2025-04-16 01:00:13,784 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:00:13,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2025-04-16 01:00:13,790 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:00:13,790 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2025-04-16 01:00:13,802 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:00:13,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 54 [2025-04-16 01:00:13,811 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:00:13,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-04-16 01:00:13,819 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:00:13,819 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51 [2025-04-16 01:00:13,823 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:00:13,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36 [2025-04-16 01:00:13,838 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:00:13,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 54 [2025-04-16 01:00:13,846 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:00:13,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-04-16 01:00:13,851 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:00:13,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-04-16 01:00:13,855 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:00:13,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-04-16 01:00:13,859 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:00:13,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2025-04-16 01:00:13,869 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:00:13,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2025-04-16 01:00:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 1005 trivial. 4 not checked. [2025-04-16 01:00:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721504069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-16 01:00:14,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-16 01:00:14,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 10] total 48 [2025-04-16 01:00:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424456548] [2025-04-16 01:00:14,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-16 01:00:14,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-16 01:00:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:00:14,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-16 01:00:14,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1723, Unknown=7, NotChecked=356, Total=2352 [2025-04-16 01:00:14,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:00:14,149 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:00:14,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 27.791666666666668) internal successors, (1334), 49 states have internal predecessors, (1334), 0 states have call successors, (0), 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-16 01:00:14,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:00:14,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:00:14,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:00:14,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:00:18,422 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:26,477 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:30,487 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:34,540 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:38,563 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:42,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:50,636 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:54,670 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:00:58,692 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:02,713 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:06,770 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:10,804 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:14,826 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:18,871 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:22,918 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:26,954 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:30,973 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:34,996 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:39,024 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:43,032 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:47,035 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:51,049 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:55,056 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:01:59,083 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:03,093 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:07,116 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:11,136 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:15,156 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:19,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:23,198 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:27,213 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:31,245 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:35,284 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:39,316 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:43,365 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:47,404 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:51,725 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:55,744 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:02:59,766 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:03,788 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:07,816 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:11,828 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:15,857 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:19,888 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:23,924 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:27,935 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:31,989 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:36,009 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:40,034 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:44,055 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:48,164 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:52,202 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:56,219 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:00,242 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:04,274 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:08,310 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:12,351 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:20,419 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:24,479 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:28,495 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:32,669 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:40,765 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:44,776 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:48,798 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:52,816 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:04:56,847 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:00,865 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:04,888 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:08,900 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:12,907 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:16,948 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:20,972 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:24,981 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:29,023 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:33,041 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:37,063 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:41,111 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:45,123 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:49,139 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:53,153 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:57,166 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:01,207 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:09,263 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:13,275 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:17,348 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:29,445 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:31,877 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-16 01:06:31,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-16 01:06:31,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-16 01:06:32,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 01:06:32,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-16 01:06:32,107 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:680) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:453) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:67) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:92) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1939) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:601) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:236) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:338) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:389) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2025-04-16 01:06:32,110 INFO L158 Benchmark]: Toolchain (without parser) took 526425.86ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 109.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 912.5MB. Max. memory is 8.0GB. [2025-04-16 01:06:32,111 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-16 01:06:32,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.80ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 86.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-16 01:06:32,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.26ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 83.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-16 01:06:32,111 INFO L158 Benchmark]: Boogie Preprocessor took 43.02ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-16 01:06:32,111 INFO L158 Benchmark]: RCFGBuilder took 479.04ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 48.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-16 01:06:32,111 INFO L158 Benchmark]: TraceAbstraction took 525495.94ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 47.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 849.6MB. Max. memory is 8.0GB. [2025-04-16 01:06:32,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.80ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 86.0MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.26ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 83.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 43.02ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 479.04ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 48.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 525495.94ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 47.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 849.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 437, independent: 414, independent conditional: 17, independent unconditional: 397, dependent: 23, dependent conditional: 22, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 301, Positive conditional cache size: 0, Positive unconditional cache size: 301, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0, Independence queries for same thread: 22, Statistics for Abstraction: , Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 103, Number of trivial persistent sets: 94, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398, independent: 397, independent conditional: 0, independent unconditional: 397, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 437, independent: 414, independent conditional: 17, independent unconditional: 397, dependent: 23, dependent conditional: 22, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 301, Positive conditional cache size: 0, Positive unconditional cache size: 301, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0, Independence queries for same thread: 22, Statistics for Abstraction: , Independence relation #2 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 481, independent: 471, independent conditional: 22, independent unconditional: 449, dependent: 10, dependent conditional: 8, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 377, Positive conditional cache size: 0, Positive unconditional cache size: 377, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0, Independence queries for same thread: 30, Statistics for Abstraction: , Persistent sets #2 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 101, Number of trivial persistent sets: 89, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 451, independent: 449, independent conditional: 0, independent unconditional: 449, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 481, independent: 471, independent conditional: 22, independent unconditional: 449, dependent: 10, dependent conditional: 8, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 377, Positive conditional cache size: 0, Positive unconditional cache size: 377, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0, Independence queries for same thread: 30, Statistics for Abstraction: , Independence relation #3 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 671, independent: 651, independent conditional: 40, independent unconditional: 611, dependent: 20, dependent conditional: 11, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 741, Positive conditional cache size: 0, Positive unconditional cache size: 741, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 0, Independence queries for same thread: 41, Statistics for Abstraction: , Persistent sets #3 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 116, Number of trivial persistent sets: 96, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 620, independent: 611, independent conditional: 0, independent unconditional: 611, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 671, independent: 651, independent conditional: 40, independent unconditional: 611, dependent: 20, dependent conditional: 11, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 741, Positive conditional cache size: 0, Positive unconditional cache size: 741, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 0, Independence queries for same thread: 41, Statistics for Abstraction: , Independence relation #4 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1211, independent: 1183, independent conditional: 54, independent unconditional: 1129, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 1469, Positive cache size: 1442, Positive conditional cache size: 0, Positive unconditional cache size: 1442, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 133, Maximal queried relation: 0, Independence queries for same thread: 53, Statistics for Abstraction: , Persistent sets #4 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 125, Number of trivial persistent sets: 108, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1145, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1211, independent: 1183, independent conditional: 54, independent unconditional: 1129, dependent: 28, dependent conditional: 12, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 1469, Positive cache size: 1442, Positive conditional cache size: 0, Positive unconditional cache size: 1442, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 133, Maximal queried relation: 0, Independence queries for same thread: 53, Statistics for Abstraction: , Independence relation #5 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1300, independent: 1270, independent conditional: 61, independent unconditional: 1209, dependent: 30, dependent conditional: 13, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 1739, Positive cache size: 1695, Positive conditional cache size: 0, Positive unconditional cache size: 1695, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 194, Maximal queried relation: 0, Independence queries for same thread: 66, Statistics for Abstraction: , Persistent sets #5 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 131, Number of trivial persistent sets: 109, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1226, independent: 1209, independent conditional: 0, independent unconditional: 1209, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1300, independent: 1270, independent conditional: 61, independent unconditional: 1209, dependent: 30, dependent conditional: 13, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 1739, Positive cache size: 1695, Positive conditional cache size: 0, Positive unconditional cache size: 1695, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 194, Maximal queried relation: 0, Independence queries for same thread: 66, Statistics for Abstraction: , Independence relation #6 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1442, independent: 1403, independent conditional: 74, independent unconditional: 1329, dependent: 39, dependent conditional: 15, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 1956, Positive cache size: 1905, Positive conditional cache size: 0, Positive unconditional cache size: 1905, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 268, Maximal queried relation: 0, Independence queries for same thread: 81, Statistics for Abstraction: , Persistent sets #6 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 142, Number of trivial persistent sets: 116, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1353, independent: 1329, independent conditional: 0, independent unconditional: 1329, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1442, independent: 1403, independent conditional: 74, independent unconditional: 1329, dependent: 39, dependent conditional: 15, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 1956, Positive cache size: 1905, Positive conditional cache size: 0, Positive unconditional cache size: 1905, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 268, Maximal queried relation: 0, Independence queries for same thread: 81, Statistics for Abstraction: , Independence relation #7 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1597, independent: 1549, independent conditional: 88, independent unconditional: 1461, dependent: 48, dependent conditional: 17, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 2281, Positive cache size: 2199, Positive conditional cache size: 0, Positive unconditional cache size: 2199, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 356, Maximal queried relation: 0, Independence queries for same thread: 98, Statistics for Abstraction: , Persistent sets #7 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 154, Number of trivial persistent sets: 123, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1492, independent: 1461, independent conditional: 0, independent unconditional: 1461, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1597, independent: 1549, independent conditional: 88, independent unconditional: 1461, dependent: 48, dependent conditional: 17, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 2281, Positive cache size: 2199, Positive conditional cache size: 0, Positive unconditional cache size: 2199, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 356, Maximal queried relation: 0, Independence queries for same thread: 98, Statistics for Abstraction: , Independence relation #8 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3235, independent: 3099, independent conditional: 503, independent unconditional: 2596, dependent: 136, dependent conditional: 76, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 2715, Positive cache size: 2573, Positive conditional cache size: 0, Positive unconditional cache size: 2573, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 859, Maximal queried relation: 0, Independence queries for same thread: 174, Statistics for Abstraction: , Persistent sets #8 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 342, Number of trivial persistent sets: 297, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2656, independent: 2596, independent conditional: 0, independent unconditional: 2596, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3235, independent: 3099, independent conditional: 503, independent unconditional: 2596, dependent: 136, dependent conditional: 76, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10374, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 334, dependent conditional: 174, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 859, independent unconditional: 9181, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10200, independent: 10040, independent conditional: 0, independent unconditional: 10040, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2715, independent: 2573, independent conditional: 0, independent unconditional: 2573, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2715, independent: 2542, independent conditional: 0, independent unconditional: 2542, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 849, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 644, dependent conditional: 0, dependent unconditional: 644, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10200, independent: 7467, independent conditional: 0, independent unconditional: 7467, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2715, unknown conditional: 0, unknown unconditional: 2715] , Statistics on independence cache: Total cache size (in pairs): 2715, Positive cache size: 2573, Positive conditional cache size: 0, Positive unconditional cache size: 2573, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 859, Maximal queried relation: 0, Independence queries for same thread: 174, Statistics for Abstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 657, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 657, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 656, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 642, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 642, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 656, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 642, unknown conditional: 0, unknown unconditional: 642] , Statistics on independence cache: Total cache size (in pairs): 3357, Positive cache size: 3214, Positive conditional cache size: 0, Positive unconditional cache size: 3214, Negative cache size: 143, Negative conditional cache size: 0, Negative unconditional cache size: 143, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0, Independence queries for same thread: 1, Statistics for Abstraction: , Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 93, Number of trivial persistent sets: 88, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 650, independent: 649, independent conditional: 0, independent unconditional: 649, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 657, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 657, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 6, independent unconditional: 649, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 656, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 656, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 642, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 642, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 656, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 642, unknown conditional: 0, unknown unconditional: 642] , Statistics on independence cache: Total cache size (in pairs): 3357, Positive cache size: 3214, Positive conditional cache size: 0, Positive unconditional cache size: 3214, Negative cache size: 143, Negative conditional cache size: 0, Negative unconditional cache size: 143, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1548, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1548, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1503, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1503, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1547, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1503, unknown conditional: 0, unknown unconditional: 1503] , Statistics on independence cache: Total cache size (in pairs): 4860, Positive cache size: 4715, Positive conditional cache size: 0, Positive unconditional cache size: 4715, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0, Independence queries for same thread: 1, Statistics for Abstraction: , Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 99, Number of trivial persistent sets: 89, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1521, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1548, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1548, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 26, independent unconditional: 1519, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1547, independent: 1545, independent conditional: 0, independent unconditional: 1545, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1503, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1503, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1547, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1503, unknown conditional: 0, unknown unconditional: 1503] , Statistics on independence cache: Total cache size (in pairs): 4860, Positive cache size: 4715, Positive conditional cache size: 0, Positive unconditional cache size: 4715, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0, Independence queries for same thread: 1, Statistics for Abstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...