/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/46_monabsex2_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-04aa6ae-m [2025-04-16 01:06:15,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-16 01:06:16,031 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 01:06:16,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-16 01:06:16,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-16 01:06:16,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-16 01:06:16,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-16 01:06:16,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-16 01:06:16,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-16 01:06:16,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-16 01:06:16,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-16 01:06:16,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-16 01:06:16,063 INFO L153 SettingsManager]: * Use SBE=true [2025-04-16 01:06:16,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-16 01:06:16,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-16 01:06:16,063 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-16 01:06:16,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 01:06:16,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-16 01:06:16,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 01:06:16,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-16 01:06:16,065 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-16 01:06:16,065 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 01:06:16,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-16 01:06:16,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-16 01:06:16,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-16 01:06:16,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-16 01:06:16,274 INFO L274 PluginConnector]: CDTParser initialized [2025-04-16 01:06:16,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2025-04-16 01:06:17,553 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b417ef067/67a11be6fc024e3895d160b5d240e1dc/FLAG51371a8cc [2025-04-16 01:06:17,822 INFO L389 CDTParser]: Found 1 translation units. [2025-04-16 01:06:17,823 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2025-04-16 01:06:17,843 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b417ef067/67a11be6fc024e3895d160b5d240e1dc/FLAG51371a8cc [2025-04-16 01:06:18,604 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b417ef067/67a11be6fc024e3895d160b5d240e1dc [2025-04-16 01:06:18,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-16 01:06:18,607 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-16 01:06:18,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-16 01:06:18,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-16 01:06:18,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-16 01:06:18,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:18,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647543c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18, skipping insertion in model container [2025-04-16 01:06:18,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:18,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-16 01:06:18,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 01:06:18,921 INFO L200 MainTranslator]: Completed pre-run [2025-04-16 01:06:18,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-16 01:06:18,992 INFO L204 MainTranslator]: Completed translation [2025-04-16 01:06:18,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18 WrapperNode [2025-04-16 01:06:18,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-16 01:06:18,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-16 01:06:18,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-16 01:06:18,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-16 01:06:18,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,018 INFO L138 Inliner]: procedures = 168, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-04-16 01:06:19,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-16 01:06:19,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-16 01:06:19,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-16 01:06:19,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-16 01:06:19,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-16 01:06:19,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-16 01:06:19,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-16 01:06:19,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-16 01:06:19,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (1/1) ... [2025-04-16 01:06:19,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-16 01:06:19,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 01:06:19,061 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 01:06:19,063 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 01:06:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-16 01:06:19,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-16 01:06:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-16 01:06:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-16 01:06:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-16 01:06:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-16 01:06:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-16 01:06:19,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-16 01:06:19,081 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 01:06:19,174 INFO L234 CfgBuilder]: Building ICFG [2025-04-16 01:06:19,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-16 01:06:19,247 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-16 01:06:19,248 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-16 01:06:19,248 INFO L294 CfgBuilder]: Performing block encoding [2025-04-16 01:06:19,310 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-16 01:06:19,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 01:06:19 BoogieIcfgContainer [2025-04-16 01:06:19,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-16 01:06:19,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-16 01:06:19,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-16 01:06:19,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-16 01:06:19,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.04 01:06:18" (1/3) ... [2025-04-16 01:06:19,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dea17e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 01:06:19, skipping insertion in model container [2025-04-16 01:06:19,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.04 01:06:18" (2/3) ... [2025-04-16 01:06:19,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dea17e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.04 01:06:19, skipping insertion in model container [2025-04-16 01:06:19,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.04 01:06:19" (3/3) ... [2025-04-16 01:06:19,318 INFO L128 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2025-04-16 01:06:19,327 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-16 01:06:19,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 46_monabsex2_vs.i that has 2 procedures, 31 locations, 30 edges, 1 initial locations, 1 loop locations, and 5 error locations. [2025-04-16 01:06:19,329 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-16 01:06:19,352 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 01:06:19,379 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-16 01:06:19,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-16 01:06:19,381 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 01:06:19,383 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 01:06:19,436 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:19,443 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-04-16 01:06:19,447 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,447 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:19,519 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:19,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -464915066, now seen corresponding path program 1 times [2025-04-16 01:06:19,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:19,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330373468] [2025-04-16 01:06:19,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:19,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-16 01:06:19,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-16 01:06:19,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:19,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:19,643 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 01:06:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:19,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330373468] [2025-04-16 01:06:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330373468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:19,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:19,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875359264] [2025-04-16 01:06:19,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:19,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:19,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:19,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:19,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:19,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:19,665 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:19,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 17.0) internal successors, (17), 2 states have internal predecessors, (17), 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:06:19,666 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:19,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:19,695 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:19,695 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:19,695 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:19,695 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:19,695 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:19,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-16 01:06:19,699 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:19,700 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2025-04-16 01:06:19,705 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,706 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:19,706 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 01:06:19,707 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,707 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 01:06:19,750 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 01:06:19,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -106956964, now seen corresponding path program 1 times [2025-04-16 01:06:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:19,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836497454] [2025-04-16 01:06:19,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:19,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-16 01:06:19,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-16 01:06:19,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:19,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:19,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 01:06:19,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-16 01:06:19,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-16 01:06:19,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:19,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:19,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 01:06:19,804 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 01:06:19,804 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 01:06:19,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-16 01:06:19,809 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:19,809 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-04-16 01:06:19,810 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 01:06:19,810 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-16 01:06:19,827 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 01:06:19,829 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,835 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:19,836 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 01:06:19,836 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,836 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 01:06:19,914 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 01:06:19,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1356951477, now seen corresponding path program 1 times [2025-04-16 01:06:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:19,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902314551] [2025-04-16 01:06:19,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:19,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-16 01:06:19,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-16 01:06:19,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:19,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:19,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 01:06:19,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-16 01:06:19,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-16 01:06:19,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:19,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:19,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 01:06:19,950 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 01:06:19,951 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 01:06:19,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-16 01:06:19,951 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:19,952 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-04-16 01:06:19,952 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 01:06:19,952 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-16 01:06:19,968 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 01:06:19,971 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,981 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:19,981 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-04-16 01:06:19,981 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:19,981 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:20,106 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:20,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 603042024, now seen corresponding path program 1 times [2025-04-16 01:06:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:20,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341201647] [2025-04-16 01:06:20,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:20,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-16 01:06:20,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-16 01:06:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:20,137 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 01:06:20,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:20,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341201647] [2025-04-16 01:06:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341201647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:20,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260012807] [2025-04-16 01:06:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:20,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:20,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:20,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:20,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:20,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:20,139 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:20,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 19.0) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 01:06:20,139 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:20,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:20,883 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:20,883 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:20,883 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:20,883 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:20,883 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:20,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-16 01:06:20,884 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:20,884 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2025-04-16 01:06:20,886 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:20,886 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:20,886 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 01:06:20,887 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:20,887 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 01:06:20,910 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 01:06:20,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash -297371660, now seen corresponding path program 1 times [2025-04-16 01:06:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:20,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250625706] [2025-04-16 01:06:20,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:20,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-16 01:06:20,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-16 01:06:20,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:20,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:20,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 01:06:20,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-16 01:06:20,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-16 01:06:20,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:20,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:20,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 01:06:20,933 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 01:06:20,933 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 01:06:20,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-16 01:06:20,934 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:20,936 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2025-04-16 01:06:20,936 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 01:06:20,936 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-16 01:06:20,955 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 01:06:20,958 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:20,965 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:20,966 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2025-04-16 01:06:20,966 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:20,966 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:21,048 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:21,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1650759322, now seen corresponding path program 1 times [2025-04-16 01:06:21,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:21,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871909611] [2025-04-16 01:06:21,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:21,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-16 01:06:21,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-16 01:06:21,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:21,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:21,078 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 01:06:21,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:21,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871909611] [2025-04-16 01:06:21,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871909611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:21,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:21,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:21,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646538070] [2025-04-16 01:06:21,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:21,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:21,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:21,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:21,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:21,080 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:21,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 19.0) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 01:06:21,080 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:23,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:23,210 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:23,210 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:23,210 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:23,210 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:23,210 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:23,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-16 01:06:23,213 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:23,213 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of4ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/5) [2025-04-16 01:06:23,216 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:23,217 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:23,218 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread4of4ForFork0 ======== [2025-04-16 01:06:23,218 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:23,218 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:23,290 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:23,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash 466597058, now seen corresponding path program 1 times [2025-04-16 01:06:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:23,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291444592] [2025-04-16 01:06:23,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:23,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-16 01:06:23,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-16 01:06:23,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:23,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:23,319 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 01:06:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:23,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291444592] [2025-04-16 01:06:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291444592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:23,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:23,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271814401] [2025-04-16 01:06:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:23,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:23,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:23,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:23,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:23,321 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:23,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 20.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 01:06:23,321 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:24,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:24,906 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:24,906 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:24,907 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:24,909 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:24,909 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:24,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-16 01:06:24,911 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:24,911 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread4of4ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (2/5) [2025-04-16 01:06:24,916 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:24,917 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:24,917 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of4ForFork0 ======== [2025-04-16 01:06:24,917 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:24,917 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:24,968 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:24,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1452223345, now seen corresponding path program 1 times [2025-04-16 01:06:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:24,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889069566] [2025-04-16 01:06:24,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:24,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-16 01:06:24,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-16 01:06:24,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:24,977 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 01:06:24,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:24,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889069566] [2025-04-16 01:06:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889069566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:24,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012933270] [2025-04-16 01:06:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:24,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:24,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:24,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:24,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:24,979 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:24,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 17.0) internal successors, (17), 2 states have internal predecessors, (17), 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:06:24,979 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:26,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:26,542 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:26,542 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:26,542 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:26,542 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:26,542 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:26,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-16 01:06:26,546 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:26,547 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of4ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (3/5) [2025-04-16 01:06:26,548 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:26,548 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:26,548 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of4ForFork0 ======== [2025-04-16 01:06:26,549 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:26,549 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:26,600 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:26,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1427320373, now seen corresponding path program 1 times [2025-04-16 01:06:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:26,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142373169] [2025-04-16 01:06:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:26,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-16 01:06:26,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-16 01:06:26,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:26,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:26,614 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 01:06:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:26,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142373169] [2025-04-16 01:06:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142373169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207893529] [2025-04-16 01:06:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:26,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:26,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:26,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:26,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:26,619 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:26,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 18.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 01:06:26,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:27,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:27,937 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:27,937 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:27,938 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:27,938 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:27,938 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:27,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-16 01:06:27,939 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:27,939 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread2of4ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (4/5) [2025-04-16 01:06:27,940 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:27,940 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:27,940 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 01:06:27,941 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:27,941 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 01:06:27,960 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 01:06:27,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1722668953, now seen corresponding path program 1 times [2025-04-16 01:06:27,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:27,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072857451] [2025-04-16 01:06:27,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:27,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-16 01:06:27,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-16 01:06:27,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:27,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:27,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 01:06:27,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-16 01:06:27,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-16 01:06:27,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:27,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:27,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 01:06:27,975 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 01:06:27,975 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 01:06:27,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-16 01:06:27,976 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:27,976 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (5/5) [2025-04-16 01:06:27,976 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 01:06:27,976 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-16 01:06:27,992 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 01:06:27,993 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:28,002 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:28,002 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of5ForFork0 ======== [2025-04-16 01:06:28,002 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:28,002 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:28,052 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:28,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -644973267, now seen corresponding path program 1 times [2025-04-16 01:06:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:28,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112860981] [2025-04-16 01:06:28,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:28,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-16 01:06:28,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-16 01:06:28,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:28,061 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 01:06:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:28,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112860981] [2025-04-16 01:06:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112860981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980922442] [2025-04-16 01:06:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:28,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:28,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:28,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:28,062 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:28,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 18.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 01:06:28,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:39,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:39,455 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:39,455 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:39,455 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:39,455 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:39,455 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:39,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-16 01:06:39,457 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:39,457 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread2of5ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/6) [2025-04-16 01:06:39,458 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:39,459 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:39,459 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of5ForFork0 ======== [2025-04-16 01:06:39,460 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:39,460 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:39,531 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:39,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash 235006152, now seen corresponding path program 1 times [2025-04-16 01:06:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:39,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908914841] [2025-04-16 01:06:39,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:39,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-16 01:06:39,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-16 01:06:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:39,548 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 01:06:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:39,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908914841] [2025-04-16 01:06:39,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908914841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:39,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:39,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335803854] [2025-04-16 01:06:39,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:39,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:39,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:39,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:39,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:39,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:39,550 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:39,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 17.0) internal successors, (17), 2 states have internal predecessors, (17), 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:06:39,550 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:50,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:50,827 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:06:50,827 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:06:50,827 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:06:50,827 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:06:50,827 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:06:50,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-16 01:06:50,828 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:50,828 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of5ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (2/6) [2025-04-16 01:06:50,829 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:50,830 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:50,830 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 01:06:50,830 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:50,831 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 01:06:50,847 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 01:06:50,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1830591940, now seen corresponding path program 1 times [2025-04-16 01:06:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:50,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606506841] [2025-04-16 01:06:50,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:50,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-16 01:06:50,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-16 01:06:50,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:50,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:50,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 01:06:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-16 01:06:50,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-16 01:06:50,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:50,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:06:50,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 01:06:50,870 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 01:06:50,871 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 01:06:50,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-16 01:06:50,874 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:06:50,874 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/6) [2025-04-16 01:06:50,874 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 01:06:50,874 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-16 01:06:50,890 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 01:06:50,891 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:50,901 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:06:50,901 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread6of6ForFork0 ======== [2025-04-16 01:06:50,901 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:06:50,902 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:06:50,959 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:06:50,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:06:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash -878609481, now seen corresponding path program 1 times [2025-04-16 01:06:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:06:50,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764865384] [2025-04-16 01:06:50,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:06:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:06:50,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-16 01:06:50,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-16 01:06:50,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:06:50,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:06:50,972 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 01:06:50,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:06:50,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764865384] [2025-04-16 01:06:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764865384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:06:50,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:06:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:06:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069375201] [2025-04-16 01:06:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:06:50,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:06:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:06:50,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:06:50,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:06:50,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:06:50,975 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:06:50,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 22.0) internal successors, (22), 2 states have internal predecessors, (22), 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:06:50,976 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:08:53,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:08:53,941 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:08:53,941 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:08:53,941 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:08:53,941 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:08:53,942 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:08:53,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-16 01:08:53,943 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:08:53,943 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread6of6ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/7) [2025-04-16 01:08:53,944 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:08:53,945 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:08:53,945 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of6ForFork0 ======== [2025-04-16 01:08:53,945 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:08:53,945 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:08:54,010 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:08:54,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:08:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2070341949, now seen corresponding path program 1 times [2025-04-16 01:08:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:08:54,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185108765] [2025-04-16 01:08:54,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:08:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:08:54,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-16 01:08:54,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-16 01:08:54,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:08:54,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:08:54,018 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 01:08:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:08:54,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185108765] [2025-04-16 01:08:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185108765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:08:54,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:08:54,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:08:54,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050459793] [2025-04-16 01:08:54,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:08:54,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:08:54,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:08:54,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:08:54,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:08:54,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:08:54,020 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:08:54,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 17.0) internal successors, (17), 2 states have internal predecessors, (17), 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:08:54,021 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:11:10,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:11:10,426 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:11:10,427 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:11:10,427 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:11:10,427 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:11:10,427 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:11:10,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-16 01:11:10,428 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:11:10,428 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of6ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (2/7) [2025-04-16 01:11:10,430 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:11:10,432 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:11:10,433 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread5of6ForFork0 ======== [2025-04-16 01:11:10,433 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:11:10,433 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:11:10,494 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:11:10,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:11:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1092733795, now seen corresponding path program 1 times [2025-04-16 01:11:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:11:10,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147424489] [2025-04-16 01:11:10,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:11:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:11:10,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-16 01:11:10,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-16 01:11:10,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:11:10,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:11:10,507 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 01:11:10,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:11:10,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147424489] [2025-04-16 01:11:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147424489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:11:10,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:11:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:11:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217378607] [2025-04-16 01:11:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:11:10,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:11:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:11:10,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:11:10,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:11:10,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:11:10,508 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:11:10,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 01:11:10,508 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:13:28,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:13:28,276 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 5 remaining) [2025-04-16 01:13:28,276 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-16 01:13:28,276 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-16 01:13:28,276 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-16 01:13:28,276 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-16 01:13:28,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-16 01:13:28,278 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:13:28,278 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread5of6ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (3/7) [2025-04-16 01:13:28,280 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:13:28,280 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:13:28,281 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-16 01:13:28,281 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:13:28,281 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-16 01:13:28,313 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-16 01:13:28,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:13:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1764700548, now seen corresponding path program 1 times [2025-04-16 01:13:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:13:28,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654395512] [2025-04-16 01:13:28,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:13:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:13:28,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-16 01:13:28,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-16 01:13:28,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:13:28,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:13:28,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-16 01:13:28,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-16 01:13:28,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-16 01:13:28,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:13:28,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-16 01:13:28,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-16 01:13:28,350 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-16 01:13:28,350 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-16 01:13:28,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-16 01:13:28,354 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-16 01:13:28,354 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (4/7) [2025-04-16 01:13:28,354 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-16 01:13:28,354 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-16 01:13:28,385 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-16 01:13:28,389 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:13:28,401 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-16 01:13:28,401 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread5of7ForFork0 ======== [2025-04-16 01:13:28,402 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;@65c32206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-16 01:13:28,402 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-16 01:13:28,490 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-16 01:13:28,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-16 01:13:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash -765027387, now seen corresponding path program 1 times [2025-04-16 01:13:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-16 01:13:28,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369745735] [2025-04-16 01:13:28,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-16 01:13:28,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-16 01:13:28,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-16 01:13:28,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-16 01:13:28,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-16 01:13:28,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-16 01:13:28,507 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 01:13:28,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-16 01:13:28,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369745735] [2025-04-16 01:13:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369745735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-16 01:13:28,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-16 01:13:28,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-16 01:13:28,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891048105] [2025-04-16 01:13:28,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-16 01:13:28,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-16 01:13:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-16 01:13:28,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-16 01:13:28,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-16 01:13:28,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-16 01:13:28,509 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-16 01:13:28,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-16 01:13:28,509 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.