/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.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-04aa6ae-m [2025-04-16 00:58:43,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-16 00:58:43,758 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:58:43,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-16 00:58:43,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-16 00:58:43,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-16 00:58:43,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-16 00:58:43,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-16 00:58:43,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-16 00:58:43,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-16 00:58:43,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-16 00:58:43,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-16 00:58:43,785 INFO L153 SettingsManager]: * Use SBE=true [2025-04-16 00:58:43,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-16 00:58:43,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-16 00:58:43,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 00:58:43,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 00:58:43,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-16 00:58:43,787 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-16 00:58:43,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-16 00:58:43,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-16 00:58:43,788 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-16 00:58:43,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-16 00:58:43,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-16 00:58:43,788 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-16 00:58:43,788 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-16 00:58:43,788 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:58:44,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-16 00:58:44,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-16 00:58:44,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-16 00:58:44,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-16 00:58:44,021 INFO L274 PluginConnector]: CDTParser initialized [2025-04-16 00:58:44,021 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.i [2025-04-16 00:58:45,295 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c274ed6c5/06f191a426c0496ab8b2698a830df9ff/FLAGaadd50819 [2025-04-16 00:58:45,484 INFO L389 CDTParser]: Found 1 translation units. [2025-04-16 00:58:45,484 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2025-04-16 00:58:45,493 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c274ed6c5/06f191a426c0496ab8b2698a830df9ff/FLAGaadd50819 [2025-04-16 00:58:46,497 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c274ed6c5/06f191a426c0496ab8b2698a830df9ff [2025-04-16 00:58:46,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-16 00:58:46,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-16 00:58:46,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-16 00:58:46,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-16 00:58:46,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-16 00:58:46,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4111c866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46, skipping insertion in model container [2025-04-16 00:58:46,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-16 00:58:46,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 00:58:46,762 INFO L200 MainTranslator]: Completed pre-run [2025-04-16 00:58:46,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 00:58:46,834 INFO L204 MainTranslator]: Completed translation [2025-04-16 00:58:46,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46 WrapperNode [2025-04-16 00:58:46,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-16 00:58:46,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-16 00:58:46,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-16 00:58:46,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-16 00:58:46,843 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:58:46" (1/1) ... [2025-04-16 00:58:46,861 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:58:46" (1/1) ... [2025-04-16 00:58:46,886 INFO L138 Inliner]: procedures = 165, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 201 [2025-04-16 00:58:46,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-16 00:58:46,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-16 00:58:46,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-16 00:58:46,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-16 00:58:46,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-16 00:58:46,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-16 00:58:46,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-16 00:58:46,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-16 00:58:46,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (1/1) ... [2025-04-16 00:58:46,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 00:58:46,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:58:46,955 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:58:46,957 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:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-16 00:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-16 00:58:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-16 00:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-16 00:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-16 00:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-16 00:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-16 00:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-16 00:58:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-16 00:58:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-16 00:58:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-16 00:58:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-16 00:58:46,975 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:58:47,076 INFO L234 CfgBuilder]: Building ICFG [2025-04-16 00:58:47,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-16 00:58:47,356 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-16 00:58:47,357 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-16 00:58:47,357 INFO L294 CfgBuilder]: Performing block encoding [2025-04-16 00:58:47,448 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-16 00:58:47,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 12:58:47 BoogieIcfgContainer [2025-04-16 00:58:47,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-16 00:58:47,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-16 00:58:47,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-16 00:58:47,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-16 00:58:47,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.04 12:58:46" (1/3) ... [2025-04-16 00:58:47,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7048c34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 12:58:47, skipping insertion in model container [2025-04-16 00:58:47,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 12:58:46" (2/3) ... [2025-04-16 00:58:47,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7048c34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 12:58:47, skipping insertion in model container [2025-04-16 00:58:47,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 12:58:47" (3/3) ... [2025-04-16 00:58:47,459 INFO L128 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2025-04-16 00:58:47,469 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-16 00:58:47,471 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 37_stack_lock_p0_vs_concur.i that has 2 procedures, 194 locations, 198 edges, 1 initial locations, 2 loop locations, and 15 error locations. [2025-04-16 00:58:47,472 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-16 00:58:47,570 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 00:58:47,603 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:47,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-16 00:58:47,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:58:47,607 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:58:47,609 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:58:47,677 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:58:47,683 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-04-16 00:58:47,688 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;@473ce57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:47,689 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-16 00:58:47,838 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:58:47,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash 697311075, now seen corresponding path program 1 times [2025-04-16 00:58:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:47,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511117709] [2025-04-16 00:58:47,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:47,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-16 00:58:47,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-16 00:58:47,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:47,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:48,063 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:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:48,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511117709] [2025-04-16 00:58:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511117709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 00:58:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068478757] [2025-04-16 00:58:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:48,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 00:58:48,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:48,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 00:58:48,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 00:58:48,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:48,093 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:48,094 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:58:48,094 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:48,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:48,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-16 00:58:48,171 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:58:48,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:48,171 INFO L85 PathProgramCache]: Analyzing trace with hash 69216780, now seen corresponding path program 1 times [2025-04-16 00:58:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:48,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361350950] [2025-04-16 00:58:48,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:48,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-16 00:58:48,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-16 00:58:48,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:48,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:48,963 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:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:48,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361350950] [2025-04-16 00:58:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361350950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-16 00:58:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755836128] [2025-04-16 00:58:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:48,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 00:58:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:48,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 00:58:48,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-16 00:58:48,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:48,968 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:48,968 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:58:48,968 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:48,968 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,060 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:49,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:49,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-16 00:58:49,205 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:58:49,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash -263926562, now seen corresponding path program 1 times [2025-04-16 00:58:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:49,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848965446] [2025-04-16 00:58:49,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:49,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-16 00:58:49,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-16 00:58:49,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:49,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:49,328 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:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:49,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848965446] [2025-04-16 00:58:49,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848965446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:49,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:49,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-16 00:58:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040534625] [2025-04-16 00:58:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:49,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-16 00:58:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:49,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-16 00:58:49,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-16 00:58:49,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,332 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:49,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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:49,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:49,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,363 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:49,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:49,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:49,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-16 00:58:49,517 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:49,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash 432943899, now seen corresponding path program 1 times [2025-04-16 00:58:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:49,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574979208] [2025-04-16 00:58:49,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:49,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-04-16 00:58:49,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-04-16 00:58:49,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:49,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:49,635 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:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:49,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574979208] [2025-04-16 00:58:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574979208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:49,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896897133] [2025-04-16 00:58:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:49,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:49,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:49,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:49,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:49,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,637 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:49,638 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:58:49,638 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,638 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:49,638 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:49,638 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,666 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:49,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:49,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:49,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:49,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-16 00:58:49,796 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:49,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1597429500, now seen corresponding path program 1 times [2025-04-16 00:58:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:49,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273430669] [2025-04-16 00:58:49,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:49,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:49,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-16 00:58:49,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-16 00:58:49,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:49,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:49,869 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:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:49,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273430669] [2025-04-16 00:58:49,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273430669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:49,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:49,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:49,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275316966] [2025-04-16 00:58:49,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:49,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:49,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:49,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:49,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,871 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:49,871 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:58:49,871 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,871 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:49,871 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:49,872 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:49,872 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:49,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:49,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:49,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:49,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:49,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-16 00:58:49,943 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:49,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:49,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2122192911, now seen corresponding path program 1 times [2025-04-16 00:58:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:49,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70744239] [2025-04-16 00:58:49,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:49,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-04-16 00:58:49,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-04-16 00:58:49,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:49,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:50,031 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:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:50,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70744239] [2025-04-16 00:58:50,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70744239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:50,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:50,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591275117] [2025-04-16 00:58:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:50,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:50,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:50,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:50,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,032 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:50,033 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:58:50,033 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,033 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:50,033 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:50,033 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,033 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,033 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,052 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:50,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:50,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:50,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-16 00:58:50,241 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:50,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash -474212359, now seen corresponding path program 1 times [2025-04-16 00:58:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:50,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474082095] [2025-04-16 00:58:50,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:50,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-16 00:58:50,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-16 00:58:50,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:50,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:50,301 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:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:50,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474082095] [2025-04-16 00:58:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474082095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:58:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714998927] [2025-04-16 00:58:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:50,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:58:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:50,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:58:50,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:58:50,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,302 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:50,303 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:58:50,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:50,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:50,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,322 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:50,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:50,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:50,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:58:50,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:58:50,701 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-16 00:58:50,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-16 00:58:50,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-16 00:58:50,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-16 00:58:50,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-16 00:58:50,702 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-16 00:58:50,703 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-16 00:58:50,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-16 00:58:50,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-16 00:58:50,711 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:58:50,715 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:50,716 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:58:50,716 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 00:58:50,716 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;@473ce57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:50,716 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 00:58:50,769 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 00:58:50,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash -95775725, now seen corresponding path program 1 times [2025-04-16 00:58:50,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:50,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148199666] [2025-04-16 00:58:50,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:50,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-16 00:58:50,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-16 00:58:50,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:50,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:58:50,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 00:58:50,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-16 00:58:50,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-16 00:58:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:50,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:58:50,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 00:58:50,823 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 00:58:50,823 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 00:58:50,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-16 00:58:50,824 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 00:58:50,825 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-04-16 00:58:50,826 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 00:58:50,826 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-16 00:58:50,883 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 00:58:50,886 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:50,892 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:58:50,892 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 00:58:50,892 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;@473ce57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:50,892 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 00:58:50,974 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 00:58:50,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1870405785, now seen corresponding path program 1 times [2025-04-16 00:58:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:50,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462789963] [2025-04-16 00:58:50,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:50,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:50,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-16 00:58:50,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-16 00:58:50,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:50,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:58:50,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 00:58:51,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-16 00:58:51,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-16 00:58:51,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:51,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 00:58:51,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 00:58:51,022 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 00:58:51,022 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 00:58:51,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-16 00:58:51,023 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 00:58:51,023 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-04-16 00:58:51,023 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 00:58:51,023 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-16 00:58:51,072 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 00:58:51,078 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:51,092 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 00:58:51,093 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-04-16 00:58:51,093 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;@473ce57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 00:58:51,093 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-16 00:58:55,746 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:58:55,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1984645609, now seen corresponding path program 1 times [2025-04-16 00:58:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:55,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057259231] [2025-04-16 00:58:55,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:55,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-16 00:58:55,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-16 00:58:55,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:55,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:55,775 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:55,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:55,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057259231] [2025-04-16 00:58:55,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057259231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 00:58:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640155271] [2025-04-16 00:58:55,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:55,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 00:58:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:55,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 00:58:55,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 00:58:55,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:55,777 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:55,777 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:58:55,777 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:55,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:55,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-16 00:58:55,876 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:58:55,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2123953504, now seen corresponding path program 1 times [2025-04-16 00:58:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:55,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9429153] [2025-04-16 00:58:55,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:55,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:55,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-04-16 00:58:55,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-04-16 00:58:55,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:55,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:56,222 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:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:56,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9429153] [2025-04-16 00:58:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9429153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-16 00:58:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402005487] [2025-04-16 00:58:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:56,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 00:58:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:56,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 00:58:56,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-16 00:58:56,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:56,224 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:56,224 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:58:56,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:56,224 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:56,285 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:56,303 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:56,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:56,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:56,856 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-16 00:58:56,856 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:58:56,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:58:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1901826674, now seen corresponding path program 1 times [2025-04-16 00:58:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:58:56,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011717673] [2025-04-16 00:58:56,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:58:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:58:56,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-04-16 00:58:56,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-04-16 00:58:56,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:58:56,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:58:56,913 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:56,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:58:56,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011717673] [2025-04-16 00:58:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011717673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:58:56,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:58:56,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-16 00:58:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425478716] [2025-04-16 00:58:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:58:56,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-16 00:58:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:58:56,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-16 00:58:56,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-16 00:58:56,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:56,915 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:58:56,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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:56,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:56,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:58:56,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:58:56,932 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:56,943 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:08,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:08,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:08,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:08,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-16 00:59:08,915 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:59:08,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1286795119, now seen corresponding path program 1 times [2025-04-16 00:59:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:08,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627250951] [2025-04-16 00:59:08,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:08,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-16 00:59:08,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-16 00:59:08,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:08,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:08,978 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:59:08,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:08,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627250951] [2025-04-16 00:59:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627250951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:08,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:08,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:59:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665238767] [2025-04-16 00:59:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:08,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:59:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:08,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:59:08,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:59:08,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:08,981 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:08,981 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:59:08,981 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:08,982 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:08,982 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:08,982 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:08,995 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:09,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:59:09,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:09,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:09,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:09,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:09,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-16 00:59:09,767 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:59:09,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash 927299384, now seen corresponding path program 1 times [2025-04-16 00:59:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:09,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271605083] [2025-04-16 00:59:09,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:09,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-16 00:59:09,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-16 00:59:09,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:09,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:09,808 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:59:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:09,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271605083] [2025-04-16 00:59:09,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271605083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:09,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:09,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:59:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469556435] [2025-04-16 00:59:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:09,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:59:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:09,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:59:09,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:59:09,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:09,810 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:09,810 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:59:09,810 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:09,810 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:09,810 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:09,810 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:09,810 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:11,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:11,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:11,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:11,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:11,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:11,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-16 00:59:11,009 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:59:11,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -182389238, now seen corresponding path program 1 times [2025-04-16 00:59:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:11,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490715810] [2025-04-16 00:59:11,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:11,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-16 00:59:11,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-16 00:59:11,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:11,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:11,072 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:59:11,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:11,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490715810] [2025-04-16 00:59:11,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490715810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:11,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:59:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183361908] [2025-04-16 00:59:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:11,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:59:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:11,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:59:11,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:59:11,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:11,074 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:11,074 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:59:11,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:11,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:11,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:11,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:11,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:11,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:11,086 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:11,098 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:12,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:12,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:12,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:12,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:12,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:12,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:12,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-16 00:59:12,188 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:59:12,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 992993874, now seen corresponding path program 1 times [2025-04-16 00:59:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:12,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692496138] [2025-04-16 00:59:12,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:12,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-16 00:59:12,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-16 00:59:12,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:12,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:12,229 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:59:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:12,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692496138] [2025-04-16 00:59:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692496138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:12,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-16 00:59:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752403253] [2025-04-16 00:59:12,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:12,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:59:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:12,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:59:12,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-16 00:59:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:12,231 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:12,231 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:59:12,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:12,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:12,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:12,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:12,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:12,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:12,231 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:12,243 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:12,254 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:13,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:13,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:13,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:13,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:13,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:13,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:13,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:13,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-16 00:59:13,616 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:59:13,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1777741198, now seen corresponding path program 1 times [2025-04-16 00:59:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:13,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697328949] [2025-04-16 00:59:13,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:13,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-04-16 00:59:13,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-04-16 00:59:13,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:13,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:14,157 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:59:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:14,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697328949] [2025-04-16 00:59:14,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697328949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-16 00:59:14,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537612528] [2025-04-16 00:59:14,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:14,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 00:59:14,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:59:14,159 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:59:14,161 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:59:14,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-04-16 00:59:14,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-04-16 00:59:14,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:14,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:14,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-16 00:59:14,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-16 00:59:14,495 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:14,554 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:59:14,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-16 00:59:14,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537612528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:14,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-16 00:59:14,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-04-16 00:59:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409426745] [2025-04-16 00:59:14,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:14,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-16 00:59:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:14,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-16 00:59:14,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-16 00:59:14,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:14,557 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:14,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:14,557 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:16,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:16,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:16,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:16,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,087 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:59:16,280 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:59:16,280 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:59:16,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash -983153559, now seen corresponding path program 1 times [2025-04-16 00:59:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:16,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788772837] [2025-04-16 00:59:16,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:16,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:16,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-04-16 00:59:16,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-04-16 00:59:16,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:16,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:16,395 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:59:16,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:16,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788772837] [2025-04-16 00:59:16,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788772837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:16,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:16,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-16 00:59:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553573075] [2025-04-16 00:59:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:16,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-16 00:59:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:16,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-16 00:59:16,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-16 00:59:16,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:16,398 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:16,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 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:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:16,399 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:17,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:17,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:17,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-16 00:59:17,574 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:59:17,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1739855769, now seen corresponding path program 1 times [2025-04-16 00:59:17,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:17,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141482441] [2025-04-16 00:59:17,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:17,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-04-16 00:59:17,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-04-16 00:59:17,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:17,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-04-16 00:59:18,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:18,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141482441] [2025-04-16 00:59:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141482441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 00:59:18,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 00:59:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-16 00:59:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226137530] [2025-04-16 00:59:18,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 00:59:18,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-16 00:59:18,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:18,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-16 00:59:18,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-16 00:59:18,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:18,324 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:18,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.666666666666664) internal successors, (316), 6 states have internal predecessors, (316), 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:18,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:18,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:18,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:18,347 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:18,645 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:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:29,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:29,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-16 00:59:29,025 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 00:59:29,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 00:59:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash -32309344, now seen corresponding path program 1 times [2025-04-16 00:59:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 00:59:29,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683774019] [2025-04-16 00:59:29,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 00:59:29,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-04-16 00:59:29,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-04-16 00:59:29,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:29,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-16 00:59:29,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 00:59:29,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683774019] [2025-04-16 00:59:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683774019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-16 00:59:29,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68321958] [2025-04-16 00:59:29,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 00:59:29,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 00:59:29,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 00:59:29,650 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:59:29,652 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:59:29,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-04-16 00:59:29,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-04-16 00:59:29,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 00:59:29,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 00:59:29,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-16 00:59:30,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-16 00:59:30,051 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:30,121 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:30,152 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:30,156 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:59:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-16 00:59:30,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-16 00:59:30,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:30,233 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:59:30,357 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:59:30,374 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 107 treesize of output 85 [2025-04-16 00:59:30,553 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:30,554 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:59:30,779 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:30,780 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:59:30,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:30,788 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:59:30,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 00:59:30,857 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 47 treesize of output 13 [2025-04-16 00:59:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-16 00:59:30,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68321958] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-16 00:59:30,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-16 00:59:30,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-16 00:59:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876331157] [2025-04-16 00:59:30,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-16 00:59:30,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-16 00:59:30,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 00:59:30,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-16 00:59:30,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-16 00:59:30,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:30,928 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 00:59:30,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.6) internal successors, (534), 15 states have internal predecessors, (534), 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:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 00:59:30,928 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 00:59:30,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:59:31,833 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:41,529 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:41,566 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:47,401 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:47,434 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:58,413 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:58,440 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 01:00:04,291 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 01:00:04,323 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 01:00:11,184 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 01:00:11,220 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 01:00:16,394 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 01:00:16,438 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 01:00:26,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:00:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-16 01:00:26,127 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 01:00:26,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 01:00:26,319 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 01:00:26,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:00:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash 450820395, now seen corresponding path program 2 times [2025-04-16 01:00:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:00:26,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077774932] [2025-04-16 01:00:26,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-16 01:00:26,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:00:26,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2171 statements into 2 equivalence classes. [2025-04-16 01:00:27,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1688 of 2171 statements. [2025-04-16 01:00:27,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-16 01:00:27,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:00:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2025-04-16 01:00:32,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:00:32,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077774932] [2025-04-16 01:00:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077774932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:00:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:00:32,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-16 01:00:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568125781] [2025-04-16 01:00:32,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:00:32,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-16 01:00:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:00:32,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-16 01:00:32,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-16 01:00:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:00:32,309 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:00:32,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 32.111111111111114) internal successors, (289), 10 states have internal predecessors, (289), 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:32,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:00:32,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:00:32,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:00:32,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:32,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:32,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:32,310 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:32,310 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:00:32,310 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:00:32,310 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:00:32,310 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-16 01:00:32,310 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:00:32,355 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 01:00:32,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 01:00:32,378 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 01:00:33,782 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 01:00:44,669 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 01:00:44,697 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 01:00:50,989 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 01:00:51,014 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 01:00:58,761 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 01:00:58,789 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 01:01:03,038 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 01:01:03,085 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 01:01:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:01:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:01:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:01:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:12,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:12,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:12,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:01:12,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:01:12,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-16 01:01:12,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-16 01:01:12,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-16 01:01:12,231 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-16 01:01:12,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:01:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -945599749, now seen corresponding path program 3 times [2025-04-16 01:01:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:01:12,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911917932] [2025-04-16 01:01:12,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-16 01:01:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:01:12,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2395 statements into 7 equivalence classes. [2025-04-16 01:01:13,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1843 of 2395 statements. [2025-04-16 01:01:13,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-16 01:01:13,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:01:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2025-04-16 01:01:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:01:41,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911917932] [2025-04-16 01:01:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911917932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:01:41,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:01:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-04-16 01:01:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075282633] [2025-04-16 01:01:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:01:41,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-16 01:01:41,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:01:41,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-16 01:01:41,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2025-04-16 01:01:41,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:01:41,045 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:01:41,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 28.82608695652174) internal successors, (663), 23 states have internal predecessors, (663), 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:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-16 01:01:41,046 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:01:43,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:01:43,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:01:43,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:01:43,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:43,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-16 01:01:43,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-16 01:01:43,829 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-16 01:01:43,829 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 01:01:43,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:01:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2012914563, now seen corresponding path program 1 times [2025-04-16 01:01:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:01:43,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892649142] [2025-04-16 01:01:43,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:01:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:01:43,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-04-16 01:01:43,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-04-16 01:01:43,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:01:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:01:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 0 proven. 1120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-16 01:01:46,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:01:46,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892649142] [2025-04-16 01:01:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892649142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-16 01:01:46,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824050344] [2025-04-16 01:01:46,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:01:46,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-16 01:01:46,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 01:01:46,694 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 01:01:46,695 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 01:01:47,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-04-16 01:01:47,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-04-16 01:01:47,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:01:47,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:01:47,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 2152 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-16 01:01:47,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-16 01:01:47,285 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 01:01:47,288 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 01:01:47,494 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-16 01:01:47,494 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 01:01:47,561 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 01:01:47,614 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 01:01:47,685 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 01:01:47,742 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 01:01:47,793 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 01:01:47,846 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-16 01:01:47,846 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 01:01:47,881 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 01:01:48,094 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 01:01:48,132 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-16 01:01:48,133 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 01:01:48,152 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 01:01:48,156 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:01:48,156 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 01:01:48,227 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 01:01:48,245 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 01:01:48,269 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:01:48,269 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 01:01:48,300 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:01:48,300 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 01:01:48,335 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:02:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 0 proven. 1120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-16 01:02:00,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-16 01:02:04,572 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse6 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse3 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1))) (and (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse0 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= .cse0 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse0 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0) (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse4 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse4 (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 (= .cse4 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (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)))) (not (= .cse5 (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|) .cse6) 0) (not (= .cse5 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))))))) (< c_~next_alloc_idx~0 65)) (or (and (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|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse7)) (= (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) (not (= .cse7 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse7))))) (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|))) (or (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (not (= .cse8 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse8))))) (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|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse9)) (not (= .cse9 (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|) .cse6) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse9))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse10)) (not (= .cse10 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse10)))))) (< 64 c_~next_alloc_idx~0)))) is different from false [2025-04-16 01:02:04,685 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse7 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse1 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4 0))) (.cse3 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse0 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse0 (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 (= .cse0 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse2 (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|) .cse3) 0) (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (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 (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0) (not (= .cse5 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (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))))))) (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)))) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0))))) (< c_~next_alloc_idx~0 65)) (or (and (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|))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (not (= .cse8 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse8))))) (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|))) (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| 2)) .cse9)) (not (= .cse9 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse9))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse10)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= .cse10 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse10))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse11)) (not (= .cse11 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse11)))))) (< 64 c_~next_alloc_idx~0))))) is different from false [2025-04-16 01:02:04,901 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse4 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse7 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.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) .cse4 0)))) (and (or (< c_~next_alloc_idx~0 65) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse2 (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|) .cse1) 0) (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse2 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse3 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse3 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0) (not (= .cse3 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (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))))))) (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 .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))))) (or (< 64 c_~next_alloc_idx~0) (and (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|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= .cse8 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse8))))) (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|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse9)) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse1) 0) (not (= .cse9 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse9))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse10)) (not (= .cse10 (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|) .cse4) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse10))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse11)) (= (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 (= .cse11 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse11)))))))))) is different from false [2025-04-16 01:02:08,995 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse2 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse4 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (store (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7 0) .cse2 0) .cse4 0)))) (and (or (< c_~next_alloc_idx~0 65) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse0 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse0 (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|) .cse2) 0) (not (= .cse0 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_16 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_16 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (not (= .cse3 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= .cse3 (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|) .cse4) 0) (not (= .cse3 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))) (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 (= (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 (= .cse5 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (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))))))) (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)))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (not (= .cse6 (select v_DerPreprocessor_16 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2))))))))) (or (< 64 c_~next_alloc_idx~0) (and (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|))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (not (= .cse8 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse8))))) (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|))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse9)) (not (= .cse9 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse9))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (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| 2)) .cse10)) (not (= .cse10 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse10))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_15 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_15 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse11)) (not (= .cse11 (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (not (= (select v_DerPreprocessor_15 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)) .cse11)))))))))) is different from false [2025-04-16 01:02:09,028 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:02:09,028 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:02:09,035 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:02:09,035 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:02:09,050 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:02:09,051 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 36 treesize of output 54 [2025-04-16 01:02:09,060 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:02:09,060 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:02:09,064 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:02:09,065 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:02:09,069 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:02:09,069 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:02:09,084 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:02:09,085 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:02:09,093 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:02:09,093 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:02:09,119 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-16 01:02:09,119 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:02:09,133 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:02:09,133 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:02:09,140 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:02:09,140 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:02:09,147 INFO L325 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2025-04-16 01:02:09,148 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:02:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 1065 trivial. 4 not checked. [2025-04-16 01:02:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824050344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-16 01:02:09,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-16 01:02:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 10] total 48 [2025-04-16 01:02:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562698639] [2025-04-16 01:02:09,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-16 01:02:09,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-16 01:02:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:02:09,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-16 01:02:09,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1723, Unknown=7, NotChecked=356, Total=2352 [2025-04-16 01:02:09,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:02:09,471 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:02:09,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 29.125) internal successors, (1398), 49 states have internal predecessors, (1398), 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:02:09,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:02:09,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:02:09,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:02:09,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:02:09,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:02:09,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-16 01:02:09,472 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:02:13,858 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:21,945 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:25,987 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:30,026 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:02:34,045 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:38,096 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:46,211 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:02:50,228 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:54,248 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:58,274 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:02,300 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:06,330 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:10,367 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:14,391 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:18,421 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:22,430 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:26,451 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:30,481 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:34,497 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:38,518 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:42,540 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:46,561 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:50,602 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:54,674 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:03:58,684 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:02,707 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:06,734 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:10,749 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:14,792 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:18,804 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:22,859 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:04:26,889 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:30,951 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:04:34,983 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:39,037 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:43,071 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:47,093 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:51,106 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:55,127 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:59,203 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:03,246 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:07,273 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:11,313 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:15,327 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:19,396 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:23,449 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:27,536 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:05:31,552 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:35,576 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:39,596 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:43,628 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:47,641 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:51,662 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:55,708 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:59,743 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:03,758 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:07,813 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:06:15,872 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:19,891 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:23,919 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:06:28,122 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:36,181 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:40,282 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:06:44,303 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:48,326 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:52,349 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:56,388 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:07:00,454 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:07:04,461 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:07:08,486 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:07:12,509 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:07:16,527 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:07:20,575 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:07:24,587 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:07:28,611 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:07:32,680 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-16 01:07:36,701 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:07:37,942 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:07:37,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-16 01:07:37,953 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:07:38,143 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:07:38,179 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:07:38,180 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.(NestedIterator.java:60) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) 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) ... 55 more [2025-04-16 01:07:38,184 INFO L158 Benchmark]: Toolchain (without parser) took 531684.24ms. Allocated memory was 125.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 90.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 450.1MB. Max. memory is 8.0GB. [2025-04-16 01:07:38,184 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-16 01:07:38,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.38ms. Allocated memory is still 125.8MB. Free memory was 90.5MB in the beginning and 67.0MB in the end (delta: 23.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-16 01:07:38,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.05ms. Allocated memory is still 125.8MB. Free memory was 67.0MB in the beginning and 64.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-16 01:07:38,184 INFO L158 Benchmark]: Boogie Preprocessor took 38.80ms. Allocated memory is still 125.8MB. Free memory was 64.3MB in the beginning and 62.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-16 01:07:38,184 INFO L158 Benchmark]: RCFGBuilder took 522.67ms. Allocated memory is still 125.8MB. Free memory was 62.1MB in the beginning and 28.6MB in the end (delta: 33.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-16 01:07:38,184 INFO L158 Benchmark]: TraceAbstraction took 530733.07ms. Allocated memory was 125.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 27.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 391.4MB. Max. memory is 8.0GB. [2025-04-16 01:07:38,184 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.14ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 336.38ms. Allocated memory is still 125.8MB. Free memory was 90.5MB in the beginning and 67.0MB in the end (delta: 23.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.05ms. Allocated memory is still 125.8MB. Free memory was 67.0MB in the beginning and 64.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.80ms. Allocated memory is still 125.8MB. Free memory was 64.3MB in the beginning and 62.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 522.67ms. Allocated memory is still 125.8MB. Free memory was 62.1MB in the beginning and 28.6MB in the end (delta: 33.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 530733.07ms. Allocated memory was 125.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 27.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 391.4MB. 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: 445, independent: 422, independent conditional: 17, independent unconditional: 405, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 305, Positive conditional cache size: 0, Positive unconditional cache size: 305, 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: 406, independent: 405, independent conditional: 0, independent unconditional: 405, 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: 445, independent: 422, independent conditional: 17, independent unconditional: 405, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 305, Positive conditional cache size: 0, Positive unconditional cache size: 305, 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: 489, independent: 479, independent conditional: 22, independent unconditional: 457, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 381, Positive conditional cache size: 0, Positive unconditional cache size: 381, 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: 459, independent: 457, independent conditional: 0, independent unconditional: 457, 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: 489, independent: 479, independent conditional: 22, independent unconditional: 457, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 381, Positive conditional cache size: 0, Positive unconditional cache size: 381, 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: 705, independent: 685, independent conditional: 42, independent unconditional: 643, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 769, Positive conditional cache size: 0, Positive unconditional cache size: 769, 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: 81, Maximal queried relation: 0, Independence queries for same thread: 41, Statistics for Abstraction: , Persistent sets #3 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 118, Number of trivial persistent sets: 96, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 652, independent: 643, independent conditional: 0, independent unconditional: 643, 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: 705, independent: 685, independent conditional: 42, independent unconditional: 643, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 769, Positive conditional cache size: 0, Positive unconditional cache size: 769, 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: 81, Maximal queried relation: 0, Independence queries for same thread: 41, Statistics for Abstraction: , Independence relation #4 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1239, independent: 1211, independent conditional: 54, independent unconditional: 1157, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 1517, Positive cache size: 1490, Positive conditional cache size: 0, Positive unconditional cache size: 1490, 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: 135, 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: 1173, independent: 1157, independent conditional: 0, independent unconditional: 1157, 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: 1239, independent: 1211, independent conditional: 54, independent unconditional: 1157, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 1517, Positive cache size: 1490, Positive conditional cache size: 0, Positive unconditional cache size: 1490, 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: 135, Maximal queried relation: 0, Independence queries for same thread: 53, Statistics for Abstraction: , Independence relation #5 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1328, independent: 1298, independent conditional: 61, independent unconditional: 1237, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 1787, Positive cache size: 1743, Positive conditional cache size: 0, Positive unconditional cache size: 1743, 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: 196, 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: 1254, independent: 1237, independent conditional: 0, independent unconditional: 1237, 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: 1328, independent: 1298, independent conditional: 61, independent unconditional: 1237, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 1787, Positive cache size: 1743, Positive conditional cache size: 0, Positive unconditional cache size: 1743, 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: 196, Maximal queried relation: 0, Independence queries for same thread: 66, Statistics for Abstraction: , Independence relation #6 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1470, independent: 1431, independent conditional: 74, independent unconditional: 1357, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 2004, Positive cache size: 1953, Positive conditional cache size: 0, Positive unconditional cache size: 1953, 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: 270, 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: 1381, independent: 1357, independent conditional: 0, independent unconditional: 1357, 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: 1470, independent: 1431, independent conditional: 74, independent unconditional: 1357, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 2004, Positive cache size: 1953, Positive conditional cache size: 0, Positive unconditional cache size: 1953, 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: 270, Maximal queried relation: 0, Independence queries for same thread: 81, Statistics for Abstraction: , Independence relation #7 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1625, independent: 1577, independent conditional: 88, independent unconditional: 1489, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 2329, Positive cache size: 2247, Positive conditional cache size: 0, Positive unconditional cache size: 2247, 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: 358, 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: 1520, independent: 1489, independent conditional: 0, independent unconditional: 1489, 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: 1625, independent: 1577, independent conditional: 88, independent unconditional: 1489, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 2329, Positive cache size: 2247, Positive conditional cache size: 0, Positive unconditional cache size: 2247, 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: 358, Maximal queried relation: 0, Independence queries for same thread: 98, Statistics for Abstraction: , Independence relation #8 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3355, independent: 3219, independent conditional: 507, independent unconditional: 2712, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 2789, Positive cache size: 2647, Positive conditional cache size: 0, Positive unconditional cache size: 2647, 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: 865, 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: 346, Number of trivial persistent sets: 297, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2772, independent: 2712, independent conditional: 0, independent unconditional: 2712, 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: 3355, independent: 3219, independent conditional: 507, independent unconditional: 2712, 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: 10656, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 865, independent unconditional: 9457, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 10482, independent: 10322, independent conditional: 0, independent unconditional: 10322, 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: 2789, independent: 2647, independent conditional: 0, independent unconditional: 2647, 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: 2789, independent: 2616, independent conditional: 0, independent unconditional: 2616, 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: 806, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 610, dependent conditional: 0, dependent unconditional: 610, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10482, independent: 7675, independent conditional: 0, independent unconditional: 7675, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2789, unknown conditional: 0, unknown unconditional: 2789] , Statistics on independence cache: Total cache size (in pairs): 2789, Positive cache size: 2647, Positive conditional cache size: 0, Positive unconditional cache size: 2647, 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: 865, 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: 681, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 681, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 0, independent unconditional: 679, 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: 680, independent: 679, independent conditional: 0, independent unconditional: 679, 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: 666, independent: 665, independent conditional: 0, independent unconditional: 665, 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: 666, independent: 665, independent conditional: 0, independent unconditional: 665, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 680, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 666, unknown conditional: 0, unknown unconditional: 666] , Statistics on independence cache: Total cache size (in pairs): 3455, Positive cache size: 3312, Positive conditional cache size: 0, Positive unconditional cache size: 3312, 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: 674, independent: 673, independent conditional: 0, independent unconditional: 673, 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: 681, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 681, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 6, independent unconditional: 673, 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: 680, independent: 679, independent conditional: 0, independent unconditional: 679, 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: 680, independent: 679, independent conditional: 0, independent unconditional: 679, 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: 666, independent: 665, independent conditional: 0, independent unconditional: 665, 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: 666, independent: 665, independent conditional: 0, independent unconditional: 665, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 680, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 666, unknown conditional: 0, unknown unconditional: 666] , Statistics on independence cache: Total cache size (in pairs): 3455, Positive cache size: 3312, Positive conditional cache size: 0, Positive unconditional cache size: 3312, 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: 1604, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1604, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 0, independent unconditional: 1601, 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: 1603, independent: 1601, independent conditional: 0, independent unconditional: 1601, 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: 1559, independent: 1557, independent conditional: 0, independent unconditional: 1557, 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: 1559, independent: 1557, independent conditional: 0, independent unconditional: 1557, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1603, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1559, unknown conditional: 0, unknown unconditional: 1559] , Statistics on independence cache: Total cache size (in pairs): 5014, Positive cache size: 4869, Positive conditional cache size: 0, Positive unconditional cache size: 4869, 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: 1577, independent: 1575, independent conditional: 0, independent unconditional: 1575, 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: 1604, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1604, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 26, independent unconditional: 1575, 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: 1603, independent: 1601, independent conditional: 0, independent unconditional: 1601, 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: 1603, independent: 1601, independent conditional: 0, independent unconditional: 1601, 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: 1559, independent: 1557, independent conditional: 0, independent unconditional: 1557, 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: 1559, independent: 1557, independent conditional: 0, independent unconditional: 1557, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1603, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1559, unknown conditional: 0, unknown unconditional: 1559] , Statistics on independence cache: Total cache size (in pairs): 5014, Positive cache size: 4869, Positive conditional cache size: 0, Positive unconditional cache size: 4869, 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...