/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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:55,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:55,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:59:55,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:55,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:55,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:55,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:55,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:55,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:55,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:55,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:55,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:55,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:55,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:55,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:55,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:55,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All 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.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:59:55,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:55,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:55,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:55,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:55,489 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:55,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-03-15 00:59:56,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069460f7c/2de2cde8afe74f989206e36a981bda19/FLAG5349d51e4 [2025-03-15 00:59:56,855 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:56,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2025-03-15 00:59:56,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069460f7c/2de2cde8afe74f989206e36a981bda19/FLAG5349d51e4 [2025-03-15 00:59:57,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/069460f7c/2de2cde8afe74f989206e36a981bda19 [2025-03-15 00:59:57,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:57,234 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:57,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:57,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:57,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:57,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3d2af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57, skipping insertion in model container [2025-03-15 00:59:57,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:57,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:57,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:57,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:57,417 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:57,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57 WrapperNode [2025-03-15 00:59:57,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:57,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:57,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:57,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:57,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,478 INFO L138 Inliner]: procedures = 28, calls = 66, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 489 [2025-03-15 00:59:57,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:57,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:57,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:57,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:57,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:57,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:57,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:57,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:57,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:57,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:59:57,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:59:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:59:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 00:59:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 00:59:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-15 00:59:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-15 00:59:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:59:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:57,582 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:59:57,695 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:57,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:58,248 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:58,248 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:58,507 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:58,508 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-15 00:59:58,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:58 BoogieIcfgContainer [2025-03-15 00:59:58,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:58,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:58,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:58,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:58,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:57" (1/3) ... [2025-03-15 00:59:58,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e88bc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:58, skipping insertion in model container [2025-03-15 00:59:58,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57" (2/3) ... [2025-03-15 00:59:58,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e88bc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:58, skipping insertion in model container [2025-03-15 00:59:58,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:58" (3/3) ... [2025-03-15 00:59:58,515 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2025-03-15 00:59:58,525 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:58,526 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1-dsl.wvr.c that has 7 procedures, 346 locations, 1 initial locations, 5 loop locations, and 71 error locations. [2025-03-15 00:59:58,526 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:58,630 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-15 00:59:58,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:58,673 INFO L333 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@195a63cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:58,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2025-03-15 00:59:58,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:58,689 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-15 00:59:58,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:58,691 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:58,691 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:58,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 00:59:58,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1652415629, now seen corresponding path program 1 times [2025-03-15 00:59:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561381773] [2025-03-15 00:59:58,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:58,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:58,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:58,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561381773] [2025-03-15 00:59:58,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561381773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:58,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442851424] [2025-03-15 00:59:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:58,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:58,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:58,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:58,886 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 374 [2025-03-15 00:59:58,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 370 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-03-15 00:59:58,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:58,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 374 [2025-03-15 00:59:58,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:00,119 INFO L124 PetriNetUnfolderBase]: 2800/6305 cut-off events. [2025-03-15 01:00:00,119 INFO L125 PetriNetUnfolderBase]: For 1095/1095 co-relation queries the response was YES. [2025-03-15 01:00:00,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10995 conditions, 6305 events. 2800/6305 cut-off events. For 1095/1095 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49380 event pairs, 1446 based on Foata normal form. 1048/6420 useless extension candidates. Maximal degree in co-relation 10547. Up to 3555 conditions per place. [2025-03-15 01:00:00,200 INFO L140 encePairwiseOnDemand]: 306/374 looper letters, 39 selfloop transitions, 2 changer transitions 12/284 dead transitions. [2025-03-15 01:00:00,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 284 transitions, 698 flow [2025-03-15 01:00:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2025-03-15 01:00:00,213 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.785204991087344 [2025-03-15 01:00:00,215 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -76 predicate places. [2025-03-15 01:00:00,216 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 284 transitions, 698 flow [2025-03-15 01:00:00,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-03-15 01:00:00,216 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:00,216 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:00,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:00:00,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:00,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 90546190, now seen corresponding path program 1 times [2025-03-15 01:00:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265408681] [2025-03-15 01:00:00,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265408681] [2025-03-15 01:00:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265408681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104589725] [2025-03-15 01:00:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:00,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:00,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:00,255 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 374 [2025-03-15 01:00:00,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 284 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-03-15 01:00:00,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:00,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 374 [2025-03-15 01:00:00,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:01,169 INFO L124 PetriNetUnfolderBase]: 2800/6304 cut-off events. [2025-03-15 01:00:01,169 INFO L125 PetriNetUnfolderBase]: For 2482/3198 co-relation queries the response was YES. [2025-03-15 01:00:01,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14548 conditions, 6304 events. 2800/6304 cut-off events. For 2482/3198 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49290 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 13997. Up to 3555 conditions per place. [2025-03-15 01:00:01,230 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 36 selfloop transitions, 2 changer transitions 12/283 dead transitions. [2025-03-15 01:00:01,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 283 transitions, 772 flow [2025-03-15 01:00:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2025-03-15 01:00:01,235 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.732620320855615 [2025-03-15 01:00:01,235 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -75 predicate places. [2025-03-15 01:00:01,235 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 283 transitions, 772 flow [2025-03-15 01:00:01,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-03-15 01:00:01,236 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:01,236 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:01,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:00:01,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:01,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash -420940712, now seen corresponding path program 1 times [2025-03-15 01:00:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:01,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279492355] [2025-03-15 01:00:01,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:01,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:01,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279492355] [2025-03-15 01:00:01,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279492355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:01,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:01,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:01,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088408026] [2025-03-15 01:00:01,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:01,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:01,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:01,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:01,291 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-15 01:00:01,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 283 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:01,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:01,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-15 01:00:01,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:02,180 INFO L124 PetriNetUnfolderBase]: 2800/6303 cut-off events. [2025-03-15 01:00:02,180 INFO L125 PetriNetUnfolderBase]: For 4976/6408 co-relation queries the response was YES. [2025-03-15 01:00:02,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18098 conditions, 6303 events. 2800/6303 cut-off events. For 4976/6408 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49277 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 17447. Up to 3555 conditions per place. [2025-03-15 01:00:02,232 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 12/282 dead transitions. [2025-03-15 01:00:02,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 282 transitions, 840 flow [2025-03-15 01:00:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-15 01:00:02,237 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-15 01:00:02,237 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -74 predicate places. [2025-03-15 01:00:02,237 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 282 transitions, 840 flow [2025-03-15 01:00:02,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:02,238 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:02,238 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:00:02,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:02,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -584269274, now seen corresponding path program 1 times [2025-03-15 01:00:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498776074] [2025-03-15 01:00:02,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:02,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:02,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498776074] [2025-03-15 01:00:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498776074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206612621] [2025-03-15 01:00:02,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:02,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:02,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:02,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:02,313 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-15 01:00:02,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 282 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:02,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:02,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-15 01:00:02,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:03,083 INFO L124 PetriNetUnfolderBase]: 2800/6302 cut-off events. [2025-03-15 01:00:03,083 INFO L125 PetriNetUnfolderBase]: For 8577/10725 co-relation queries the response was YES. [2025-03-15 01:00:03,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21648 conditions, 6302 events. 2800/6302 cut-off events. For 8577/10725 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49286 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 20897. Up to 3555 conditions per place. [2025-03-15 01:00:03,159 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 12/281 dead transitions. [2025-03-15 01:00:03,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 281 transitions, 908 flow [2025-03-15 01:00:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-15 01:00:03,162 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-15 01:00:03,167 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -73 predicate places. [2025-03-15 01:00:03,167 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 281 transitions, 908 flow [2025-03-15 01:00:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:03,168 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:03,168 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:03,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:00:03,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:03,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1303765934, now seen corresponding path program 1 times [2025-03-15 01:00:03,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:03,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146412588] [2025-03-15 01:00:03,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:03,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146412588] [2025-03-15 01:00:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146412588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:03,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302074678] [2025-03-15 01:00:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:03,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:03,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:03,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:03,259 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-15 01:00:03,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 281 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:03,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:03,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-15 01:00:03,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:04,199 INFO L124 PetriNetUnfolderBase]: 2800/6301 cut-off events. [2025-03-15 01:00:04,200 INFO L125 PetriNetUnfolderBase]: For 13285/16149 co-relation queries the response was YES. [2025-03-15 01:00:04,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25198 conditions, 6301 events. 2800/6301 cut-off events. For 13285/16149 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49292 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 24361. Up to 3555 conditions per place. [2025-03-15 01:00:04,251 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 12/280 dead transitions. [2025-03-15 01:00:04,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 280 transitions, 976 flow [2025-03-15 01:00:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-15 01:00:04,253 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-15 01:00:04,257 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -72 predicate places. [2025-03-15 01:00:04,257 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 280 transitions, 976 flow [2025-03-15 01:00:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:04,257 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:04,257 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:04,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:00:04,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:04,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash -843312985, now seen corresponding path program 1 times [2025-03-15 01:00:04,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:04,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936527156] [2025-03-15 01:00:04,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:04,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936527156] [2025-03-15 01:00:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936527156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:04,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:04,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573560835] [2025-03-15 01:00:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:04,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:04,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:04,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:04,312 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 374 [2025-03-15 01:00:04,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 280 transitions, 976 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-03-15 01:00:04,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:04,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 374 [2025-03-15 01:00:04,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:05,079 INFO L124 PetriNetUnfolderBase]: 2800/6300 cut-off events. [2025-03-15 01:00:05,079 INFO L125 PetriNetUnfolderBase]: For 19100/22680 co-relation queries the response was YES. [2025-03-15 01:00:05,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28751 conditions, 6300 events. 2800/6300 cut-off events. For 19100/22680 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49277 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 27829. Up to 3555 conditions per place. [2025-03-15 01:00:05,141 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 35 selfloop transitions, 2 changer transitions 12/279 dead transitions. [2025-03-15 01:00:05,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 279 transitions, 1050 flow [2025-03-15 01:00:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 822 transitions. [2025-03-15 01:00:05,144 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.732620320855615 [2025-03-15 01:00:05,145 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -71 predicate places. [2025-03-15 01:00:05,145 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 279 transitions, 1050 flow [2025-03-15 01:00:05,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-03-15 01:00:05,145 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:05,145 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:05,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:00:05,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:05,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1787830874, now seen corresponding path program 1 times [2025-03-15 01:00:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:05,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248264687] [2025-03-15 01:00:05,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248264687] [2025-03-15 01:00:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248264687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118306918] [2025-03-15 01:00:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:05,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:05,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:05,197 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-15 01:00:05,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 279 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:05,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:05,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-15 01:00:05,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:06,085 INFO L124 PetriNetUnfolderBase]: 2800/6299 cut-off events. [2025-03-15 01:00:06,085 INFO L125 PetriNetUnfolderBase]: For 26022/30318 co-relation queries the response was YES. [2025-03-15 01:00:06,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32301 conditions, 6299 events. 2800/6299 cut-off events. For 26022/30318 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49353 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 31297. Up to 3555 conditions per place. [2025-03-15 01:00:06,147 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 12/278 dead transitions. [2025-03-15 01:00:06,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 278 transitions, 1118 flow [2025-03-15 01:00:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-15 01:00:06,152 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-15 01:00:06,153 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -70 predicate places. [2025-03-15 01:00:06,153 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 278 transitions, 1118 flow [2025-03-15 01:00:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:06,154 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:06,154 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:00:06,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:06,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 38937063, now seen corresponding path program 1 times [2025-03-15 01:00:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271260023] [2025-03-15 01:00:06,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:06,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271260023] [2025-03-15 01:00:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271260023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:06,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073912046] [2025-03-15 01:00:06,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:06,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:06,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:06,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:06,208 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-15 01:00:06,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 278 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:06,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:06,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-15 01:00:06,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:07,015 INFO L124 PetriNetUnfolderBase]: 2800/6298 cut-off events. [2025-03-15 01:00:07,015 INFO L125 PetriNetUnfolderBase]: For 34051/39063 co-relation queries the response was YES. [2025-03-15 01:00:07,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35851 conditions, 6298 events. 2800/6298 cut-off events. For 34051/39063 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49321 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 34765. Up to 3555 conditions per place. [2025-03-15 01:00:07,107 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 12/277 dead transitions. [2025-03-15 01:00:07,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 277 transitions, 1186 flow [2025-03-15 01:00:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-15 01:00:07,109 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-15 01:00:07,110 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -69 predicate places. [2025-03-15 01:00:07,110 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 277 transitions, 1186 flow [2025-03-15 01:00:07,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:07,110 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:07,111 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:00:07,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1110991207, now seen corresponding path program 1 times [2025-03-15 01:00:07,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:07,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340050814] [2025-03-15 01:00:07,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340050814] [2025-03-15 01:00:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340050814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426428948] [2025-03-15 01:00:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:07,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:07,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:07,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:07,150 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-15 01:00:07,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 277 transitions, 1186 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:07,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:07,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-15 01:00:07,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:08,214 INFO L124 PetriNetUnfolderBase]: 2800/6297 cut-off events. [2025-03-15 01:00:08,215 INFO L125 PetriNetUnfolderBase]: For 43187/48915 co-relation queries the response was YES. [2025-03-15 01:00:08,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39401 conditions, 6297 events. 2800/6297 cut-off events. For 43187/48915 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49359 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 38233. Up to 3555 conditions per place. [2025-03-15 01:00:08,295 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 12/276 dead transitions. [2025-03-15 01:00:08,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 276 transitions, 1254 flow [2025-03-15 01:00:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-15 01:00:08,297 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-15 01:00:08,298 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -68 predicate places. [2025-03-15 01:00:08,298 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 276 transitions, 1254 flow [2025-03-15 01:00:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:08,298 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:08,299 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:00:08,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1074658348, now seen corresponding path program 1 times [2025-03-15 01:00:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987409453] [2025-03-15 01:00:08,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987409453] [2025-03-15 01:00:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987409453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:08,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628542763] [2025-03-15 01:00:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:08,345 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 374 [2025-03-15 01:00:08,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 276 transitions, 1254 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-03-15 01:00:08,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:08,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 374 [2025-03-15 01:00:08,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:09,047 INFO L124 PetriNetUnfolderBase]: 2800/6295 cut-off events. [2025-03-15 01:00:09,048 INFO L125 PetriNetUnfolderBase]: For 53423/59867 co-relation queries the response was YES. [2025-03-15 01:00:09,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42949 conditions, 6295 events. 2800/6295 cut-off events. For 53423/59867 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49256 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 41701. Up to 3553 conditions per place. [2025-03-15 01:00:09,126 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 35 selfloop transitions, 1 changer transitions 12/274 dead transitions. [2025-03-15 01:00:09,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 274 transitions, 1318 flow [2025-03-15 01:00:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 824 transitions. [2025-03-15 01:00:09,131 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7344028520499108 [2025-03-15 01:00:09,132 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -68 predicate places. [2025-03-15 01:00:09,132 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 274 transitions, 1318 flow [2025-03-15 01:00:09,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-03-15 01:00:09,132 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:09,132 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:00:09,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1713699992, now seen corresponding path program 1 times [2025-03-15 01:00:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56999272] [2025-03-15 01:00:09,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:09,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56999272] [2025-03-15 01:00:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56999272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:09,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:09,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:00:09,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578074227] [2025-03-15 01:00:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:00:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:09,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:00:09,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:00:09,615 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 374 [2025-03-15 01:00:09,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 274 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 253.83333333333334) internal successors, (1523), 6 states have internal predecessors, (1523), 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-03-15 01:00:09,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:09,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 374 [2025-03-15 01:00:09,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:10,403 INFO L124 PetriNetUnfolderBase]: 2800/6294 cut-off events. [2025-03-15 01:00:10,403 INFO L125 PetriNetUnfolderBase]: For 64763/71923 co-relation queries the response was YES. [2025-03-15 01:00:10,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46512 conditions, 6294 events. 2800/6294 cut-off events. For 64763/71923 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49205 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 45169. Up to 3559 conditions per place. [2025-03-15 01:00:10,494 INFO L140 encePairwiseOnDemand]: 368/374 looper letters, 43 selfloop transitions, 5 changer transitions 12/273 dead transitions. [2025-03-15 01:00:10,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 273 transitions, 1412 flow [2025-03-15 01:00:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:00:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:00:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1561 transitions. [2025-03-15 01:00:10,497 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6956327985739751 [2025-03-15 01:00:10,497 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -64 predicate places. [2025-03-15 01:00:10,497 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 273 transitions, 1412 flow [2025-03-15 01:00:10,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.83333333333334) internal successors, (1523), 6 states have internal predecessors, (1523), 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-03-15 01:00:10,498 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:10,498 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:10,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:00:10,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:10,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1097833071, now seen corresponding path program 1 times [2025-03-15 01:00:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:10,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541609801] [2025-03-15 01:00:10,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541609801] [2025-03-15 01:00:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541609801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:10,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:10,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881684652] [2025-03-15 01:00:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:10,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:10,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:10,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:10,532 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 374 [2025-03-15 01:00:10,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 273 transitions, 1412 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:10,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:10,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 374 [2025-03-15 01:00:10,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:11,332 INFO L124 PetriNetUnfolderBase]: 2800/6293 cut-off events. [2025-03-15 01:00:11,332 INFO L125 PetriNetUnfolderBase]: For 77218/85094 co-relation queries the response was YES. [2025-03-15 01:00:11,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50062 conditions, 6293 events. 2800/6293 cut-off events. For 77218/85094 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49406 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 48637. Up to 3559 conditions per place. [2025-03-15 01:00:11,430 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 33 selfloop transitions, 2 changer transitions 12/272 dead transitions. [2025-03-15 01:00:11,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 272 transitions, 1480 flow [2025-03-15 01:00:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2025-03-15 01:00:11,432 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7379679144385026 [2025-03-15 01:00:11,433 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -63 predicate places. [2025-03-15 01:00:11,433 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 272 transitions, 1480 flow [2025-03-15 01:00:11,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-03-15 01:00:11,433 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:11,433 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:11,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:00:11,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1885275370, now seen corresponding path program 1 times [2025-03-15 01:00:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955100720] [2025-03-15 01:00:11,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:11,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:11,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955100720] [2025-03-15 01:00:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955100720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:11,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739379856] [2025-03-15 01:00:11,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:11,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:11,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:11,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:11,494 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 374 [2025-03-15 01:00:11,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 272 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:11,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:11,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 374 [2025-03-15 01:00:11,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:12,309 INFO L124 PetriNetUnfolderBase]: 2800/6292 cut-off events. [2025-03-15 01:00:12,314 INFO L125 PetriNetUnfolderBase]: For 90770/99362 co-relation queries the response was YES. [2025-03-15 01:00:12,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53610 conditions, 6292 events. 2800/6292 cut-off events. For 90770/99362 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49192 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 52105. Up to 3559 conditions per place. [2025-03-15 01:00:12,420 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 33 selfloop transitions, 1 changer transitions 12/271 dead transitions. [2025-03-15 01:00:12,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 271 transitions, 1544 flow [2025-03-15 01:00:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2025-03-15 01:00:12,422 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7397504456327986 [2025-03-15 01:00:12,423 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -62 predicate places. [2025-03-15 01:00:12,423 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 271 transitions, 1544 flow [2025-03-15 01:00:12,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:12,423 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:12,423 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:12,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:00:12,424 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2025-03-15 01:00:12,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2029774833, now seen corresponding path program 1 times [2025-03-15 01:00:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:12,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143312764] [2025-03-15 01:00:12,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:12,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:12,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143312764] [2025-03-15 01:00:12,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143312764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:12,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:12,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:12,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242549211] [2025-03-15 01:00:12,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:12,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:12,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:12,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:12,488 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 374 [2025-03-15 01:00:12,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 271 transitions, 1544 flow. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:12,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:12,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 374 [2025-03-15 01:00:12,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:13,372 INFO L124 PetriNetUnfolderBase]: 2800/6291 cut-off events. [2025-03-15 01:00:13,372 INFO L125 PetriNetUnfolderBase]: For 105429/114737 co-relation queries the response was YES. [2025-03-15 01:00:13,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57158 conditions, 6291 events. 2800/6291 cut-off events. For 105429/114737 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49198 event pairs, 1446 based on Foata normal form. 0/5372 useless extension candidates. Maximal degree in co-relation 55573. Up to 3559 conditions per place. [2025-03-15 01:00:13,413 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 0 selfloop transitions, 0 changer transitions 270/270 dead transitions. [2025-03-15 01:00:13,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 270 transitions, 1608 flow [2025-03-15 01:00:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 830 transitions. [2025-03-15 01:00:13,415 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7397504456327986 [2025-03-15 01:00:13,415 INFO L298 CegarLoopForPetriNet]: 372 programPoint places, -61 predicate places. [2025-03-15 01:00:13,415 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 270 transitions, 1608 flow [2025-03-15 01:00:13,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:13,426 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-parallel-sum-1-dsl.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:00:13,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (134 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (133 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2025-03-15 01:00:13,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2025-03-15 01:00:13,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2025-03-15 01:00:13,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2025-03-15 01:00:13,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2025-03-15 01:00:13,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2025-03-15 01:00:13,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2025-03-15 01:00:13,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2025-03-15 01:00:13,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2025-03-15 01:00:13,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 137 remaining) [2025-03-15 01:00:13,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork2Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork2Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2025-03-15 01:00:13,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2025-03-15 01:00:13,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2025-03-15 01:00:13,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2025-03-15 01:00:13,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:00:13,466 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:13,470 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:00:13,470 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:00:13,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:00:13 BasicIcfg [2025-03-15 01:00:13,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:00:13,475 INFO L158 Benchmark]: Toolchain (without parser) took 16240.95ms. Allocated memory was 71.3MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 44.4MB in the beginning and 392.2MB in the end (delta: -347.7MB). Peak memory consumption was 872.2MB. Max. memory is 8.0GB. [2025-03-15 01:00:13,475 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:13,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.30ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 30.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:00:13,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.36ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 27.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:13,476 INFO L158 Benchmark]: Boogie Preprocessor took 50.95ms. Allocated memory is still 71.3MB. Free memory was 27.1MB in the beginning and 24.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:00:13,476 INFO L158 Benchmark]: RCFGBuilder took 977.62ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.4MB in the beginning and 20.1MB in the end (delta: 4.3MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. [2025-03-15 01:00:13,476 INFO L158 Benchmark]: TraceAbstraction took 14965.10ms. Allocated memory was 88.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 19.3MB in the beginning and 392.2MB in the end (delta: -372.9MB). Peak memory consumption was 828.0MB. Max. memory is 8.0GB. [2025-03-15 01:00:13,477 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.30ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 30.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.36ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 27.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 50.95ms. Allocated memory is still 71.3MB. Free memory was 27.1MB in the beginning and 24.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 977.62ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.4MB in the beginning and 20.1MB in the end (delta: 4.3MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. * TraceAbstraction took 14965.10ms. Allocated memory was 88.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 19.3MB in the beginning and 392.2MB in the end (delta: -372.9MB). Peak memory consumption was 828.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 164]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 502 locations, 137 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 935 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 76 mSDtfsCounter, 935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1608occurred in iteration=14, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:00:13,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...